An idea for finding the shortest driving time using genetic algorithm based routing approach on mobile devices
Küçük Resim Yok
Tarih
2012
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
People'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.
Açıklama
Anahtar Kelimeler
Genetic algorithm, Navigation, Optimization, Route guidance, Shortest driving time, Shortest path
Kaynak
International Journal of Mathematics and Computers in Simulation
WoS Q Değeri
Scopus Q Değeri
N/A
Cilt
6
Sayı
1
