RT Journal Article
T1 The multiple vehicle pickup and delivery problem with LIFO constraints
A1 Benavent, Enrique
A1 Landete, Mercedes
A1 Mota, Enrique
A1 Tirado Domínguez, Gregorio
AB 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 solutionmethods 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.
PB Elsevier Science
SN 0377-2217
YR 2015
FD 2015
LK https://hdl.handle.net/20.500.14352/34623
UL https://hdl.handle.net/20.500.14352/34623
LA eng
NO Generalitat Valenciana
NO Government of Spain
NO RDEF funds
NO Fundacion Seneca
NO FEDER
DS Docta Complutense
RD 7 abr 2025