Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks

Authors:
Jean-Franç/ois Cô/té/;Michel Gendreau;Jean-Yves Potvin
Affiliations:
Dé/pt. d'informatique et de recherche opé/rationnelle, Centre interuniversitaire de recherche sur les ré/seaux d'entreprise, la logistique et le transport, Univ. de Montré/ ...;Dé/pt. de mathé/matiques et de gé/nie industriel, É/cole Polytech. de Montré/al/ Centre interuniversitaire de recherche sur les ré/seaux d'entreprise, la logist ...;Dé/pt. d'informatique et de recherche opé/rationnelle, Centre interuniversitaire de recherche sur les ré/seaux d'entreprise, la logistique et le transport, Univ. de Montré/ ...
Venue:
Networks
Year:
2012

Citing 13
Cited 0

Record breaking optimization results using the ruin and recreate principle

Journal of Computational Physics
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems

CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
A survey of very large-scale neighborhood search techniques

Discrete Applied Mathematics
Optimal routing of multiple-load AGV subject to LIFO loading constraints

Computers and Operations Research
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

Transportation Science
A Tabu Search Algorithm for a Routing and Container Loading Problem

Transportation Science
Metaheuristics for the vehicle routing problem with loading constraints

Networks
Erratum: A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints

Networks
Ant colony optimization for the two-dimensional loading vehicle routing problem

Computers and Operations Research
An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints

Transportation Science
Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading

INFORMS Journal on Computing
The double traveling salesman problem with multiple stacks: A variable neighborhood search approach

Computers and Operations Research
Heuristic and exact algorithms for the multi-pile vehicle routing problem

OR Spectrum

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article studies a single vehicle pickup and delivery problem with loading constraints. In this problem, the vehicle contains a number of (horizontal) stacks of finite capacity for loading items from the rear of the vehicle. Each stack must satisfy a last-in-first-out constraint where any new item must be loaded on top of a stack and any unloaded item must be on top of its stack. A large neighborhood search is proposed for solving this problem. Computational results are reported on different types of randomly generated instances. Results are also reported on benchmark instances for two special cases of our problem and a comparison is provided with state-of-the-art methods. © 2012 Wiley Periodicals, Inc. NETWORKS, 2012 © 2012 Wiley Periodicals, Inc.