Abstract
Self-adaptive systems are applied in a variety of ways, including transportation, telecommunications, etc. The main challenge in route guidance system is to direct vehicles to their destination in a dynamic traffic situation, with the aim of reducing the motoring time and to ensure an efficient use of available road resources. In this paper, we propose a self-adaptive algorithm for managing the shortest paths in route guidance system. This is poised to minimize costs between the origin and destination nodes. The proposed algorithm was compared with the Dijkstra algorithm in order to find the best and shortest paths using a sample simplified real sample of Kuala-Lumpur (KL) road network map. Four cases were tested to verify the efficiency of our approach through simulation using the proposed algorithm. The results show that the proposed algorithm could reduce the cost of vehicle routing and associated problems.
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.
Similar content being viewed by others
References
Sloman, M., Lupu, E.: Engineering policy-based ubiquitous systems. The Computer Journal, 1113–1127 (2010)
Che, K., Li, L.-L., Niu, X.-T., Xing, S.-T.: Research of software development method- ology based on self-adaptive multi-agent systems. In: 2009 IEEE International Symposium on IT in Medicine & Education (ITME 2009), vol. 1, pp. 235–240 (2009)
Nagib, G., Ali, W.G.: Network routing protocol using Genetic Algorithms. International Journal of Electrical & Computer Sciences 10, 40–44 (2010)
Dijkstra, E.W.: A Note on Two Problems in Connection with Graphs. Journal of Numerical Mathematics 1, 269–271 (1959)
Arokhlo, M.Z., Selamat, A., Hashim, S.Z.M., Selamat, M.H.: Multi-agent Reinforcement Learning for Route Guidance System. IJACT: InternationalJournal of Advancements in Computing Technology 3(6), 224–232 (2011)
Vasirani, M., Ossowski, S.: A market-inspired approach to reservation-based ur- ban road traffic management. In: AAMAS 2009: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems, Budapest, Hungary, pp. 617–624 (2009)
Schulz, F., Wagner, D., Weihe, K.: Dijkstra’s algorithm on-line: an empirical case study from public railroad transport. J. Exp. Algorithmics 5, 12 (2000)
Andersson, J., de Lemos, R., Malek, S., Weyns, D.: Reflecting on self-adaptive software systems. In: ICSE Workshop on Software Engineering for Adaptive and Self-Managing Systems, Vancouver, Canada, pp. 38–47 (2009)
Zhang, J., Goldsby, H.J., Cheng, B.H.: Modular verification of dynamically adaptive systems. In: Proceedings of the 8th ACM International Conference on Aspect-oriented Software Development, AOSD 2009, pp. 161–172. ACM, New York (2009)
Herrmann, K., Gero, M., Geihs, K.: Self-management: The solution to complexity or just an- other problem. IEEE Distributed Systems Online 6 (2005)
Chen, B., Cheng, H.H., Palen, J.: Integrating mobile agent technology with multi-agent systems for distributed traffic detection and management systems (2009)
Zhang, Z., Xu, J.-M.: A dynamic route guidance arithmetic based on reinforcement learning. In: Proceedings of 2005 International Conference on Machine Learning and Cybernetics, China, vol. 6, pp. 3607–3611 (2005)
Zou, L., Xu, J.-M., Zhu, L.: Application of genetic algorithm in dynamic route guidance system. Journal of Transportation Systems Engineering and Information Technology 7, 45–48 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zolfpour-Arokhlo, M., Selamat, A., Mohd Hashim, S.Z., Selamat, M.H. (2012). Route Guidance System Based on Self-Adaptive Algorithm. In: Lukose, D., Ahmad, A.R., Suliman, A. (eds) Knowledge Technology. KTW 2011. Communications in Computer and Information Science, vol 295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32826-8_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-32826-8_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32825-1
Online ISBN: 978-3-642-32826-8
eBook Packages: Computer ScienceComputer Science (R0)