Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2.
Jérôme MonnotVangelis Th. PaschosSophie ToulousePublished in: FCT (2001)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- satisfy the triangle inequality
- ant colony optimization
- combinatorial optimization problems
- combinatorial problems
- ant colony optimization algorithm
- discrete particle swarm optimization
- traveling salesman
- approximation algorithms
- optimization problems
- distance measure
- crossover operator
- transportation networks
- genetic local search
- discrete optimization problems
- valid inequalities
- vehicle routing problem
- euclidean distance
- distance function
- hamiltonian cycle
- neural network
- nearest neighbor
- np hard