On the Complexity of the Multiple Stack TSP, kSTSP

  • Sophie Toulouse
  • Roberto Wolfler Calvo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5532)


Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T 1 and a delivery tour T 2 of n items on two distinct graphs. The pickup tour successively stores the items at the top of k containers, whereas the delivery tour successively picks the items at the current top of the containers: thus, the couple of tours are subject to LIFO (“Last In First Out”) constraints. This paper aims at finely characterizing the complexity of kSTSP in regards to the complexity of TSP. First, we exhibit tractable sub-problems: on the one hand, given two tours T 1 and T 2, deciding whether T 1 and T 2 are compatible can be done within polynomial time; on the other hand, given an ordering of the n items into the k containers, the optimal tours can also be computed within polynomial time. Note that, to the best of our knowledge, the only family of combinatorial precedence constraints for which constrained TSP has been proven to be in P is the one of PQ-trees, [2]. Finally, in a more prospective way and having in mind the design of approximation algorithms, we study the relationship between optimal value of different TSP problems and the optimal value of kSTSP.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Allahverdi, A., Gupta, J.N.D., Aldowaisan, T.: A review of scheduling research involving setup considerations. Omega 27(2), 219–239 (1999)CrossRefGoogle Scholar
  2. 2.
    Burkard, R.E., Deineko, V.G., Woeginger, G.J.: The Travelling Salesman and the PQ-Tree. In: Cunningham, W.H., Queyranne, M., McCormick, S.T. (eds.) IPCO 1996. LNCS, vol. 1084, pp. 490–504. Springer, Heidelberg (1996)Google Scholar
  3. 3.
    Felipe, A., Ortuño, M., Tirado, G.: Neighborhood structures to solve the double TSP with multiple stacks using local search. In: Proc. of FLINS 2008 (2008)Google Scholar
  4. 4.
    Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. Freeman, CA (1979)zbMATHGoogle Scholar
  5. 5.
    Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. of Discrete Math. 5, 287–326 (1979)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Grötschel, M., Lovász, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2), 169–197 (1981)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Monnot, J.: Differential approximation results for the Traveling Salesman and related problems. Information Processing Letters 82(5), 229–235 (2002)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Petersen, H.L., Madsen, O.B.G.: The double travelling salesman problem with multiple stacks - Formulation and heuristic solution approaches. EJOR (2008) (in press)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Sophie Toulouse
    • 1
  • Roberto Wolfler Calvo
    • 1
  1. 1.LIPN (UMR CNRS 7030) - Institut GaliléeUniversité Paris 13VilletaneuseFrance

Personalised recommendations