The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks
In the uncapacitated asymmetric traveling salesman problem with multiple stacks, one first performs a hamiltonian circuit to pick up n items, storing them in a vehicle with k stacks satisfying last-in-first-out constraints, and then delivers every item by performing a second hamiltonian circuit. Here, we are interested in the convex hull of the arc-incidence vectors of such couples of hamiltonian circuits.
For the general case, we determine the dimension of this polytope, and show that every facet of the asymmetric traveling salesman polytope defines one of its facets. For the special case with two stacks, we provide an integer linear programming formulation whose linear relaxation is polynomial-time solvable, and we propose new families of valid inequalities to reinforce the latter.
Keywordsasymmetric traveling salesman problem stacks polytope facets formulation valid inequalities
Unable to display preview. Download preview PDF.
- 1.Alba, M., Cordeau, J.-F., Dell’Amico, M., Iori, M.: A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks. INFORMS Journal on Computing (2011) (published online)Google Scholar
- 3.Carrabs, F., Cerulli, R., Speranza, M.G.: A Branch-and-Bound Algorithm for the Double TSP with Two Stacks. Technical report (2010)Google Scholar
- 6.Gutan, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variations. In: Combinatorial Optimization, vol. 12. Kluwer Academic Publishers (2002)Google Scholar
- 11.Toulouse, S.: Approximability of the Multiple Stack TSP. In: International Symposium on Combinatorial Optimization (ISCO 2010), ENDM 813-820 (2010)Google Scholar