Research and realization of optimum route planning in vehicle navigation systems based on a hybrid genetic algorithm

Proceedings of the Institution of Mechanical Engineers, Part D: Journal of Automobile Engineering

Volumn 222, Issue 5, 2008, Pages 757-763

  Hu, L ^a   Gu, Z Q ^a   Huang, J ^a   Yang, Y ^a   Song, X ^a  

^a HUNAN UNIVERSITY   (China)

Author keywords

Hybrid genetic algorithm; Improved * algorithm; Optimum route; Interchange local search

Indexed keywords

COMPLEX NETWORKS; GENETIC ALGORITHMS; INTERCHANGES; LOCAL SEARCH (OPTIMIZATION); TRAFFIC CONTROL;

EXPERIMENTAL SIMULATIONS; HYBRID GENETIC ALGORITHMS; IN-VEHICLE NAVIGATION SYSTEMS; LOCAL SEARCH; NETWORK CONSTRAINTS; OPTIMUM ROUTE; SHORTEST PATH ALGORITHMS; STANDARD GENETIC ALGORITHM;

NAVIGATION SYSTEMS;

EID: 45949083028     PISSN: 09544070     EISSN: None     Source Type: Journal    
DOI: 10.1243/09544070JAUTO534     Document Type: Article

References (14)

1. Zhao, Y. L. and Tan, G. Z. Vehicle location and navigation systems, 1999 (Publishing House of Electronics Industry, Beijing).
2. Paige, R. C. and Kruskal, C. D. Parallel algorithms for shortest route problems. IEEE Trans. Computers, 1985, 34, 14-20.
3. Cherkassky, B. V., Goldberg, A. V., and Radzik, T. Shortest routes algorithms: theory and experimental evaluation. Math. Programming, 1996, 73(2), 129-174.
4. Zhen, T. G. and Wen, G. Shortest route algorithm in time-dependent networks. China J. Computers, 2002, 25(2), 165-172.
5. Holland, J. H. Adaptation in natural and artificial systems, 1975 (Univesity of Michigan Press, Ann Arbor, Michigan).
6. Pearl, J. and Kin, J. Studies in semi-admissible heuristics. IEEE Trans. Pattern Analysis Mach. Intell., 1982, 4(4), 392-399.
7. Zhang, X., Wang, Q., and Wan, D. J. Research on algorithm of optimum route based on digital map. J. Chin. Inertial Technol., 2001, 9(1), 44-49.
8. Chien, S. J. Y. and Kuchipudi, C. Dynamic travel prediction with real-time and historic data. J. Transpn Engng, 2000, 129(6), 608-616.
9. Zhang, B., Ye, J. W., and Hu, Y. C. Application of optimizing the route by simulated annealing. China J. Highway Transport, 2004, 17(1), 79-81.
10. Cherkassky, B. V. and Goldbery, A. V. Shortest route algorithms: theory and experimental evaluation, Report, Computer Science Department, Stanford University, Stanford, California, USA, 1993.
11. Osman, I. H. and Christofides, N. Capacitated clustering problem by hybrid simulated annealing and tabu search. Int. Trans. Opl Res., 1994, 1(3), 317-336.
12. Ho, S. C. and Haugland, D. A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Computers Ops Res., 2004, 31, 1947-1964.
13. Pavildes, C. and Winson, J. Reactivation of hippocampal ensemble memories during sleep. Science, 1994, 265, 676-679.
14. Bi, Y., Gang, W., and Jun, S. GA's design of multi-resources equilibrium optimization in highway engineering. China J. Highway Transport, 2004, 17(1), 86-89.