Improving the Asymmetric TSP by Considering Graph Structure

Jean-Guillaume Fages 1 Xavier Lorca 1
1 TASC - Theory, Algorithms and Systems for Constraints
LINA - Laboratoire d'Informatique de Nantes Atlantique, Département informatique - EMN, Inria Rennes – Bretagne Atlantique
Abstract : Recent works on cost based relaxations have improved Constraint Programming (CP) models for the Traveling Salesman Problem (TSP). We provide a short survey over solving asymmetric TSP with CP. Then, we suggest new implied propagators based on general graph properties. We experimentally show that such implied propagators bring robustness to pathological instances and highlight the fact that graph structure can significantly improve search heuristics behavior. Finally, we show that our approach outperforms current state of the art results.
Complete list of metadatas

Cited literature [33 references]  Display  Hide  Download
Contributor : Jean-Guillaume Fages <>
Submitted on : Tuesday, June 12, 2012 - 5:59:51 PM
Last modification on : Friday, June 22, 2018 - 9:30:10 AM
Long-term archiving on : Thursday, December 15, 2016 - 1:29:36 PM


Files produced by the author(s)


  • HAL Id : hal-00707510, version 1


Jean-Guillaume Fages, Xavier Lorca. Improving the Asymmetric TSP by Considering Graph Structure. 2012. ⟨hal-00707510⟩



Record views


Files downloads