Annals of Operations Research

, Volume 236, Issue 2, pp 425–461 | Cite as

Variable neighborhood search for the stochastic and dynamic vehicle routing problem

  • Briseida Sarasola
  • Karl F. Doerner
  • Verena Schmid
  • Enrique Alba
Article

Abstract

In this paper, the authors consider the vehicle routing problem (VRP) with stochastic demand and/or dynamic requests. The classical VRP consists of determining a set of routes starting and ending at a depot that provide service to a set of customers. Stochastic demands are only revealed when the vehicle arrives at the customer location; dynamic requests mean that new orders from previously unknown customers can be received and scheduled over time. The variable neighborhood search algorithm (VNS) proposed in this study can be extended by sampling for stochastic scenarios and adapted for the dynamic setting. We use standard sets of benchmark instances to evaluate our algorithms. When applying sampling based VNS, on average we were able to improve results obtained by a classical VNS by 4.39 %. Individual instances could be improved by up to 8.12 %. In addition, the proposed VNS framework matches 32 out of 40 best known solutions and provides one new best solution. In the dynamic case, VNS improves on existing results and provides new best solutions for 7 out of 21 instances. Finally, this study offers results for stochastic and dynamic scenarios. Our experiments show that the sampling based dynamic VNS provides better results when the demand deviation is small, and reduces the excess route duration by 45–90 %.

Keywords

Variable neighborhood search Vehicle routing problem  Dynamic requests Stochastic demands 

