The Time Dependent Traveling Salesman Problem: Polyhedra and Algorithm

  • Hernan Abeledo
  • Ricardo Fukasawa
  • Artur Alves Pessoa
  • Eduardo Uchoa
    • Categories Branch and Cut Algorithms, Polyhedra Tags , Short URL: https://optimization-online.org/?p=11399

    The Time Dependent Traveling Salesman Problem (TDTSP) is a generalization of the classical Traveling Salesman Problem (TSP), where arc costs depend on their position in the tour with respect to the source node. While TSP instances with thousands of vertices can be solved routinely, there are very challenging TDTSP instances with less than 100 vertices. In this work, we study the polytope associated to the TDTSP formulation by Picard and Queyranne, which can be viewed as an extended formulation of the TSP. We determine the dimension of the TDTSP polytope and identify several families of facet-defining cuts. We obtain good computational results with a branch-cut-and-price algorithm using the new cuts, solving almost all instances from the TSPLIB with up to 107 vertices.

    Citation

    RPEP Vol.10 n.15 (2010) Universidade Federal Fluminense, Brazil

    Article

    Download

    View The Time Dependent Traveling Salesman Problem: Polyhedra and Algorithm