Evaluation of Traveling Salesman Problem Instance Hardness by Clustering.
Pavel KrömerJan PlatosPublished in: ECC (2017)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- ant colony optimization
- clustering algorithm
- information theoretic
- vehicle routing problem
- clustering method
- optimization problems
- nature inspired
- traveling salesman
- combinatorial problems
- hamiltonian cycle
- valid inequalities
- genetic local search
- crossover operator
- combinatorial optimization problems
- transportation networks
- k means
- discrete particle swarm optimization
- dissimilarity measure
- neural network
- computational complexity
- dynamic programming
- data points