-opt submoves for the Lin-Kernighan TSP heuristic.
Keld HelsgaunPublished in: Math. Program. Comput. (2009)
Keyphrases
- simulated annealing
- traveling salesman problem
- lin kernighan
- combinatorial optimization
- traveling salesman
- benchmark problems
- genetic algorithm
- ant colony optimization
- vehicle routing problem
- crossover operator
- optimization problems
- knn
- benchmark instances
- valid inequalities
- linear programming
- particle swarm optimization
- search algorithm
- exact solution