An ILP-based local search procedure for the VRP with pickups and deliveries

Agustín Montero (), Juan José Miranda-Bront () and Isabel Méndez-Díaz ()
Additional contact information
Agustín Montero: Universidad de Buenos Aires
Juan José Miranda-Bront: Universidad de Buenos Aires
Isabel Méndez-Díaz: Universidad de Buenos Aires
Authors registered in the RePEc Author Service: Juan José Miranda Bront ()

Annals of Operations Research, 2017, vol. 259, issue 1, No 14, 327-350

Abstract: Abstract In this paper we address the Vehicle Routing Problem with Pickups and Deliveries (VRPPD), an extension of the classical Vehicle Routing Problem (VRP) where we consider precedences among customers, and develop an Integer Linear Programming (ILP) based local search procedure. We consider the capacitated one-to-one variant, where a particular precedence must be satisfied between pairs of origin-destination customers. We extend the scheme proposed in De Franceschi et al. (Math Program 105(2–3):471–499, 2006) for the Distance-Constrained Capacitated VRP, which has been successfully applied to other variants of the VRP. Starting from an initial feasible solution, this scheme follows the destroy/repair paradigm where a set of vertices is removed from the routes and reinserted by solving heuristically an associated ILP formulation with an exponential number of variables, named Reallocation Model. In this research, we propose two formulations for the Reallocation Model when considering pickup and delivery constraints and compare their behavior within the framework in terms of the trade off between the quality of the solutions obtained and the computational effort required. Based on the computational experience, the proposed scheme shows good potential to be applied in practice to this kind of problems and is a good starting point to consider more complex versions of the VRPPD.

Keywords: VRP with pickups and deliveries; Integer linear programming; Matheuristic (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-017-2520-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:259:y:2017:i:1:d:10.1007_s10479-017-2520-5

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-017-2520-5

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().