Deep clustering of the traveling salesman problem to parallelize its solution

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Algorithm AS 136: A K-Means Clustering Algorithm
Traveling salesman problem heuristics: leading methods, implementations and latest advances
A large population size can be unhelpful in evolutionary algorithms
Solution of large-scale symmetric travelling salesman problems
Clustering to minimize the maximum intercluster distance
Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem
A parallel tabu search algorithm for large traveling salesman problems
Combinatorial optimization -- Eureka, you shrink. Papers dedicated to Jack Edmonds. 5th international workshop, Aussois, France, March 5--9, 2001. Revised papers
Guidelines for the use of meta-heuristics in combinatorial optimization.
A Lagrangean-based heuristics for the target covering problem in wireless sensor network
Mathematical modeling of multiple tour multiple traveling salesman problem using evolutionary programming
Optimization in multimodal freight transportation problems: a survey
A fresh look at the traveling salesman problem with a center
The elitist non-homogeneous genetic algorithm: almost sure convergence
Controller Parameters Optimization on a Representative Set of Systems Using Deterministic-Chaotic-Mutation Evolutionary Algorithms
Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
Mersenne twister
Random Numbers and Computers
Heuristics from Nature for Hard Combinatorial Optimization Problems
Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule
A reinforced hybrid genetic algorithm for the traveling salesman problem
Tight lower bounds for the traveling salesman problem with draft limits
Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows
The solution of some 100-city travelling salesman problems

This page was built for publication: Deep clustering of the traveling salesman problem to parallelize its solution