-Opt Heuristic for the Euclidean Traveling Salesman Problem.
Ulrich A. BrodowskyStefan HougardyXianghui ZhongPublished in: SIAM J. Comput. (2023)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- lin kernighan
- traveling salesman
- benchmark instances
- neighborhood search
- variable neighborhood search
- minimum spanning tree
- combinatorial optimization problems
- optimization problems
- ant colony optimization
- combinatorial problems
- search algorithm
- ant colony optimization algorithm
- simulated annealing
- hamiltonian cycle
- tabu search
- discrete particle swarm optimization
- transportation networks
- vehicle routing problem
- genetic local search
- path relinking
- metaheuristic
- dynamic programming
- euclidean distance
- crossover operator
- optimal solution
- distance measure
- quadratic assignment problem
- lagrangian relaxation
- heuristic methods
- cost function
- search space
- feasible solution