GLNS: An effective large neighborhood search heuristic for the Generalized Traveling Salesman Problem.
Stephen L. SmithFrank ImesonPublished in: Comput. Oper. Res. (2017)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- vehicle routing problem
- traveling salesman
- ant colony optimization
- benchmark instances
- lin kernighan
- metaheuristic
- optimization problems
- neighborhood search
- hamiltonian cycle
- variable neighborhood search
- path relinking
- transportation networks
- combinatorial problems
- combinatorial optimization problems
- routing problem
- tabu search
- minimum spanning tree
- discrete particle swarm optimization
- test instances
- genetic local search
- valid inequalities
- ant colony optimization algorithm
- mixed integer programming
- feasible solution
- np hard
- discrete optimization problems
- search space
- subtour elimination
- search algorithm