Annals of Operations Research

, Volume 259, Issue 1–2, pp 327–350 | Cite as

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

  • Agustín Montero
  • Juan José Miranda-Bront
  • Isabel Méndez-Díaz
Original Paper


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.


VRP 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.


  1. Archetti, C., & Speranza, M. (2014). A survey on matheuristics for routing problems. EURO Journal on Computational Optimization, 2(4), 223–246.CrossRefGoogle Scholar
  2. 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.CrossRefGoogle Scholar
  3. Ball, M. O. (2011). Heuristics based on mathematical programming. Surveys in Operations Research and Management Science, 16(1), 21–38.CrossRefGoogle Scholar
  4. 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.CrossRefGoogle Scholar
  5. Cordeau, J.-F., & Laporte, G. (2007). The dial-a-ride problem: Models and algorithms. Annals of Operations Research, 153(1), 29–46.CrossRefGoogle Scholar
  6. Danna, E., Rothberg, E., & Pape, C. L. (2005). Exploring relaxation induced neighborhoods to improve mip solutions. Mathematical Programming, 102(1), 71–90.CrossRefGoogle Scholar
  7. 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.CrossRefGoogle Scholar
  8. 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.CrossRefGoogle Scholar
  9. Fischetti, M., & Lodi, A. (2003). Local branching. Mathematical Programming, 98(1–3), 23–47.CrossRefGoogle Scholar
  10. 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
  11. Hansen, P., Mladenovic, N., & Urosevic, D. (2006). Variable neighborhood search and local branching. Computers & Operations Research, 33(10), 3034–3045.CrossRefGoogle Scholar
  12. Helsgaun, K. (2000). An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research, 126(1), 106–130.CrossRefGoogle Scholar
  13. 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.CrossRefGoogle Scholar
  14. 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.CrossRefGoogle Scholar
  15. Lin, S., & Kernighan, B. W. (1973). An effective heuristic algorithm for the traveling-salesman problem. Operations Research, 21(2), 498–516.CrossRefGoogle Scholar
  16. 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
  17. 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.CrossRefGoogle Scholar
  18. 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.CrossRefGoogle Scholar
  19. 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.CrossRefGoogle Scholar
  20. 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.CrossRefGoogle Scholar
  21. 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.CrossRefGoogle Scholar
  22. Salari, M., Toth, P., & Tramontani, A. (2010). An ILP improvement procedure for the open vehicle routing problem. Computers & Operations Research, 37(12), 2106–2120.CrossRefGoogle Scholar
  23. 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
  24. Toth, P. & Vigo, D. (eds.) (2014). Vehicle routing: Problems, methods, and applications, 2nd ed. MOS-SIAM Series on Optimization. Philadelphia, PA, USA.Google Scholar

Copyright information

© Springer Science+Business Media New York 2017

Authors and Affiliations

  • Agustín Montero
    • 1
  • Juan José Miranda-Bront
    • 1
    • 2
  • Isabel Méndez-Díaz
    • 1
  1. 1.Departamento de Computación, FCEyNUniversidad de Buenos AiresCiudad Autónoma de Buenos AiresArgentina
  2. 2.Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET)Ciudad Autónoma de Buenos AiresArgentina

Personalised recommendations