Deep clustering of the traveling salesman problem to parallelize its solution

Cites Work

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561208)