An efficient hybrid genetic algorithm for the quadratic traveling salesman problem

• المؤلفون الرئيسيون: PHAM, Quang Anh, LAU, Hoong Chuin, HA, Minh Hoang, VU, Lam
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 2023
• الموضوعات: Benchmarking; Combinatorial optimization; Genetic algorithms; Local search (optimization); Robot programming; Artificial Intelligence and Robotics; Databases and Information Systems
• الوصول للمادة أونلاين: https://ink.library.smu.edu.sg/sis_research/8253; https://ink.library.smu.edu.sg/context/sis_research/article/9256/viewcontent/27212_Article_Text_31281_1_2_20230701.pdf
• المؤسسة: Singapore Management University

The traveling salesman problem (TSP) is the most well-known problem in combinatorial optimization which hasbeen studied for many decades. This paper focuses on dealing with one of the most difficult TSP variants named thequadratic traveling salesman problem (QTSP) that has numerous planning applicat...