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 …
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 …
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-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 …
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 …
A novel hybrid simulated annealing algorithm for colored bottleneck traveling salesman problem
X Dong, Q Lin, F Shen, Q Guo, Q Li - Swarm and Evolutionary Computation, 2023 - Elsevier
In the fields, such as intelligent transport and multiple tasks cooperation, many real-world
problems can be modeled by colored bottleneck traveling salesman problem (CBTSP) …
problems can be modeled by colored bottleneck traveling salesman problem (CBTSP) …
Cumulative capacitated colored traveling salesman problem
X Xu, J Cao, X Shi, S Gorbachev - IEEE Transactions on …, 2023 - ieeexplore.ieee.org
A colored traveling salesman problem (CTSP) is a generalization of the well-known multiple
traveling salesman problem, which introduces colors to distinguish the accessibility of its …
traveling salesman problem, which introduces colors to distinguish the accessibility of its …
A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods
Z Yang, MQ Xiao, YW Ge, DL Feng, L Zhang… - European Journal of …, 2018 - Elsevier
This paper addresses the traveling salesman problem with arbitrary neighbourhoods, which
is an NP-hard problem in combinatorial optimization and is important in operations research …
is an NP-hard problem in combinatorial optimization and is important in operations research …
Iterated two-phase local search for the colored traveling salesmen problem
The colored traveling salesmen problem (CTSP) is a generalization of the popular traveling
salesman problem with multiple salesmen. In CTSP, the cities are divided into m exclusive …
salesman problem with multiple salesmen. In CTSP, the cities are divided into m exclusive …