Grouping memetic search for the colored traveling salesmen problem
The colored traveling salesmen problem is a node routing problem with multiple salesmen,
where the cities are divided into m exclusive city sets and one shared city set. The objective …
where the cities are divided into m exclusive city sets and one shared city set. The objective …
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 …
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 …
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 …
[PDF][PDF] Memetic algorithms for the traveling salesman problem
P Merz, B Freisleben - complex Systems, 2001 - content.wolfram.com
Memetic algorithms (MAs) have been shown to be very effective in finding near-optimum
solutions to hard combinatorial optimization problems. In this paper, the fitness landscapes …
solutions to hard combinatorial optimization problems. In this paper, the fitness landscapes …
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 …
Comparison of heuristics for the colourful travelling salesman problem
In the colourful travelling salesman problem (CTSP), given a graph G with a (not necessarily
distinct) label (colour) assigned to each edge, a Hamiltonian tour with the minimum number …
distinct) label (colour) assigned to each edge, a Hamiltonian tour with the minimum number …
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 dynamic colored traveling salesman problem with varying edge weights
A colored traveling salesman problem (CTSP) is a generalization of the well-known multiple
traveling salesman problem. In it, each city has one to multiple colors and allows a salesman …
traveling salesman problem. In it, each city has one to multiple colors and allows a salesman …
A memetic algorithm with optimal recombination for the asymmetric travelling salesman problem
AV Eremeev, YV Kovalenko - Memetic Computing, 2020 - Springer
We propose a new memetic algorithm with optimal recombination for the asymmetric
travelling salesman problem (ATSP). The optimal recombination problem (ORP) is solved in …
travelling salesman problem (ATSP). The optimal recombination problem (ORP) is solved in …