Elias Rotondo
ABSTRACT
The whale optimization algorithm is a metaheuristic inspired by the hunting strategy of humpback whales. This paper proposes a new discrete spiral whale optimization algorithm (DSWOA) to solve the traveling salesperson problem (TSP). Our approach uses sequential consecutive crossover and spiral 3-opt search, a modified version of the popular 3-opt local search. Spiral 3-opt search works like the original 3-opt heuristic but only uses part of the tour to generate 3-opt moves. We show that spiral 3-opt achieves results similar to the original 3-opt technique and significantly reduces runtime. We evaluate DSWOA's performance on 19 TSP instances against six benchmark algorithms. Our results suggest that DSWOA produces TSP solutions that are as good or better than our competitors. For five of the six benchmark algorithms, we demonstrated statistically significant improvements.
- Mohamed Abd El Aziz, Ahmed A Ewees, and Aboul Ella Hassanien. 2017. Whale optimization algorithm and moth-flame optimization for multilevel thresholding image segmentation. Expert Systems with Applications 83 (2017), 242–256.Google Scholar
Digital Library
- Niels Agatz, Paul Bouman, and Marie Schmidt. 2018. Optimization approaches for the traveling salesman problem with drone. Transportation Science 52, 4 (2018), 965–981.Google ScholarDigital Library
- Omar Mohammed Ahmed Ahmed and Humar Kahramanli. 2018. Meta-Heuristic Solution Approaches for Traveling Salesperson Problem. International Journal of Applied Mathematics Electronics and Computers 6, 3 (2018), 21–26.Google Scholar
- Zakir H Ahmed. 2010. Genetic algorithm for the traveling salesman problem using sequential constructive crossover operator. International Journal of Biometrics & Bioinformatics (IJBB) 3, 6 (2010), 96.Google Scholar
- Kenneth ALAN de JONG. 1975. Analysis of the behavior of a class of genetic adaptive systems. Technical Report No. 185, Department of Computer and Communication Sciences, University of Michigan (1975).Google Scholar
- Enrique Alba, José M Troya, 1999. A survey of parallel distributed genetic algorithms. Complexity 4, 4 (1999), 31–52.Google ScholarDigital Library
- Ibrahim Aljarah, Hossam Faris, and Seyedali Mirjalili. 2018. Optimizing connection weights in neural networks using the whale optimization algorithm. Soft Computing 22, 1 (2018), 1–15.Google ScholarDigital Library
- Mehmet Fatih Demiral. 2021. Analysis of a Hybrid Whale Optimization Algorithm for Traveling Salesman Problem. Mehmet Akif Ersoy Üniversitesi Fen Bilimleri Enstitüsü Dergisi 12, Ek (Suppl.) 1 (2021), 469–476.Google Scholar
- Joaquín Derrac, Salvador García, Daniel Molina, and Francisco Herrera. 2011. A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm and Evolutionary Computation 1, 1 (2011), 3–18.Google ScholarCross Ref
- David E Goldberg and John Henry Holland. 1988. Genetic algorithms and machine learning.(1988). Machine Learning, Springer (1988).Google Scholar
- Rishab Gupta, Nilay Shrivastava, Mohit Jain, Vijander Singh, and Asha Rani. 2018. Greedy WOA for travelling salesman problem. In International Conference on Advances in Computing and Data Sciences. Springer, 321–330.Google ScholarCross Ref
- Eugene L Lawler. 1985. The traveling salesman problem: a guided tour of combinatorial optimization. Wiley-Interscience Series in Discrete Mathematics (1985).Google Scholar
- Mingfu Li, Jianhua Ma, Yuyan Zhang, Houming Zhou, and Jingang Liu. 2015. Firefly algorithm solving multiple traveling salesman problem. Journal of Computational and Theoretical Nanoscience 12, 7 (2015), 1277–1281.Google ScholarCross Ref
- Ya Li, Yichao He, Xuejing Liu, Xiaohu Guo, and Zewen Li. 2020. A novel discrete whale optimization algorithm for solving knapsack problems. Applied Intelligence 50 (2020), 3350–3366.Google ScholarDigital Library
- Shen Lin. 1965. Computer solutions of the traveling salesman problem. Bell System Technical Journal 44, 10 (1965), 2245–2269.Google ScholarCross Ref
- Shen Lin and Brian W Kernighan. 1973. An effective heuristic algorithm for the traveling-salesman problem. Operations research 21, 2 (1973), 498–516.Google Scholar
- Majdi M Mafarja and Seyedali Mirjalili. 2017. Hybrid whale optimization algorithm with simulated annealing for feature selection. Neurocomputing 260 (2017), 302–312.Google ScholarDigital Library
- Seyedali Mirjalili and Andrew Lewis. 2016. The whale optimization algorithm. Advances in engineering software 95 (2016), 51–67.Google ScholarDigital Library
- IM Oliver, DJ Smith, and John RC Holland. 1987. Study of permutation crossover operators on the traveling salesman problem. In Genetic algorithms and their applications: proceedings of the second International Conference on Genetic Algorithms: July 28-31, 1987 at the Massachusetts Institute of Technology, Cambridge, MA. Hillsdale, NJ: L. Erlhaum Associates, 1987.Google Scholar
- Eneko Osaba, Xin-She Yang, Fernando Diaz, Pedro Lopez-Garcia, and Roberto Carballedo. 2016. An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems. Engineering Applications of Artificial Intelligence 48 (2016), 59–71.Google ScholarDigital Library
- D B Prakash and C Lakshminarayana. 2017. Optimal siting of capacitors in radial distribution network using whale optimization algorithm. Alexandria Engineering Journal 56, 4 (2017), 499–509.Google ScholarCross Ref
- Gerhard Reinelt. 1991. TSPLIB—A traveling salesman problem library. ORSA journal on computing 3, 4 (1991), 376–384.Google Scholar
- Paolo Toth and Daniele Vigo. 2002. The vehicle routing problem. SIAM.Google Scholar
- Percy PC Yip and Yoh-Han Pao. 1995. Combinatorial optimization with use of guided evolutionary simulated annealing. IEEE Transactions on neural networks 6, 2 (1995), 290–295.Google ScholarDigital Library
- Majid Yousefikhoshbakht and Mohammad Sedighpour. 2013. New imperialist competitive algorithm to solve the travelling salesman problem. International Journal of Computer Mathematics 90, 7 (2013), 1495–1505.Google ScholarDigital Library
- Jin Zhang, Li Hong, and Qing Liu. 2021. An improved whale optimization algorithm for the traveling salesman problem. Symmetry 13, 1 (2021), 48.Google ScholarCross Ref
Index Terms
- A New Discrete Whale Optimization Algorithm with a Spiral 3-opt Local Search for Solving the Traveling Salesperson Problem
Recommendations
A discrete gravitational search algorithm for solving combinatorial optimization problems
Metaheuristics are general search strategies that, at the exploitation stage, intensively exploit areas of the solution space with high quality solutions and, at the exploration stage, move to unexplored areas of the solution space when necessary. The ...
Discrete symbiotic organisms search algorithm for travelling salesman problem
The objective is to evaluate the efficiency of DSOS algorithm to solve TSP.To verify the performance of the DSOS, using several benchmark instances from the TSPLIB.Experimental results show that DSOS competes favourably with other existing techniques. A ...
Solving 0/1 Knapsack Problem using Opposition-based Whale Optimization Algorithm (OWOA)
ICSCA '19: Proceedings of the 2019 8th International Conference on Software and Computer ApplicationsThe 0/1 Knapsack problem is one of the most popular real-world optimization problems that arise in searching space and finding the most optimum solution. Theoretically, the optimum solution problem of the 0/1 Knapsack requires suitable technique to ...
Comments