An ILP-based local search procedure for the VRP with pickups and deliveries
- 303 Downloads
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.
KeywordsVRP with pickups and deliveries Integer linear programming Matheuristic
This research is partially supported by Grants PICT-2010-0304, PICT-2011-0817, PICT-2013-2460 and UBACyT 20020100100666. The authors also thank the two anonymous referees and the editor for providing valuable suggestions and comments for improving this paper.
- Golden, B., Raghavan, S., & Wasil, E. (Eds.). (2008). The vehicle routing problem : Latest advances and new challenges (Vol. 43)., Operations research/computer science interfaces US Boston: Springer.Google Scholar
- Muter, I., Birbil, I., & Bülbül, K. (2012). Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows. Mathematical Programming, 142(1), 47–82.Google Scholar
- Toth, P., & Tramontani, A. (2008). An integer linear programming local search for capacitated vehicle routing problems. The Vehicle Routing Problem: Latest Advances and New Challenges, 43, 275–295.Google Scholar
- Toth, P. & Vigo, D. (eds.) (2014). Vehicle routing: Problems, methods, and applications, 2nd ed. MOS-SIAM Series on Optimization. Philadelphia, PA, USA.Google Scholar