Abstract
There are several search algorithms for the shortest path problem: the Dijkstra algorithm and Bellman-Ford algorithm, to name a few. These algorithms are not effective for dynamic traffic network involving rapidly changing travel time. The evolution program is useful for practical purposes to obtain approximate solutions for dynamic route guidance systems (DRGS). The objective of this paper is to propose an adaptive routing algorithm using evolution program (ARAEP) that is to find the multiple shortest paths within limited time when the complexity of traffic network including turn-restrictions, U-turns, and P-turns exceeds a predefined threshold.
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
Ben-Akiva, M., Koutsopoulos, H.N., Mukandan, A.: A dynamic traffic model system for ATMS/ATIS operations. IVHS Journal 1(4), 1–19 (1994)
Shinsaku, Y.: The strategy and deployment plan for VICS. IEEE Communications Magazine, 94–97 (1996)
Ahuja, R.K, Magnamti, T.L., Orlin, J.B.: Network Flows. Prentice-Hal, Englewood Cliffs (1993)
Neapolitan, R., Namipour, K.: Foundations of Algorithms using C++ Pseudo Code, 2nd, Jones and Bartlett (1998)
Namkoong, S., et al.: Development of the tree-based link labeling algorithm for optimal path-finding in urban transportation networks. Math. Compute. Modeling 27(9-11), 51–65 (1999)
Kim, S., Lee, J.: Modified Dijkstra and Floyd-Warshall Algorithms for Turn-restriction, U-turn, and P-turn in Traffic Network. In: Proceeding, INFORMS Seoul 2000 Conference (2000)
Inagaki, J., Haseyama, M., Kitajima, H.: A Genetic Algorithm for Determining Multiple Routes and Its Applications. In: Proc. of the 1999 IEEE Int.l Symposium on Circuits and Systems (1999)
Yang, B., Miller-Hooks, E.: Adaptive routing considering delays to signal operations. Transportation Research Part B 38, 385–413 (2004)
Fu, L.: An adaptive routing algorithm for in-vehicle route guidance systems with real-time information. Transportation Research Part B 35, 749–765 (2001)
Sannomiya, N., Tatemura, K.: Application of genetic algorithm to a parallel path selection problem. Int. Journal of Systems Science 27(2), 269–274 (1996)
Gen, M., Cheng, R., Wang, D.: Genetic Algorithms for Solving Shortest Path Problems. In: Proceedings of the 1997 IEEE International Magnetics Conferences (1997)
Seo, K., Choi, G.: The Genetic Algorithm Based Route Finding Method for Alternative Paths. In: Proc. of the 1998 IEEE Int. Conference on Systems, Man, and Cybernetics (1998)
Voicu, L., Myler, H.: Cloning operator and its applications. In: Proceedings of the Applications and Science of Computational Intelligence (1998)
Uchimura, K., Takahashi, H., Saitoh, T.: Demand responsive services in hierarchical public transportation system. IEEE Trans. on Veh. Techn. 51(4), 760–766 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, SS., Ahn, S.B. (2007). Adaptive Routing Algorithm Using Evolution Program for Multiple Shortest Paths in DRGS. In: Szczuka, M.S., et al. Advances in Hybrid Information Technology. ICHIT 2006. Lecture Notes in Computer Science(), vol 4413. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77368-9_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-77368-9_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77367-2
Online ISBN: 978-3-540-77368-9
eBook Packages: Computer ScienceComputer Science (R0)