A genetic algorithm approach for finding the shortest driving time on mobile devices

Scientific Research and Essays

Volumn 6, Issue 2, 2011, Pages 394-405

  Karas, Ismail Rakip ^a   Atila, Umit ^b  

^a KARABUK UNIVERSITY   (Turkey)

^b GAZI UNIVERSITY   (Turkey)

Author keywords

Genetic algorithm; Navigation; Optimization; Route guidance; Shortest driving time; Shortest path

Indexed keywords

EID: 79953736559     PISSN: None     EISSN: 19922248     Source Type: Journal    
DOI: None     Document Type: Article

References (14)

1. Ahn CW, Ramakrishna RS (2002). A Genetic Algorithm for Shortest Path Routing Problem and the Sizing of Populations. IEEE Trans. Evol. Comput., 6: 566-579.
2. Aruga K, Sessions J, Akay A, Chung W (2005). Simultaneous optimization of horizontal and vertical alignments of forest roads using Tabu Search. Int. J. Forest Eng., 16(2): 137-151.
3. Cedric D, Pawan D (2003). Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks. Eur. J. Oper. Res., 144: 27-38.
4. De Jong K (1988). Learning with Genetic Algorithms: An Overview. Machine Learn., 3: 121-138.
5. Dijkstra EW (1959). A Note on Two Problems in Connection with Graphs. Numerische Math., 1: 269-271.
6. Goldberg DE (1989). Genetic Algorithms in Search Optimizations and Machine Learning. Boston, Addison-Wesley Longman Publishing Co.
7. Hasan BS, Khamees MA, Mahmoud ASH (2007). A Heuristic Genetic Algorithm for the Single Source Shortest Path Problem. In Computer Systems and Applications, Proceedings of the 5th IEEE/ACS International Conference. Amman, Jordan, pp. 187-194.
8. Holland JH (1975). Adaptation in natural and artificial system. Ann Arbor, The University of Michigan Press.
9. Inagaki J, Haseyama M, Kitajima H (1999). A genetic algorithm for determining multiple routes and its applications. In Circuits and Systems, Proceedings of the 1999 IEEE International Symposium. Orlando, FL, USA, pp. 137-140.
10. Lin CH, Yu JL, Liu JC, Lai WS, Ho CH (2009). Genetic Algorithm for Shortest Driving Time in Intelligent Transportation Systems. Int. J. Hybrid Inf. Tech., 2 (1): 21-30.
11. Munemoto M, Takai Y, Sato YA (1998). A migration scheme for the genetic adaptive routing algorithm. In Proceedings of the Systems, Man, and Cybernetics 1998 IEEE International Conference. San Diego, CA, USA, pp. 2774-2779.
12. Pallottino S, Grazia M (1996). Shortest path algorithms in transportation models: Classical and innovative aspects. In Proceedings of the 25th Anniversary Meeting of the Centre for Research on Transportation on Equilibrium and Advanced Transportation Modeling. Montreal, Canada, pp. 245-281.
13. Whitley D (1994). A genetic algorithm tutorial. Statist. and Comput., 4: 65-85.
14. Xu MH, Liu YQ, Huang QL, Zhang YX, Luan GF (2007). An improved Dijkstra's shortest path algorithm for sparse network. Appl. Math. Comput., 185: 247-254.