An efficient hybrid genetic algorithm for the quadratic traveling salesman problem

An efficient hybrid genetic algorithm for the quadratic traveling salesman problem

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...

Full description

Saved in:
Bibliographic Details
Main Authors: PHAM, Quang Anh, LAU, Hoong Chuin, HA, Minh Hoang, VU, Lam
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2023
Subjects:
Benchmarking
Combinatorial optimization
Genetic algorithms
Local search (optimization)
Robot programming
Artificial Intelligence and Robotics
Databases and Information Systems
Online Access: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
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English

Internet

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

Similar Items