Advertisement

A Matheuristic Approach to the Pickup and Delivery Problem with Time Windows

  • Carlo S. SartoriEmail author
  • Luciana S. Buriol
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11184)

Abstract

In this work, the Pickup and Delivery Problem with Time Windows is studied. It is a combinatorial optimization problem, in which the objective is to construct the best set of vehicle routes while respecting side constraints, such as precedence between locations to be visited, and the time to service them. To tackle this problem, a matheuristic based on Iterated Local Search method is proposed, with an embedded Set Partitioning Problem that is iteratively solved to recombine routes of previously found solutions. Results indicate the approach works well for a standard benchmark set of instances from the literature. A number of new best-known solutions has been found.

Keywords

Matheuristic Pickup and delivey problem Time windows Iterated local search 

Notes

Acknowledgment

This work was partially supported by CNPq (Conselho Nacional de Desenvolvimento Científico e Tecnológico) and FAPERGS (Fundação de Amparo à Pesquisa do Estado do Rio Grande do Sul). In addition, the authors acknowledge the valuable contributions of the two anonymous reviewers.

References

  1. 1.
    Alvarenga, G.B., Mateus, G.R., De Tomi, G.: A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows. Comput. Oper. Res. 34(6), 1561–1584 (2007)CrossRefGoogle Scholar
  2. 2.
    Archetti, C., Speranza, M.G.: A survey on matheuristics for routing problems. EURO J. Comput. Optim. 2(4), 223–246 (2014)CrossRefGoogle Scholar
  3. 3.
    Baldacci, R., Bartolini, E., Mingozzi, A.: An exact algorithm for the pickup and delivery problem with time windows. Oper. Res. 59(2), 414–426 (2011)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Bent, R., Van Hentenryck, P.: A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Comput. Oper. Res. 33(4), 875–893 (2006)CrossRefGoogle Scholar
  5. 5.
    Boschetti, M.A., Maniezzo, V., Roffilli, M., Bolufé Röhler, A.: Matheuristics: optimization, simulation and control. In: Blesa, M.J., Blum, C., Di Gaspero, L., Roli, A., Sampels, M., Schaerf, A. (eds.) HM 2009. LNCS, vol. 5818, pp. 171–177. Springer, Heidelberg (2009).  https://doi.org/10.1007/978-3-642-04918-7_13CrossRefGoogle Scholar
  6. 6.
    Burke, E.K., Bykov, Y.: A late acceptance strategy in hill-climbing for exam timetabling problems. In: PATAT 2008 Conference, Montreal, Canada (2008)Google Scholar
  7. 7.
    Curtois, T., Landa-Silva, D., Qu, Y., Laesanklang, W.: Large neighbourhood search with adaptive guided ejection search for the pickup and delivery problem with time windows. EURO J. Transp. Logist., pp. 1–42 (2017)Google Scholar
  8. 8.
    Dumas, Y., Desrosiers, J., Soumis, F.: The pickup and delivery problem with time windows. Eur. J. Oper. Res. 54(1), 7–22 (1991)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Grangier, P., Gendreau, M., Lehuédé, F., Rousseau, L.M.: A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking. Comput. Oper. Res. 84, 116–126 (2017)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Laporte, G.: What you should know about the vehicle routing problem. Nav. Res. Logist. (NRL) 54(8), 811–819 (2007)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Li, H., Lim, A.: A metaheuristic for the pickup and delivery problem with time windows. Int. J. Artif. Intell. Tools 12(02), 173–186 (2003)CrossRefGoogle Scholar
  12. 12.
    López-Ibáñez, M., Dubois-Lacoste, J., Cáceres, L.P., Birattari, M., Stützle, T.: The irace package: Iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43–58 (2016)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Lourenço, H.R., Martin, O.C., Stützle, T.: Iterated local search: framework and applications. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146, pp. 363–397. Springer, Boston (2010).  https://doi.org/10.1007/978-1-4419-1665-5_12CrossRefGoogle Scholar
  14. 14.
    Nalepa, J., Blocho, M.: Enhanced guided ejection search for the pickup and delivery problem with time windows. In: Nguyen, N.T., Trawiński, B., Fujita, H., Hong, T.-P. (eds.) ACIIDS 2016. LNCS (LNAI), vol. 9621, pp. 388–398. Springer, Heidelberg (2016).  https://doi.org/10.1007/978-3-662-49381-6_37CrossRefGoogle Scholar
  15. 15.
    Nanry, W.P., Barnes, J.W.: Solving the pickup and delivery problem with time windows using reactive tabu search. Transp. Res. Part B Methodol. 34(2), 107–121 (2000)CrossRefGoogle Scholar
  16. 16.
    Parragh, S.N., Doerner, K.F., Hartl, R.F.: A survey on pickup and delivery problems. J. für Betriebswirtschaft 58(1), 21–51 (2008)CrossRefGoogle Scholar
  17. 17.
    Parragh, S.N., Schmid, V.: Hybrid column generation and large neighborhood search for the dial-a-ride problem. Comput. Oper. Res. 40(1), 490–497 (2013)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Ropke, S., Cordeau, J.F.: Branch-and-cut-and-price for the pickup and delivery problem with time windows. Transp. Sci. 43(3), 267–286 (2009)CrossRefGoogle Scholar
  19. 19.
    Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40(4), 455–472 (2006)CrossRefGoogle Scholar
  20. 20.
    Savelsbergh, M.W., Sol, M.: The general pickup and delivery problem. Transp. Sci. 29(1), 17–29 (1995)CrossRefGoogle Scholar
  21. 21.
    Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417–431. Springer, Heidelberg (1998).  https://doi.org/10.1007/3-540-49481-2_30CrossRefGoogle Scholar
  22. 22.
    SINTEF: Li & lim benchmark instances (2008). https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/. Accessed 18 April 2018
  23. 23.
    Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254–265 (1987)MathSciNetCrossRefGoogle Scholar
  24. 24.
    Subramanian, A., Uchoa, E., Ochi, L.S.: A hybrid algorithm for a class of vehicle routing problems. Comput. Oper. Res. 40(10), 2519–2531 (2013)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Instituto de InformáticaUniversidade Federal do Rio Grande do SulPorto AlegreBrazil

Personalised recommendations