On the Approximability of the Traveling Salesman Problem with Line Neighborhoods.
Antonios AntoniadisSándor Kisfaludi-BakBundit LaekhanukitDaniel VazPublished in: CoRR (2020)
Keyphrases
- traveling salesman problem
- ant colony optimization
- combinatorial optimization
- optimization problems
- traveling salesman
- combinatorial problems
- discrete optimization problems
- hamiltonian cycle
- ant colony optimization algorithm
- combinatorial optimization problems
- transportation networks
- minimum spanning tree
- valid inequalities
- crossover operator
- nature inspired
- approximation algorithms
- cost function
- genetic local search
- subtour elimination
- nearest neighbor