Differential approximation results for the traveling salesman problem with distances 1 and 2.
Jérôme MonnotVangelis Th. PaschosSophie ToulousePublished in: Eur. J. Oper. Res. (2003)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- ant colony optimization
- combinatorial problems
- ant colony optimization algorithm
- optimization problems
- satisfy the triangle inequality
- transportation networks
- distance measure
- vehicle routing problem
- traveling salesman
- hamiltonian cycle
- combinatorial optimization problems
- distance function
- euclidean distance
- crossover operator
- approximation algorithms
- discrete particle swarm optimization
- discrete optimization problems
- genetic local search
- swarm intelligence
- subtour elimination