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.
ZhangX.WangQ.WanD. J.Research on algorithm of optimum route based on digital map. J. Chin. Inertial Technol., 2001, 9(1), 44–49.
8.
ChienS. J. Y.KuchipudiC.Dynamic travel prediction with real-time and historic data. J. Transpn Engng, 2000, 129(6), 608–616.
9.
ZhangB.YeJ. W.HuY. C.Application of optimizing the route by simulated annealing. China J. Highway Transport, 2004, 17(1), 79–81.
10.
CherkasskyB. V.GoldberyA. V.Shortest route algorithms: theory and experimental evaluation, Report, Computer Science Department, Stanford University, Stanford, California, USA, 1993.
11.
OsmanI. H.ChristofidesN.Capacitated clustering problem by hybrid simulated annealing and tabu search. Int. Trans. Opl Res., 1994, 1(3), 317–336.
12.
HoS. C.HauglandD.A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Computers Ops Res., 2004, 31, 1947–1964.
13.
PavildesC.WinsonJ.Reactivation of hippocampal ensemble memories during sleep. Science, 1994, 265, 676–679.
14.
BiY.CangW.JunS.GA's design of multi-resources equilibrium optimization in highway engineering. China J. Highway Transport, 2004, 17(1), 86–89.
