An idea for finding the shortest driving time using genetic algorithm based routing approach on mobile devices

Basit Öğe Kaydı
dc.contributor.authorAtila, U.
dc.contributor.authorKaras, I.R.
dc.contributor.authorGologlu, C.
dc.contributor.authorYaman, B.
dc.contributor.authorOrak, I.M.
dc.date.accessioned2024-09-29T16:22:12Z
dc.date.available2024-09-29T16:22:12Z
dc.date.issued2012
dc.departmentKarabük Üniversitesien_US
dc.description.abstractPeople's orientation to the mobile devices all over the world have made the using of route guidance systems that assist drivers on the traffic widespread in daily life. For an effective routing, these systems should take into account the effectual factors of traffic flow such as allowable velocity limits of the roads and density. The computational cost of the system is up to the amount of nodes in road network and effectual factors. When we consider the road networks with excessive number of nodes, finding the exact routes in real time using some well known deterministic methods such as Dijkstra's algorithm on such routing systems may not be accurate using mobile devices with limited memory capacity and processing speed. In this paper, a Genetic Algorithm (GA) approach applied on a route guidance system for finding the shortest driving time is proposed. A different gene search approach on crossover operation named "first match- genes" had been introduced. A mobile application for the traffic network of Ankara and the performance of the genetic algorithm tested on networks with 10, 50, 250, 1000 nodes was presented.en_US
dc.identifier.endpage16en_US
dc.identifier.issn1998-0159
dc.identifier.issue1en_US
dc.identifier.scopus2-s2.0-84857293579en_US
dc.identifier.scopusqualityN/Aen_US
dc.identifier.startpage9en_US
dc.identifier.urihttps://hdl.handle.net/20.500.14619/9881
dc.identifier.volume6en_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.relation.ispartofInternational Journal of Mathematics and Computers in Simulationen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectGenetic algorithmen_US
dc.subjectNavigationen_US
dc.subjectOptimizationen_US
dc.subjectRoute guidanceen_US
dc.subjectShortest driving timeen_US
dc.subjectShortest pathen_US
dc.titleAn idea for finding the shortest driving time using genetic algorithm based routing approach on mobile devicesen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu