IDEAS home Printed from https://ideas.repec.org/r/spr/eurjtl/v6y2017i4d10.1007_s13676-016-0099-7.html
   My bibliography  Save this item

The stochastic vehicle routing problem, a literature review, Part II: solution methods

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Bruni, M.E. & Khodaparasti, S. & Beraldi, P., 2020. "The selective minimum latency problem under travel time variability: An application to post-disaster assessment operations," Omega, Elsevier, vol. 92(C).
  2. Visser, T.R. & Savelsbergh, M.W.P., 2019. "Strategic Time Slot Management: A Priori Routing for Online Grocery Retailing," Econometric Institute Research Papers EI2019-04, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
  3. Osorio-Mora, Alan & Saldanha-da-Gama, Francisco & Toth, Paolo, 2025. "A risk-averse latency location-routing problem with stochastic travel times," European Journal of Operational Research, Elsevier, vol. 321(3), pages 837-850.
  4. Federica Bomboi & Christoph Buchheim & Jonas Pruente, 2022. "On the stochastic vehicle routing problem with time windows, correlated travel times, and time dependency," 4OR, Springer, vol. 20(2), pages 217-239, June.
  5. Borzou Rostami & Guy Desaulniers & Fausto Errico & Andrea Lodi, 2021. "Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times," Operations Research, INFORMS, vol. 69(2), pages 436-455, March.
  6. Dennis Adelhütte & Kristin Braun & Frauke Liers & Sebastian Tschuppik, 2025. "Minimizing delays of patient transports with incomplete information: A modeling approach based on the vehicle routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 47(2), pages 565-604, June.
  7. Ritzinger, Ulrike & Puchinger, Jakob & Rudloff, Christian & Hartl, Richard F., 2022. "Comparison of anticipatory algorithms for a dial-a-ride problem," European Journal of Operational Research, Elsevier, vol. 301(2), pages 591-608.
  8. Nadia Giuffrida & Jenny Fajardo-Calderin & Antonio D. Masegosa & Frank Werner & Margarete Steudter & Francesco Pilla, 2022. "Optimization and Machine Learning Applied to Last-Mile Logistics: A Review," Sustainability, MDPI, vol. 14(9), pages 1-16, April.
  9. Pedro Munari & Alfredo Moreno & Jonathan De La Vega & Douglas Alem & Jacek Gondzio & Reinaldo Morabito, 2019. "The Robust Vehicle Routing Problem with Time Windows: Compact Formulation and Branch-Price-and-Cut Method," Transportation Science, INFORMS, vol. 53(4), pages 1043-1066, July.
  10. Banerjee, Dipayan & Erera, Alan L. & Stroh, Alexander M. & Toriello, Alejandro, 2023. "Who has access to e-commerce and when? Time-varying service regions in same-day delivery," Transportation Research Part B: Methodological, Elsevier, vol. 170(C), pages 148-168.
  11. Kenneth Stoop & Mario Pickavet & Didier Colle & Pieter Audenaert, 2024. "Selective Backhauls in Truck Transport with Risk Mitigation: Large Belgian Retailer Case Study," Networks and Spatial Economics, Springer, vol. 24(1), pages 99-130, March.
  12. Salavati-Khoshghalb, Majid & Gendreau, Michel & Jabali, Ola & Rei, Walter, 2019. "An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy," European Journal of Operational Research, Elsevier, vol. 273(1), pages 175-189.
  13. Laporte, Gilbert, 2024. "Fifty years of operational research: 1972–2022," European Journal of Operational Research, Elsevier, vol. 319(2), pages 347-360.
  14. Bekker, René & Bharti, Bharti & Lan, Leon & Mandjes, Michel, 2024. "A queueing-based approach for integrated routing and appointment scheduling," European Journal of Operational Research, Elsevier, vol. 318(2), pages 534-548.
  15. Florio, Alexandre M. & Gendreau, Michel & Hartl, Richard F. & Minner, Stefan & Vidal, Thibaut, 2023. "Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1081-1093.
  16. Zhang, Lele & Ding, Pengyuan & Thompson, Russell G., 2023. "A stochastic formulation of the two-echelon vehicle routing and loading bay reservation problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
  17. Reusken, Meike & Laporte, Gilbert & Rohmer, Sonja U.K. & Cruijssen, Frans, 2024. "Vehicle routing with stochastic demand, service and waiting times — The case of food bank collection problems," European Journal of Operational Research, Elsevier, vol. 317(1), pages 111-127.
  18. Hassana Abdullahi & Lorena Reyes-Rubiano & Djamila Ouelhadj & Javier Faulin & Angel A. Juan, 2025. "A reliability-extended simheuristic for the sustainable vehicle routing problem with stochastic travel times and demands," Journal of Heuristics, Springer, vol. 31(2), pages 1-39, June.
  19. Hossein Hashemi Doulabi & Gilles Pesant & Louis-Martin Rousseau, 2020. "Vehicle Routing Problems with Synchronized Visits and Stochastic Travel and Service Times: Applications in Healthcare," Transportation Science, INFORMS, vol. 54(4), pages 1053-1072, July.
  20. De La Vega, Jonathan & Gendreau, Michel & Morabito, Reinaldo & Munari, Pedro & Ordóñez, Fernando, 2023. "An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands," European Journal of Operational Research, Elsevier, vol. 308(2), pages 676-695.
  21. Pahwa, Anmol & Jaller, Miguel, 2023. "Assessing last-mile distribution resilience under demand disruptions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 172(C).
  22. Bruck, Bruno P. & Coutinho, Walton P. & Munari, Pedro, 2025. "The Robust Bike sharing Rebalancing Problem: Formulations and a branch-and-cut algorithm," European Journal of Operational Research, Elsevier, vol. 325(1), pages 67-80.
  23. Alexandre M. Florio & Nabil Absi & Dominique Feillet, 2021. "Routing Electric Vehicles on Congested Street Networks," Transportation Science, INFORMS, vol. 55(1), pages 238-256, 1-2.
  24. Luca Bertazzi & Nicola Secomandi, 2020. "Technical Note—Worst-Case Benefit of Restocking for the Vehicle Routing Problem with Stochastic Demands," Operations Research, INFORMS, vol. 68(3), pages 671-675, May.
  25. Lu, Da & Gzara, Fatma, 2019. "The robust vehicle routing problem with time windows: Solution by branch and price and cut," European Journal of Operational Research, Elsevier, vol. 275(3), pages 925-938.
  26. Alexandre M. Florio & Richard F. Hartl & Stefan Minner & Juan-José Salazar-González, 2021. "A Branch-and-Price Algorithm for the Vehicle Routing Problem with Stochastic Demands and Probabilistic Duration Constraints," Transportation Science, INFORMS, vol. 55(1), pages 122-138, 1-2.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.