Hard to solve instances of the Euclidean Traveling Salesman Problem.
Stefan HougardyXianghui ZhongPublished in: Math. Program. Comput. (2021)
Keyphrases
- traveling salesman problem
- discrete optimization problems
- valid inequalities
- benchmark instances
- combinatorial optimization
- optimization problems
- lin kernighan
- combinatorial problems
- combinatorial optimization problems
- ant colony optimization
- hamiltonian cycle
- vehicle routing problem
- ant colony optimization algorithm
- crossover operator
- traveling salesman
- discrete particle swarm optimization
- quadratic assignment problem
- simulated annealing
- test instances