Abstract
Nature-inspired algorithms are among the most powerful algorithms to solve optimization problems. This paper intends to provide a detailed description of a new iterative method to solve the shortest path problem for given directed graph(dgraph) G = (V, E) from source node s to target node t. Each edge\( \left( {i, j} \right) \in E \) has an associated weight \( w_{ij} \). This problem is known as NP-hard problems, so an efficient solution is not likely to exist. Weights are assigned by the network operator. A path cost is the sum of the weights of the edges in the path. The efficiency of this approach is shown with some numerical simulations. For large data network, this method reaches to shortest path from s to t in polynomial time.
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
References
Abeysundara, S., Giritharan, B., Kodithuwakku, S: A genetic algorithm approach to solve the shortest paths problem for road maps. In: Proceedings of the International Conference on Information and Automation, Colombo, Sri Lanka, pp. 272–275 (2005)
Ahuja, R.K., Magnanti, T.L., Orlin, J.B: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, New Jersey (1993)
Deb, K: Optimisation for Engineering Design. Prentice-Hall, New Delhi (1995)
Goldberg, D.E.: Genetic Algorithms in Search, Optimisation and Machine Learning. Addison Wesley, Reading (1989)
Karaboga, D: An idea based on honey bee swarm for numerical optimization. Technical Report-TR06, Erciyes University, Engineering Faulty, Computer Engineering Department (2005)
Karaboga, D., Basturk, B.: On the performance of artificial bee colony (ABC) algorithm. Appl. Soft Comput. 8, 687–697 (2008)
Kennedy, J., Eberhart, R.C: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, Piscataway, NJ, pp. 1942–1948 (1995)
Kennedy, J., Eberhart, R., Shi, Y: Swarm Intelligence. Academic Press, San Francisco (2001)
Yang, X.S: Biology-derived algorithms in engineering optimizaton (Chapter 32). In: Olarius, S., Zomaya, A. (eds.) Handbook of Bioinspired Algorithms and Applications. Chapman and Hall/CRC, Boca Raton (2005)
Yang, X.S: Nature-Inspired Metaheuristic Algorithms. Luniver Press, Frome (2008)
Yuster, R.: Approximate shortest in weighted graphs. J. Comput. Syst. Sci. 78, 632–637 (2012)
Zakzouk, A.A.A., Zaher, H.M., El-Deen, R.A.Z: An ant colony optimization approach for solving shortest paths problem with fuzzy constraints. In: Proceedings of the 7th International Conference on Informatics and Systems (INFOS) (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer India
About this paper
Cite this paper
Mansouri, P., Asady, B., Gupta, N. (2014). Solve Shortest Paths Problem by Using Artificial Bee Colony Algorithm. In: Pant, M., Deep, K., Nagar, A., Bansal, J. (eds) Proceedings of the Third International Conference on Soft Computing for Problem Solving. Advances in Intelligent Systems and Computing, vol 258. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1771-8_16
Download citation
DOI: https://doi.org/10.1007/978-81-322-1771-8_16
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-1770-1
Online ISBN: 978-81-322-1771-8
eBook Packages: EngineeringEngineering (R0)