A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks

Abstract

AbstractThis article studies the double traveling salesman problem with two stacks. A number of requests have to be served where each request consists in the pickup and delivery of an item. All the pickup operations have to be performed before any delivery can take place. A single vehicle is available that starts from a depot, performs all the pickup operations and returns to the depot. Then, it performs all the delivery operations and returns to the depot. The items are loaded in two stacks, each served independently from the other with a last‐in‐first‐out policy. The objective is the minimization of the total cost of the pickup and delivery tours. We propose a branch‐and‐bound approach to solve the problem. The algorithm uses properties of the problem both to tighten the lower bounds and to avoid the exploration of redundant subtrees. Computational results performed on benchmark instances reveal that the algorithm outperforms the other exact approaches for this problem. © 2012 Wiley Periodicals, Inc. NETWORKS, 2013