Improved exact method for the double TSP with multiple stacks

    Research output: Contribution to journalJournal articleResearchpeer-review

    Abstract

    The Double TSP with Multiple Stacks is a logistics problem where one must, using a container, transport a given number of orders from a set of pickup customers to a set of delivery customers at minimum cost. Each order corresponds to the movement of one pallet, all pickups must be completed before the first delivery, and the container cannot be repacked once packed. In this paper we improve the previously proposed exact method of Lusby et al. (Int Trans Oper Res 17 (2010), 637–652) through an additional preprocessing technique that uses the longest common subsequence between the respective pickup and delivery problems. The results suggest an impressive improvement, and we report, for the first time, optimal solutions to several unsolved instances from the literature containing 18 customers. Instances with 28 customers are also shown to be solvable within a few percent of optimality. © 2011 Wiley Periodicals, Inc. NETWORKS, Vol. 58(4), 290–300 2011
    Original languageEnglish
    JournalNetworks
    Volume58
    Issue number4
    Pages (from-to)290-300
    ISSN0028-3045
    DOIs
    Publication statusPublished - 2011

    Keywords

    • TSP
    • routing; packing
    • k ‐best solution
    • longest common subsequence.

    Fingerprint

    Dive into the research topics of 'Improved exact method for the double TSP with multiple stacks'. Together they form a unique fingerprint.

    Cite this