@inproceedings{a0233ca5a88244ff8732baf315397329,
title = "Colored traveling salesman problem and solution",
abstract = "Multiple Traveling Salesman Problem (MTSP) is an important combinatorial optimization problem. However, it is applicable to only the cases in which multiple executing individuals (traveling salesman) share the common workspace (city set). It cannot be used to handle many multi-machine engineering systems where multiple machines' workspaces are not the same and partially overlap with each other This paper proposes and formulates a new MTSP called colored traveling salesman problem (CTSP). Each of its salesmen is assigned a private city set and all salesmen share a public city set. Every set of cities is colored differently. To solve CTSP, we present two improved genetic algorithms (GA) by combining the classic one with a greedy algorithm and hill-climbing one to achieve better performance Finally, the algorithms are applied and compared through a case study. The result shows that the hill-climbing GA enjoys the best performance among the investigated ones.",
keywords = "Genetic algorithm, Greedy algorithm, Hill-climbing algorithm, MTSP, Modelling, TSP",
author = "Jun Li and Qirui Sun and Zhou, {Meng Chu} and Xiaolong Yu and Xianzhong Dai",
note = "Publisher Copyright: {\textcopyright} IFAC.; 19th IFAC World Congress on International Federation of Automatic Control, IFAC 2014 ; Conference date: 24-08-2014 Through 29-08-2014",
year = "2014",
doi = "10.3182/20140824-6-za-1003.01403",
language = "English (US)",
series = "IFAC Proceedings Volumes (IFAC-PapersOnline)",
publisher = "IFAC Secretariat",
pages = "9575--9580",
editor = "Edward Boje and Xiaohua Xia",
booktitle = "19th IFAC World Congress IFAC 2014, Proceedings",
address = "Austria",
}