Research and realization of optimum route planning in vehicle navigation systems based on a hybrid genetic algorithm
Authors:
- 1 May 2008
- journal article
- research article
- Published by SAGE Publications in Proceedings of the Institution of Mechanical Engineers, Part D: Journal of Automobile Engineering
- Vol. 222 (5) , 757-763
Abstract
An improved algorithm to solve the problem of optimum route planning in vehicle navigation systems is proposed in this paper. This algorithm is based on the standard genetic algorithm and the λ-interchange local search method and has evolved from the improved A shortest-path algorithm. This algorithm can find the optimum route more efficiently and quickly without any network constraint condition and can work well either in continuous or in discrete networks. Finally the experimental simulation results which verify the feasibility and validity of this algorithm are shown.Keywords
This publication has 6 references indexed in Scilit:
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveriesComputers & Operations Research, 2004
- Dynamic Travel Time Prediction with Real-Time and Historic DataJournal of Transportation Engineering, 2003
- Shortest paths algorithms: Theory and experimental evaluationMathematical Programming, 1996
- Reactivation of Hippocampal Ensemble Memories During SleepScience, 1994
- Capacitated clustering problems by hybrid simulated annealing and tabu searchInternational Transactions in Operational Research, 1994
- Studies in Semi-Admissible HeuristicsIEEE Transactions on Pattern Analysis and Machine Intelligence, 1982