The double travelling salesman problem with multiple stacks – Formulation and heuristic solution approaches
Authors:
- Hanne L. PetersenHPHanne L. Petersen
- Oli B.G. MadsenOMOli B.G. Madsen
- 1 October 2009
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 198 (1) , 139-147
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraintsNetworks, 2007
- An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO LoadingINFOR: Information Systems and Operational Research, 2007
- An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading ConstraintsTransportation Science, 2007
- Metaheuristics for the vehicle routing problem with loading constraintsNetworks, 2007
- A Tabu Search Algorithm for a Routing and Container Loading ProblemTransportation Science, 2006
- 9. VRP with Pickup and Delivery2002
- 8. VRP with Backhauls2002
- 6. Metaheuristics for the Capacitated VRP2002
- Variable neighborhood searchComputers & Operations Research, 1997
- An algorithm for the traveling salesman problem with pickup and delivery customersEuropean Journal of Operational Research, 1985