Abstract
Recently, the nature has become a source of inspiration for the creation of many algorithms. A great research effort has been devoted to the development of new metaheuristics, especially nature-inspired one to solve numerous difficult combinatorial problems appearing in various industrial, economic, and scientific domains. The nature-inspired algorithms offer additional advantages over classical algorithms; they seek to find acceptable results within a reasonable time, rather than an ability to guarantee the optimal or sub-optimal solution. The travelling salesman problem (TSP) is an important issue in the class of combinatorial optimization problem and also classified as NP-hard problem and no polynomial time algorithm is known to solve it. Based on three nature-inspired algorithms, this paper proposes a comparative study to solve TSP. The proposed algorithms are evaluated on a set of symmetric benchmark instances from the TSPLIB library.
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
Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM (JACM) 45, 753–782 (1998)
Palit, S., Sinha, S.N., Molla, M.A., Khanra, A., Kule, M.: A cryptanalytic attack on the knapsack cryptosystem using binary Firefly algorithm. In: 2nd International Conference on Computer and Communication Technology (ICCCT), IEEE, pp. 428–432 (2011)
Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6, 154–160 (1994)
Wang, K.-P., Huang, L., Zhou, C.-G., Pang, W.: Particle swarm optimization for traveling salesman problem. In: International Conference on Machine Learning and Cybernetics, IEEE, pp. 1583–1585 (2003)
Kennedy, J.: Particle swarm optimization. Encyclopedia of machine learning, pp. 760–766. Springer, Berlin (2010)
Li, X., Tian, P., Hua, J., Zhong, N.: A hybrid discrete particle swarm optimization for the traveling salesman problem. Simulated evolution and learning, pp. 181–188. Springer, Berlin (2006)
Yang, X.-S., Deb, S.: Cuckoo search via Lévy flights. In: World Congress on Nature & Biologically Inspired Computing, NaBIC 2009, pp. 210–214. IEEE (2009)
Ouaarab, A., Ahiod, B., Yang, X.-S.: Random-key cuckoo search for the travelling salesman problem. Soft Comput., 1–8 (2014)
Yang, X.-S.: A new metaheuristic bat-inspired algorithm. Nature inspired cooperative strategies for optimization (NICSO 2010), pp. 65–74. Springer, Berlin (2010)
Nakamura, R.Y., Pereira, L.A., Costa, K., Rodrigues, D., Papa, J.P., Yang, X.-S.: BBA: A binary bat algorithm for feature selection. In: 25th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI), pp. 291–297. IEEE (2012)
Saji, Y., Riffi, M.: A novel discrete bat algorithm for solving the travelling salesman problem. Neural Comput. Appl., 1–14 (2015)
Reinelt, G.: TSPLIB—A traveling salesman problem library. ORSA J Comput. 3, 376–384 (1991)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Saji, Y., Riffi, M.E. (2016). A Comparative Study of Three Nature-Inspired Algorithms Using the Euclidean Travelling Salesman Problem. In: El Oualkadi, A., Choubani, F., El Moussati, A. (eds) Proceedings of the Mediterranean Conference on Information & Communication Technologies 2015. Lecture Notes in Electrical Engineering, vol 380. Springer, Cham. https://doi.org/10.1007/978-3-319-30301-7_34
Download citation
DOI: https://doi.org/10.1007/978-3-319-30301-7_34
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-30299-7
Online ISBN: 978-3-319-30301-7
eBook Packages: EngineeringEngineering (R0)