Abstract
The traveling Salesman Problem is NP-hard and a well-known problem in combinatorial research. In order to find the right solution, the best-known methods are to make a list of all possible solutions, but the disadvantage of this method is that the resolution time becomes excessively long. To deal with these obstacles, researchers are working on a new methods class named meta-heuristic, to try solving a wider range of these unresolved problems. A recent one called Sailfish optimizer algorithm (SFO), which is inspired by nature, in particular based on the behavior of sailfish hunting. In this work, we present a first adaption of this algorithm for discrete case and especially to resolve travelling salesman problem, the obtained results show the efficiency of the proposed adaptation to solve some instances of this problem and the results was compared with other metaheuristics methods.
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
Similar content being viewed by others
References
Lawler, E.L.: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley-Interscience Series in Discrete Mathematics, New York (1985)
Liu, Y., Xiong, S., Liu, H.: Hybrid simulated annealing algorithm based on adaptive cooling schedule for TSP. In: Proceedings of the First ACMISIGEVO Summit on Genetic and Evolutionary Computation, pp. 895–898. ACM (2009)
Saji, Y., Riffi, M.E., Ahiod, B.: Discrete bat-inspired algorithm for travelling salesman problem. In: IEEE Second World Conference on Complex Systems (WCCS). Agadir-Morrocco (2014)
Shi, X.H., Liang, Y.C., Lee, H.P., Lu, C., Wang, Q.X.: Particle swarm optimization-based algorithms for TSP and generalized TSP. Inform. Process. Lett. 103(15), 169–176 (2007)
Zachariasen, M., Dam, M.: Tabu Search on the Geometric Traveling Salesman Problem, pp. 571–587. Springer, Boston (1996). https://doi.org/10.1007/978-1-4613-1361-8_34
Das, S., Abraham, A., Konar, A.: Swann intelligence algorithms in bioinformatics. Comput. Intell. Bioinform. 94, 113–147 (2008)
Chen, S.-M., Chien, C.-Y.: Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques. Expert Syst. Appl. 38(112), 14439–14450 (2011)
Shadravan, S., Naji, H.R., Bardsiri, V.K.: The sailfish optimizer: a novel nature-inspired metaheuristic algorithm for solving constrained engineering optimization problems. Eng. Appl. Artif. Intell. 80, 20–34 (2019)
Menger, K.: Das boten problem. In: Ergebnisse Eines Mathematischen Kolloquiums, pp. 11–12 (1932)
Abdelhamid, B., Riffi, M.E.: Discrete cat swarm optimization algorithm applied to combinatorial optimization problems. In: Cryptography and Communication Systems (WCCCS). IEEE (2014)
Clerc, M.: Discrete particle swarm optimization, illustrated by the traveling salesman problem. In: New Optimization Techniques in Engineering, pp. 219–239. Springer, Berlin (2004). https://doi.org/10.1007/978-3-642-23857-4_40
Reinelt, G.: A traveling salesman problem library. ORSA J. Comput. 3(14), 376–384 (1991)
Akhand, M.A.H., Ayon, S.I., Shahriyar, S.A.: Discrete spider monkey optimization for travelling salesman problem. Appl. Soft Comput. 86(1), 105887 (2020)
Ezugwu, A.El.-S., Adewumi, A.O.: Discrete symbiotic organisms search algorithm for travelling salesman problem. Expert Syst. Appl. 87, 70–78 (2017)
Hatamlou, A.: Solving travelling salesman problem using black hole algorithm. Soft. Comput. 22(24), 8167–8175 (2017). https://doi.org/10.1007/s00500-017-2760-y
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Khaoula, C., Morad, B., Essaid, R.M. (2022). SailFish Optimizer Algorithm to Solve the Traveling Salesman Problem. In: Abraham, A., et al. Hybrid Intelligent Systems. HIS 2021. Lecture Notes in Networks and Systems, vol 420. Springer, Cham. https://doi.org/10.1007/978-3-030-96305-7_21
Download citation
DOI: https://doi.org/10.1007/978-3-030-96305-7_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-96304-0
Online ISBN: 978-3-030-96305-7
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)