Mohamed Wed Eladham
ABSTRACT
A well-known combinatorial optimization issue called The Traveling Salesman issue (TSP) has applications in many fields, including drone-based delivery and monitoring systems. In this study, we examine the effectiveness of three distinct implementations of the Simulated Annealing (SA), Sparrow Search Algorithm (SSA), and Tabu Search (TS) metaheuristic algorithms to solve the TSP for drone applications. The goal is to evaluate each algorithm's performance and assess whether it is appropriate for use in practical drone deployment scenarios while considering limitations like the maximum drone distance and the number of trips. Our approach focuses on how SA, SSA, and TS are implemented individually and outlines the experimental setup used to compare performance. To guarantee a neutral comparison, the study is carried out in simulation using Python in the same environment for all of the methods. The goal is to reduce the vehicle and drone's combined total distance travelled.
- Mohamed Abdel-Basset, Laila Abdel-Fatah, and Arun Kumar Sangaiah. 2018. Chapter 10 - Metaheuristic Algorithms: A Comprehensive Review. In Computational Intelligence for Multimedia Big Data on the Cloud with Engineering Applications, Arun Kumar Sangaiah, Michael Sheng and Zhiyong Zhang (eds.). Academic Press, 185–231. https://doi.org/10.1016/B978-0-12-813314-9.00010-4Google Scholar
Cross Ref
- Sarab AlMuhaideb, Taghreed Alhussan, Sara Alamri, Yara Altwaijry, Lujain Aljarbou, and Haifa Alrayes. 2021. Optimization of Truck-Drone Parcel Delivery Using Metaheuristics. Applied Sciences 11, 14 (2021). https://doi.org/10.3390/app11146443Google ScholarCross Ref
- Miroslaw Blocho. 2020. Chapter 4 - Heuristics, metaheuristics, and hyperheuristics for rich vehicle routing problems. In Smart Delivery Systems, Jakub Nalepa (ed.). Elsevier, 101–156. https://doi.org/10.1016/B978-0-12-815715-2.00009-9Google ScholarCross Ref
- Michael R Garey and David S Johnson. 1990. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., USA.Google Scholar
- Michel Gendreau and Jean-Yves Potvin. 2005. Metaheuristics in Combinatorial Optimization. Ann Oper Res 140, 1 (2005), 189–213. https://doi.org/10.1007/s10479-005-3971-7Google ScholarCross Ref
- Fred Glover. 1990. Tabu search - Part I. INFORMS J Comput 2, (January 1990), 4–32.Google ScholarCross Ref
- Fred Glover. 1990. Tabu search—part II. ORSA Journal on Computing 2, (February 1990), 4–32. https://doi.org/10.1287/ijoc.2.1.4Google ScholarCross Ref
- Gregory Gutin and Abraham P. Punnen (Eds.). 2007. The Traveling Salesman Problem and Its Variations. Springer US, Boston, MA. https://doi.org/10.1007/b101971Google ScholarCross Ref
- Quang Minh Ha, Yves Deville, Quang Dung Pham, and Minh Hoàng Hà. 2020. A hybrid genetic algorithm for the traveling salesman problem with drone. Journal of Heuristics 26, 2 (2020), 219–247. https://doi.org/10.1007/s10732-019-09431-yGoogle ScholarDigital Library
- David S Johnson and Lyle A McGeoch. 2008. The Traveling Salesman Problem: A Case Study in Local Optimization. 2008. .Google Scholar
- S Kirkpatrick, C D Gelatt, and M P Vecchi. 1983. Optimization by Simulated Annealing. Science (1979) 220, 4598 (May 1983), 671–680. https://doi.org/10.1126/science.220.4598.671Google ScholarCross Ref
- Gilbert Laporte. 1992. The traveling salesman problem: An overview of exact and approximate algorithms. Eur J Oper Res 59, 2 (1992), 231–247. https://doi.org/10.1016/0377-2217(92)90138-YGoogle ScholarCross Ref
- Giusy Macrina, Luigi Di Puglia Pugliese, Francesca Guerriero, and Gilbert Laporte. 2020. Drone-aided routing: A literature review. Transp Res Part C Emerg Technol 120, (2020), 102762. https://doi.org/10.1016/j.trc.2020.102762Google ScholarCross Ref
- Setyo Tri Windras Mara, Ruhul Sarker, Daryl Essam, and Saber Elsayed. 2023. Solving electric vehicle–drone routing problem using memetic algorithm. Swarm Evol Comput 79, (2023), 101295. https://doi.org/10.1016/j.swevo.2023.101295Google ScholarCross Ref
- Chase C Murray and Amanda G Chu. 2015. The flying sidekick traveling salesman problem: Optimization of drone-assisted parcel delivery. Transp Res Part C Emerg Technol 54, (2015), 86–109. https://doi.org/10.1016/j.trc.2015.03.005Google ScholarCross Ref
- James B Orlin. 1997. A polynomial time primal network simplex algorithm for minimum cost flows. Math Program 78, 2 (1997), 109–129. https://doi.org/10.1007/BF02614365Google ScholarDigital Library
- Andrea Ponza. 2016. Optimization of drone-assisted parcel delivery. https://doi.org/10.13140/RG.2.2.24444.56962Google ScholarCross Ref
- Soo-Yong Shin, Byoung-Tak Zhang, and Sung-Soo Jun. 1999. Solving traveling salesman problems using molecular programming. https://doi.org/10.1109/CEC.1999.782531Google ScholarCross Ref
- Jiankai Xue and Bo Shen. 2020. A novel swarm intelligence optimization approach: sparrow search algorithm. Systems Science & Control Engineering 8, 1 (January 2020), 22–34. https://doi.org/10.1080/21642583.2019.1708830Google ScholarCross Ref
Index Terms
- Metaheuristic Approach for Solving the Traveling Salesman Problem with Drone
Recommendations
Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search
The traveling salesman problem (TSP) is a classical problem in discrete or combinatorial optimization and belongs to the NP-complete classes, which means that it may be require an infeasible processing time to be solved by an exhaustive search method, ...
Solving traveling salesman problems via artificial intelligent search techniques
AIKED'12: Proceedings of the 11th WSEAS international conference on Artificial Intelligence, Knowledge Engineering and Data BasesThe traveling salesman problem (TSP) is one of the most intensively studied problems in computational mathematics and combinatorial optimization. It is also considered as the class of the NP-complete combinatorial optimization problems. By literatures, ...
Doubly-rooted stem-and-cycle ejection chain algorithm for the asymmetric traveling salesman problem
Ejection chain methods, which include the classical Lin-Kernighan LK procedure and the Stem-and-Cycle S&C reference structure, have been the source of the currently leading algorithms for large scale symmetric traveling salesman problems STSP. Although ...
Comments