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.
Similar content being viewed by others
Notes
Instances retrieved from http://www.or.deis.unibo.it/research_pages/ORinstances/VRPLIB/VRPLIB.html. Last access: July 2016.
Instances retrieved from http://neo.lcc.uma.es/vrp/vrp-instances/capacitated-vrp-with-time-windows-instances/. Last access: July 2016.
Instances retrieved from http://www.diku.dk/~sropke/DataSets/. Last access: July 2016.
Instances retrieved from http://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/100-customers/. Last access: July 2016. Due to some differences regarding the solutions obtained in some of the instances with respect to the ones published by Li and Lim (2003), we consider the optimal and best known solutions for the instances in this site.
References
Archetti, C., & Speranza, M. (2014). A survey on matheuristics for routing problems. EURO Journal on Computational Optimization, 2(4), 223–246.
Ascheuer, N., Fischetti, M., & Grötschel, M. (2000). A polyhedral study of the asymmetric traveling salesman problem with time windows. Networks, 36(2), 69–79.
Ball, M. O. (2011). Heuristics based on mathematical programming. Surveys in Operations Research and Management Science, 16(1), 21–38.
Berbeglia, G., Cordeau, J.-F., Gribkovskaia, I., & Laporte, G. (2007). Static pickup and delivery problems: A classification scheme and survey. Top, 15(1), 1–31.
Cordeau, J.-F., & Laporte, G. (2007). The dial-a-ride problem: Models and algorithms. Annals of Operations Research, 153(1), 29–46.
Danna, E., Rothberg, E., & Pape, C. L. (2005). Exploring relaxation induced neighborhoods to improve mip solutions. Mathematical Programming, 102(1), 71–90.
De Franceschi, R., Fischetti, M., & Toth, P. (2006). A new ILP-based refinement heuristic for vehicle routing problems. Mathematical Programming, 105(2–3), 471–499.
Dumitrescu, I., Ropke, S., Cordeau, J.-F., & Laporte, G. (2008). The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm. Mathematical Programming, 121(2), 269–305.
Fischetti, M., & Lodi, A. (2003). Local branching. Mathematical Programming, 98(1–3), 23–47.
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.
Hansen, P., Mladenovic, N., & Urosevic, D. (2006). Variable neighborhood search and local branching. Computers & Operations Research, 33(10), 3034–3045.
Helsgaun, K. (2000). An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research, 126(1), 106–130.
Hernández-Pérez, H., & Salazar-González, J.-J. (2009). The multi-commodity one-to-one pickup-and-delivery traveling salesman problem. European Journal of Operational Research, 196(3), 987–995.
Li, H., & Lim, A. (2003). A metaheuristic for the pickup and delivery problem with time windows. International Journal on Artificial Intelligence Tools, 12(02), 173–186.
Lin, S., & Kernighan, B. W. (1973). An effective heuristic algorithm for the traveling-salesman problem. Operations Research, 21(2), 498–516.
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.
Muter, I., Birbil, I., Bülbül, K., & Güvenç, (2012). A note on A LP-based heuristic for a time-constrained routing problem. European Journal of Operational Research, 221(2), 306–307.
Naji-Azimi, Z., Salari, M., & Toth, P. (2012). An integer linear programming based heuristic for the capacitated m-Ring-Star problem. European Journal of Operational Research, 217(1), 17–25.
Nanry, W. P., & Barnes, J. W. (2000). Solving the pickup and delivery problem with time windows using reactive tabu search. Transportation Research Part B: Methodological, 34(2), 107–121.
Rodríguez-Martín, I., & Salazar-González, J. J. (2012). A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem. Journal of Heuristics, 18(6), 849–867.
Ropke, S., & Pisinger, D. (2006). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science, 40(4), 455–472.
Salari, M., Toth, P., & Tramontani, A. (2010). An ILP improvement procedure for the open vehicle routing problem. Computers & Operations Research, 37(12), 2106–2120.
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.
Toth, P. & Vigo, D. (eds.) (2014). Vehicle routing: Problems, methods, and applications, 2nd ed. MOS-SIAM Series on Optimization. Philadelphia, PA, USA.
Acknowledgements
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.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Montero, A., José Miranda-Bront, J. & Méndez-Díaz, I. An ILP-based local search procedure for the VRP with pickups and deliveries. Ann Oper Res 259, 327–350 (2017). https://doi.org/10.1007/s10479-017-2520-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-017-2520-5