References

  1. Ak, A., & Erera, A. L. (2007). A paired-vehicle recourse strategy for the vehicle-routing problem with stochastic demands. Transportation Science, 41(2), 222–237.CrossRefGoogle Scholar
  2. Augerat, P., Belenguer, J. M., Benavent, E., Corberán, Á., & Naddef, D. (1998). Separating capacity constraints in the CVRP using tabu search. European Journal of Operational Research, 106(2–3), 546–557.CrossRefGoogle Scholar
  3. Bent, R., & Van Hentenryck, P. (2004). Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Operations Research, 52(6), 977–987.CrossRefGoogle Scholar
  4. Bianchi, L., Birattari, M., Chiarandini, M., Manfrin, M., Mastrolilli, M., Paquete, L., et al. (2006). Hybrid metaheuristics for the vehicle routing problem with stochastic demands. Journal of Mathematical Modelling and Algorithms, 5(1), 91–110.CrossRefGoogle Scholar
  5. Branchini, R. M., Armentano, V. A., & Løkketangen, A. (2009). Adaptive granular local search heuristic for a dynamic vehicle routing problem. Computers & Operations Research, 36(11), 2955–2968.CrossRefGoogle Scholar
  6. Bräysy, O. (2003). A reactive variable neighborhood search for the vehicle routing problem with time windows. INFORMS Journal on Computing, 15(4), 347–368.CrossRefGoogle Scholar
  7. Christiansen, C. H., & Lysgaard, J. (2007). A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands. Operations Research Letters, 35(6), 773–781.CrossRefGoogle Scholar
  8. Christofides, N., & Eilon, S. (1969). An algorithm for the vehicle-dispatching problem. OR, 20(3), 309–318.CrossRefGoogle Scholar
  9. Christofides, N., Mingozzi, A., & Toth, P. (1979). The vehicle routing problem, chap. 11. London: Wiley.Google Scholar
  10. Clarke, G., & Wright, J. W. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12(4), 568–581.CrossRefGoogle Scholar
  11. Croes, A. (1958). A method for solving traveling salesman problems. Operations Research, 5, 791–812.CrossRefGoogle Scholar
  12. Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6(1), 80–91.CrossRefGoogle Scholar
  13. Erera, A. L., Morales, J. C., & Savelsbergh, M. W. P. (2010). The vehicle routing problem with stochastic demand and duration constraints. Transportation Science, 44(4), 474–492.CrossRefGoogle Scholar
  14. Fisher, M. L., & Jaikumar, R. (1981). A generalized assignment heuristic for vehicle routing. Networks, 11(2), 109–124.CrossRefGoogle Scholar
  15. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. San Francisco: W. H. Freeman.Google Scholar
  16. Geekbench benchmark. (2010). http://www.primatelabs.ca/.
  17. Gendreau, M., Guertin, F., Potvin, J. Y., & Taillard, E. (1999). Parallel tabu search for real-time vehicle routing and dispatching. Transportation Science, 33(4), 381–390.CrossRefGoogle Scholar
  18. Gendreau, M., Laporte, G., & Séguin, R. (1996). A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Operations Research, 44(3), 469–477.CrossRefGoogle Scholar
  19. Goodson, J. C., Ohlmann, J. W., & Thomas, B. W. (2012). Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand. European Journal of Operational Research, 217(2), 312–323.CrossRefGoogle Scholar
  20. Goodson, J. C., Ohlmann, J. W., & Thomas, B. W. (2013). Rollout policies for dynamic solutions to the multivehicle routing problem with stochastic demand and duration limits. Operations Research, 61(1), 138–154.CrossRefGoogle Scholar
  21. Gutjahr, W. J., Katzensteiner, S., & Reiter, P. (2007). A VNS algorithm for noisy problems and its application to project portfolio analysis. In SAGA 2007, lecture notes in computer science, vol. 4665, (pp. 93–104). Berlin: Springer.Google Scholar
  22. Hansen, P., & Mladenović, N. (1999). An introduction to variable neighborhood search. In S. Voß, S. Martello, I. Osman, & C. Roucairol (Eds.), Metaheuristics: Advances and trends in local search paradigms for optimization, chap. 30 (pp. 433–458). Dordrecht: Kluwer.CrossRefGoogle Scholar
  23. Hanshar, F. T., & Ombuki-Berman, B. M. (2007). Dynamic vehicle routing using genetic algorithms. Applied Intelligence, 27, 89–99.CrossRefGoogle Scholar
  24. Hvattum, L. M., Løkketangen, A., & Laporte, G. (2006). Solving a dynamic and stochastic vehicle routing problem with a sample scenario hedging heuristic. Transportation Science, 40(4), 421–438.CrossRefGoogle Scholar
  25. Khouadjia, M. R., Sarasola, B., Alba, E., Jourdan, L., & Talbi, E. G. (2011). Multi-environmental cooperative parallel metaheuristics for solving dynamic optimization problems. In IPDPS Workshops, (pp. 395–403). IEEE.Google Scholar
  26. Khouadjia, M. R., Sarasola, B., Alba, E., Jourdan, L., & Talbi, E. G. (2012). A comparative study between dynamic adapted PSO and VNS for the vehicle routing problem with dynamic requests. Applied Soft Computing, 12(4), 1426–1439.CrossRefGoogle Scholar
  27. Kilby, P., Prosser, P., & Shaw, P. (1998). Dynamic VRPs: A study of scenarios. Tech. rep.: University of Strathclyde, UK.Google Scholar
  28. Kritzinger, S., Tricoire, F., Doerner, K. F., Hartl, R. F., & Stützle, T. (2012). A unified framework for routing problems with fixed fleet size. Technical Report, submitted.Google Scholar
  29. Kuo, Y., & Wang, C. C. (2012). A variable neighborhood search for the multi-depot vehicle routing problem with loading cost. Expert Systems with Applications, 39(8), 6949–6954.CrossRefGoogle Scholar
  30. Kytöjoki, J., Nuortio, T., Bräysy, O., & Gendreau, M. (2007). An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Computers & Operations Research, 34(9), 2743–2757.CrossRefGoogle Scholar
  31. Laporte, G., Louveaux, F. V., & van Hamme, L. (2002). An integer l-shaped algorithm for the capacitated vehicle routing problem with stochastic demands. Operations Research, 50(3), 415–423.CrossRefGoogle Scholar
  32. Lecluyse, C., Van Woensel, T., & Peremans, H. (2009). Vehicle routing with stochastic time-dependent travel times. 4OR, 7(4), 363–377.CrossRefGoogle Scholar
  33. Lei, H., Laporte, G., & Guo, B. (2011). The capacitated vehicle routing problem with stochastic demands and time windows. Computers & Operations Research, 38(12), 1775–1783.CrossRefGoogle Scholar
  34. Li, X., Tian, P., & Leung, S. C. (2010). Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm. International Journal of Production Economics, 125(1), 137–145.CrossRefGoogle Scholar
  35. Lorini, S., Potvin, J. Y., & Zufferey, N. (2011). Online vehicle routing and scheduling with dynamic travel times. Computers & Operations Research, 38(7), 1086–1090.CrossRefGoogle Scholar
  36. Mendoza, J. E., Rousseau, L. M., & Villegas, J. G. A hybrid metaheuristic for the vehicle routing problem with stochastic demand and duration constraints. Under review.Google Scholar
  37. Mendoza, J. E., Castanier, B., Guéret, C., Medaglia, A. L., & Velasco, N. (2010). A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands. Computers & Operations Research, 37(11), 1886–1898.CrossRefGoogle Scholar
  38. Mendoza, J. E., & Villegas, J. G. (2013). A multi-space sampling heuristic for the vehicle routing problem with stochastic demands. Optimization Letters, 7(7), 1503–1516.CrossRefGoogle Scholar
  39. Montemanni, R., Gambardella, L. M., Rizzoli, A. E., & Donati, A. V. (2005). Ant colony system for a dynamic vehicle routing problem. Journal of Combinatorial Optimization, 10(4), 327–343.CrossRefGoogle Scholar
  40. Mu, Q., Fu, Z., Lysgaard, J., & Eglese, R. (2011). Disruption management of the vehicle routing problem with vehicle breakdown. Journal of the Operational Research Society, 62(4), 742–749.CrossRefGoogle Scholar
  41. Pillac, V., Gendreau, M., Guéret, C., & Medaglia, A. L. (2013). A review of dynamic vehicle routing problems. European Journal of Operational Research, 225(1), 1–11.CrossRefGoogle Scholar
  42. Polacek, M., Hartl, R. F., Doerner, K., & Reimann, M. (2004). A variable neighborhood search for the multi depot vehicle routing problem with time windows. Journal of Heuristics, 10(6), 613–627.CrossRefGoogle Scholar
  43. Potvin, J. Y., & Rousseau, J. M. (1995). An exchange heuristic for routing problems with time windows. Journal of the Operational Research Society, 46, 1433–1446.CrossRefGoogle Scholar
  44. Potvin, J. Y., Xu, Y., & Benyahia, I. (2006). Vehicle routing and scheduling with dynamic travel times. Computers & Operations Research, 33, 1129–1137.CrossRefGoogle Scholar
  45. Psaraftis, H. N. (1988). Dynamic vehicle routing problems (vol. 16). North Holland.Google Scholar
  46. Psaraftis, H. N. (1995). Dynamic vehicle routing: Status and prospects. Annals of Operations Research, 61, 143–164.CrossRefGoogle Scholar
  47. Sarasola, B., Khouadjia, M. R., Alba, E., Jourdan, L., & Talbi, E. G. (2011). Flexible variable neighborhood search in dynamic vehicle routing. In EvoApplications (1), lecture notes in computer science, vol. 6624, (pp. 344–353). Berlin: Springer.Google Scholar
  48. Schilde, M., Doerner, K. F., & Hartl, R. F. (2011). Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports. Computers & Operations Research, 38(12), 1719–1730.CrossRefGoogle Scholar
  49. Secomandi, N. (2001). A rollout policy for the vehicle routing problem with stochastic demands. Operations Research, 49(5), 796–802.CrossRefGoogle Scholar
  50. Secomandi, N., & Margot, F. (2009). Reoptimization approaches for the vehicle-routing problem with stochastic demands. Operations Research, 57(1), 214–230.CrossRefGoogle Scholar
  51. Taillard, É. D. (1993). Parallel iterative search methods for vehicle routing problems. Networks, 23(8), 661–673.CrossRefGoogle Scholar
  52. Taillard, É. D., Badeau, P., Gendreau, M., Guertin, F., & Potvin, J. Y. (1997). A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science, 31(2), 170–186.CrossRefGoogle Scholar
  53. Ulmer, M. W., Brinkmann, J., & Mattfeld, D. C. (2013). Anticipatory planning for courier, express and parcel services. To appear in Proceedings of Logistik Management.Google Scholar
  54. Zachariadis, E. E., & Kiranoudis, C. T. (2010). An open vehicle routing problem metaheuristic for examining wide solution neighborhoods. Computers & Operations Research, 37(4), 712–723.CrossRefGoogle Scholar
  55. Zhang, T., Chaovalitwongse, W., & Zhang, Y. (2012). Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries. Computers & Operations Research, 39(10), 2277–2290.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  • Briseida Sarasola
    • 1
  • Karl F. Doerner
    • 1
  • Verena Schmid
    • 1
  • Enrique Alba
    • 2
  1. 1.Christian Doppler Laboratory for Efficient Intermodal Transport Operations, Department of Business AdministrationUniversity of ViennaViennaAustria
  2. 2.Departamento de Lenguajes y Ciencias de la ComputaciónUniversity of MalagaMálagaSpain

Personalised recommendations