A Steiner Zone Variable Neighborhood Search Heuristic for the Close-Enough Traveling Salesman Problem.
Xingyin WangBruce L. GoldenEdward A. WasilPublished in: Comput. Oper. Res. (2019)
Keyphrases
- variable neighborhood search
- traveling salesman problem
- minimum spanning tree
- neighborhood search
- combinatorial optimization
- benchmark instances
- ant colony optimization
- combinatorial optimization problems
- traveling salesman
- path relinking
- combinatorial problems
- vehicle routing problem
- crossover operator
- routing problem
- optimization problems
- metaheuristic
- valid inequalities
- neural network
- constraint satisfaction
- dynamic programming
- genetic algorithm