Universidad Complutense de Madrid
E-Prints Complutense

The multiple vehicle pickup and delivery problem with LIFO constraints

Impacto

Downloads

Downloads per month over past year

Benavent, Enrique and Landete, Mercedes and Mota, Enrique and Tirado Domínguez, Gregorio (2015) The multiple vehicle pickup and delivery problem with LIFO constraints. European journal of operational research, 243 (3). pp. 752-762. ISSN 0377-2217

[img] PDF
Restringido a Repository staff only

433kB

Official URL: http://www.sciencedirect.com/science/article/pii/S0377221714010479


URLURL Type
http://www.sciencedirect.comUNSPECIFIED


Abstract

This paper approaches a pickup and delivery problem with multiple vehicles in which LIFO conditions are imposed when performing loading and unloading operations and the route durations cannot exceed a given limit. We propose two mixed integer formulations of this problem and a heuristic procedure that uses tabu search in a multi-start framework. The first formulation is a compact one, that is, the number of variables and constraints is polynomial in the number of requests, while the second one contains an exponential number of constraints and is used as the basis of a branch-and-cut algorithm. The performances of the proposed solution
methods are evaluated through an extensive computational study using instances of different types that were created by adapting existing benchmark instances. The proposed exact methods are able to optimally solve instances with up to 60 nodes.


Item Type:Article
Uncontrolled Keywords:Vehicle routing; Pickup and delivery; LIFO constraints; Mixed-integer programming; Branch and cut
Subjects:Sciences > Mathematics > Operations research
ID Code:30058
Deposited On:13 May 2015 08:43
Last Modified:13 May 2015 08:43

Origin of downloads

Repository Staff Only: item control page