Abstract
Search for optimal route from source to destination is a well known optimization problem and lot of good solutions like Dijkstra algorithm, Bellman-Ford algorithm etc. are available with practical applications. But simultaneous search for multiple semioptimal routes are difficult with the above mentioned solutions as they produce the best one at a time. Genetic Algorithm (GA) based solutions are currently available for simultaneous search of multiple routes. But the problem in finding multiple routes is that the selected routes resemble each other,i,e., partly overlap. In this paper a GA based algorithm with a novel fitness function has been proposed for simultaneous search of multiple routes for car navigation system avoiding overlapping. The simulation of the proposed algorithm and other currently available algorithms have been done by using a portion of real road map. The simulation results demonstrate the effectiveness of the proposed algorithm over other algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
Chang, W.A.: A Genetic Algorithm for Shortest Path Routing Problem and the Sizing of Populations. IEEE Trans. on Evolutionary Computations 6(6), 566–579 (2002)
Kanoh, H., Nakamura, T.: Knowledge based Genetic Algorithm for Dynamic Route Selection. In: Proceedings of International Conference on Knowledge based Intelligent engineering Systems and Allied Technologies, pp. 616–619 (2000)
Inagaki, J., et al.: A genetic algorithm for determining multiple routes and its applications. In: Proc. IEEE Int. Symp. Circuits and Systems, pp. 137–140 (1999)
Tanaka, M., et al.: A multi-Route Planning for Aircraft Using Genetic Algorithms. Trans of IEICE J85D-I(8), 767–775 (2002)
Inagaki, J., et al.: A method of Determining Various Solutions for Routing Application with a Genetic Algorithm. Trans of IEICE J82-D-I(8), 1102–1111 (2002)
Inoue, Y.: Exploration Method of Various Routes with Genetic Algorithm, Master’s Thesis, Information System Engineering, Kochi Institute of Technology (2001) (in Japanese)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chakraborty, B. (2004). GA-Based Multiple Route Selection for Car Navigation. In: Manandhar, S., Austin, J., Desai, U., Oyanagi, Y., Talukder, A.K. (eds) Applied Computing. AACC 2004. Lecture Notes in Computer Science, vol 3285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30176-9_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-30176-9_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23659-7
Online ISBN: 978-3-540-30176-9
eBook Packages: Springer Book Archive