A hybrid genetic algorithm with cycle reassembly for solving colored traveling salesman problems

Abstract As a generalization of the well-known multiple traveling salesman problem, the Colored Traveling Salesman Problem (CTSP) can completely delineate individual salesmen’s "spheres of influence" of city visits using colors. CTSP has numerous real-world applications but remains computa...

Full description

Bibliographic Details
Published in:Journal of King Saud University: Computer and Information Sciences
Main Authors: Zhicheng Lin, Jun Li
Format: Article
Language:English
Published: Springer 2025-08-01
Subjects:
Colored traveling salesman problem
Task scheduling
Heuristics
Genetic algorithm
Neighborhood search
Online Access:https://doi.org/10.1007/s44443-025-00127-x

Internet

https://doi.org/10.1007/s44443-025-00127-x

Similar Items