An additive bounding procedure for the asymmetric travelling salesman problem
Mathematical Programming: Series A and B
A Tabu Search Algorithm for a Routing and Container Loading Problem
Transportation Science
Ant colony optimization for the two-dimensional loading vehicle routing problem
Computers and Operations Research
The pickup and delivery traveling salesman problem with first-in-first-out loading
Computers and Operations Research
An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints
Transportation Science
INFORMS Journal on Computing
The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
Computers and Operations Research
On the Complexity of the Multiple Stack TSP, kSTSP
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
Computers and Operations Research
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
Networks - Networks Optimization Workshop, August 22–25, 2006
The Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs
Transportation Science
Hi-index | 0.00 |
This 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 © 2013 Wiley Periodicals, Inc.