A new efficient tour construction heuristic for the Traveling Salesman Problem.
Ali Jawad IbadaBoldizsar Tuu-SzaboLászló T. KóczyPublished in: ISMSI (2021)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- traveling salesman
- lin kernighan
- benchmark instances
- neighborhood search
- optimization problems
- ant colony optimization
- minimum spanning tree
- variable neighborhood search
- combinatorial problems
- ant colony optimization algorithm
- hamiltonian cycle
- combinatorial optimization problems
- path relinking
- discrete particle swarm optimization
- discrete optimization problems
- valid inequalities
- crossover operator
- vehicle routing problem
- simulated annealing
- optimal solution
- evolutionary algorithm
- satisfy the triangle inequality
- subtour elimination
- genetic local search
- transportation networks
- exact algorithms
- metaheuristic
- state space
- dynamic programming