An Exact Algorithm for the Close Enough Traveling Salesman Problem with Arc Covering Constraints.
Minh Hoàng HàNathalie BostelAndré LangevinLouis-Martin RousseauPublished in: ICORES (2012)
Keyphrases
- traveling salesman problem
- combinatorial problems
- valid inequalities
- combinatorial optimization
- ant colony optimization
- subtour elimination
- optimization problems
- combinatorial optimization problems
- ant colony optimization algorithm
- traveling salesman
- transportation networks
- genetic local search
- vehicle routing problem
- exact algorithms
- branch and bound
- constraint programming
- integer programming
- hamiltonian cycle
- discrete optimization problems
- discrete particle swarm optimization
- graph coloring
- genetic algorithm
- nearest neighbor
- satisfy the triangle inequality
- np complete
- constraint satisfaction
- mixed integer
- branch and bound algorithm
- crossover operator