A Double-Adaptive General Variable Neighborhood Search algorithm for the solution of the Traveling Salesman Problem.
Panagiotis KarakostasAngelo SifalerasPublished in: Appl. Soft Comput. (2022)
Keyphrases
- traveling salesman problem
- search algorithm
- discrete optimization problems
- combinatorial optimization
- ant colony optimization
- neighborhood search
- combinatorial optimization problems
- combinatorial problems
- optimization problems
- special case
- search space
- optimal solution
- transportation networks
- traveling salesman
- ant colony optimization algorithm
- variable neighborhood search
- vehicle routing problem
- heuristic search
- genetic local search
- discrete particle swarm optimization
- discrete optimization
- hamiltonian cycle
- quadratic assignment problem
- mixed integer
- branch and bound algorithm
- branch and bound