On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem.
Gilles PesantMichel GendreauJean-Yves PotvinJean-Marc RousseauPublished in: Eur. J. Oper. Res. (1999)
Keyphrases
- traveling salesman problem
- combinatorial problems
- constraint programming
- combinatorial optimization
- graph coloring
- constraint propagation
- ant colony optimization
- constraint satisfaction
- vehicle routing problem
- optimization problems
- integer programming
- traveling salesman
- arc consistency
- constraint solving
- hamiltonian cycle
- cost function
- search strategies
- np complete
- hard and soft constraints
- genetic local search