On the Performance of Heuristics on Finite and Infinite Fractal Instances of the Euclidean Traveling Salesman Problem.
Pablo MoscatoMichael G. NormanPublished in: INFORMS J. Comput. (1998)
Keyphrases
- traveling salesman problem
- lin kernighan
- traveling salesman
- valid inequalities
- benchmark instances
- ant colony optimization
- combinatorial optimization
- combinatorial problems
- combinatorial optimization problems
- hamiltonian cycle
- ant colony optimization algorithm
- optimization problems
- vehicle routing problem
- discrete optimization problems
- path relinking
- discrete particle swarm optimization
- objective function
- subtour elimination
- timetabling problem
- exact algorithms
- crossover operator
- euclidean space
- simulated annealing
- genetic algorithm