… color for a salesman to visit and a group of shared cities of multiple colors allowing all salesmen
… multidepot MTSP and multiple single traveling salesman problems are its special cases. …

… traveling salesman problem. In our prior CTSP, each salesman is allocated a particular
color and each city, carrying 1, 2, or all salesmen’s colors depending on the problem types, …

… a new multiple traveling salesman problem by coloring the cities, called Colored TSP (CTSP). …
salesmen and the cities must be obeyed when one determines a solution. It is a significant …

… eling salesman problem, a colored traveling salesman problem (CTSP) utilizes colors to
describe the accessibility of individual cities to salesmen. To expand its application scope, this …

… colored traveling salesman problem (CTSP), which is a variant of the multiple traveling
salesman problem (… In the MTSP, given a set of cities, there are multiple salesman to visit these …

… [6] proposed a population-based incremental learning (PBIL) algorithm for a serial
colored traveling salesman problem (S-CTSP). To enhance its search ability, a 2-opt was …

… city-color matrix. This work redefines a general colored traveling salesman problem (GCTSP) …
In GCTSP, the setting of city colors is richer than that in CTSPs. As results, it can be used to …

… This paper examines a new colored travelling salesman problem, S-CTSP. Its solution space
is firstly analyzed. Since it is NP-hard, we present an intelligent optimization method called …

… Abstract—A colored traveling salesman problem (CTSP) is … -known multiple traveling
salesman problem, which introduces colors to distinguish the accessibility of its cities to salesmen. …

… Abstract—A colored traveling salesman problem (CTSP) is … multiple traveling salesman
problem. In it, each city has one to multiple colors and allows a salesman in the same color to …