Multi-neighborhood simulated annealing-based iterated local search for colored traveling salesman problems
A coloring traveling salesman problem (CTSP) generalizes the well-known multiple traveling
salesman problem, where colors are used to differentiate salesmen's the accessibility to …
salesman problem, where colors are used to differentiate salesmen's the accessibility to …
Delaunay-triangulation-based variable neighborhood search to solve large-scale general colored traveling salesman problems
X Xu, J Li, MC Zhou - IEEE Transactions on Intelligent …, 2020 - ieeexplore.ieee.org
A colored traveling salesman problem (CTSP) is a generalization of the well-known multiple
traveling salesman problem. It utilizes colors to differentiate the accessibility of its cities to its …
traveling salesman problem. It utilizes colors to differentiate the accessibility of its cities to its …
Variable neighborhood search for a colored traveling salesman problem
A colored traveling salesman problem (CTSP) is a generalization of the well-known multiple
traveling salesman problem. In our prior CTSP, each salesman is allocated a particular color …
traveling salesman problem. In our prior CTSP, each salesman is allocated a particular color …
Precedence-constrained colored traveling salesman problem: An augmented variable neighborhood search approach
A colored traveling salesman problem (CTSP) as a generalization of the well-known multiple
traveling salesman problem utilizes colors to distinguish the accessibility of individual cities …
traveling salesman problem utilizes colors to distinguish the accessibility of individual cities …
Bi-trajectory hybrid search to solve bottleneck-minimized colored traveling salesman problems
A bottleneck-minimized colored traveling salesman problem is an important variant of
colored traveling salesman problems. It is useful in handling the planning problems with …
colored traveling salesman problems. It is useful in handling the planning problems with …
Colored traveling salesman problem
J Li, MC Zhou, Q Sun, X Dai… - IEEE transactions on …, 2014 - ieeexplore.ieee.org
The multiple traveling salesman problem (MTSP) is an important combinatorial optimization
problem. It has been widely and successfully applied to the practical cases in which multiple …
problem. It has been widely and successfully applied to the practical cases in which multiple …
Bi-objective colored traveling salesman problems
X Xu, J Li, MC Zhou - IEEE Transactions on Intelligent …, 2021 - ieeexplore.ieee.org
As a generalization of the well-known multiple traveling salesman problem, a colored
traveling salesman problem (CTSP) utilizes colors to describe the accessibility of individual …
traveling salesman problem (CTSP) utilizes colors to describe the accessibility of individual …
A powerful genetic algorithm using edge assembly crossover for the traveling salesman problem
Y Nagata, S Kobayashi - INFORMS Journal on Computing, 2013 - pubsonline.informs.org
This paper presents a genetic algorithm (GA) for solving the traveling salesman problem
(TSP). To construct a powerful GA, we use edge assembly crossover (EAX) and make …
(TSP). To construct a powerful GA, we use edge assembly crossover (EAX) and make …
A swarm intelligence approach for the colored traveling salesman problem
This paper addresses the recently introduced colored traveling salesman problem (CTSP),
which is a variant of the multiple traveling salesman problem (MTSP). In the MTSP, given a …
which is a variant of the multiple traveling salesman problem (MTSP). In the MTSP, given a …
Enhanced list-based simulated annealing algorithm for large-scale traveling salesman problem
L Wang, R Cai, M Lin, Y Zhong - IEEE Access, 2019 - ieeexplore.ieee.org
List-based simulated annealing (LBSA) algorithm is a novel simulated annealing algorithm
where list-based cooling scheme is used to control the change of parameter temperature …
where list-based cooling scheme is used to control the change of parameter temperature …