IDEAS home Printed from https://ideas.repec.org/r/eee/ejores/v196y2009i2p509-515.html

An approximate dynamic programming approach for the vehicle routing problem with stochastic demands

Citations

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


Cited by:

  1. Wadi Khalid Anuar & Lai Soon Lee & Hsin-Vonn Seow & Stefan Pickl, 2021. "A Multi-Depot Vehicle Routing Problem with Stochastic Road Capacity and Reduced Two-Stage Stochastic Integer Linear Programming Models for Rollout Algorithm," Mathematics, MDPI, vol. 9(13), pages 1-44, July.
  2. Sayarshad, Hamid R. & Gao, H. Oliver, 2018. "A non-myopic dynamic inventory routing and pricing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 109(C), pages 83-98.
  3. Wang, Gang & Gunasekaran, Angappa & Ngai, Eric W.T. & Papadopoulos, Thanos, 2016. "Big data analytics in logistics and supply chain management: Certain investigations for research and applications," International Journal of Production Economics, Elsevier, vol. 176(C), pages 98-110.
  4. Dimitrakos, T.D. & Kyriakidis, E.G., 2015. "A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order," European Journal of Operational Research, Elsevier, vol. 244(3), pages 990-993.
  5. Marlin W. Ulmer & Dirk C. Mattfeld & Felix Köster, 2018. "Budgeting Time for Dynamic Vehicle Routing with Stochastic Customer Requests," Transportation Science, INFORMS, vol. 52(1), pages 20-37, January.
  6. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).
  7. Lucas Agussurja & Shih-Fen Cheng & Hoong Chuin Lau, 2019. "A State Aggregation Approach for Stochastic Multiperiod Last-Mile Ride-Sharing Problems," Service Science, INFORMS, vol. 53(1), pages 148-166, February.
  8. Deng, Qichen & Santos, Bruno F., 2022. "Lookahead approximate dynamic programming for stochastic aircraft maintenance check scheduling optimization," European Journal of Operational Research, Elsevier, vol. 299(3), pages 814-833.
  9. Florio, Alexandre M. & Hartl, Richard F. & Minner, Stefan, 2020. "Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands," European Journal of Operational Research, Elsevier, vol. 285(1), pages 172-182.
  10. Mathias A. Klapp & Alan L. Erera & Alejandro Toriello, 2018. "The One-Dimensional Dynamic Dispatch Waves Problem," Transportation Science, INFORMS, vol. 52(2), pages 402-415, March.
  11. Zerui Wu & Ran Liu & Ershun Pan, 2023. "Server Routing-Scheduling Problem in Distributed Queueing System with Time-Varying Demand and Queue Length Control," Transportation Science, INFORMS, vol. 57(5), pages 1209-1230, September.
  12. Joseph Y. J. Chow & Hamid R. Sayarshad, 2016. "Reference Policies for Non-myopic Sequential Network Design and Timing Problems," Networks and Spatial Economics, Springer, vol. 16(4), pages 1183-1209, December.
  13. Sayarshad, Hamid R. & Chow, Joseph Y.J., 2015. "A scalable non-myopic dynamic dial-a-ride and pricing problem," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 539-554.
  14. Yanyan Wang & Baiqing Sun, 2022. "Multiperiod optimal emergency material allocation considering road network damage and risk under uncertain conditions," Operational Research, Springer, vol. 22(3), pages 2173-2208, July.
  15. Majid Salavati-Khoshghalb & Michel Gendreau & Ola Jabali & Walter Rei, 2019. "A Rule-Based Recourse for the Vehicle Routing Problem with Stochastic Demands," Transportation Science, INFORMS, vol. 53(5), pages 1334-1353, September.
  16. Nafiseh Shamsi Gamchi & S. Ali Torabi & Fariborz Jolai, 2021. "A novel vehicle routing problem for vaccine distribution using SIR epidemic model," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(1), pages 155-188, March.
  17. F. Hooshmand Khaligh & S.A. MirHassani, 2016. "A mathematical model for vehicle routing problem under endogenous uncertainty," International Journal of Production Research, Taylor & Francis Journals, vol. 54(2), pages 579-590, January.
  18. Fabian Dunke & Stefan Nickel, 2021. "Online optimization with gradual look-ahead," Operational Research, Springer, vol. 21(4), pages 2489-2523, December.
  19. Alexandre M. Florio & Dominique Feillet & Marcus Poggi & Thibaut Vidal, 2022. "Vehicle Routing with Stochastic Demands and Partial Reoptimization," Transportation Science, INFORMS, vol. 56(5), pages 1393-1408, September.
  20. Liu, Jia & Bai, Jinyu & Wu, Desheng, 2021. "Medical supplies scheduling in major public health emergencies," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 154(C).
  21. Jorge Oyola & Halvard Arntzen & David L. Woodruff, 2018. "The stochastic vehicle routing problem, a literature review, part I: models," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 7(3), pages 193-221, September.
  22. Ulusan, Aybike & Ergun, Özlem, 2021. "Approximate dynamic programming for network recovery problems with stochastic demand," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 151(C).
  23. Yu Wu & Bo Zeng & Ming Jian, 2025. "ADP- and rollout-based dynamic vehicle routing for pick-up service via budgeting capacity," Flexible Services and Manufacturing Journal, Springer, vol. 37(2), pages 513-557, June.
  24. Pérez Rivera, Arturo E. & Mes, Martijn R.K., 2017. "Anticipatory freight selection in intermodal long-haul round-trips," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 105(C), pages 176-194.
  25. Hao Yang & Kentaro Oguchi, 2024. "City-Level Integrated Traffic Management with User Preferences Under Connected Environment," Sustainability, MDPI, vol. 16(23), pages 1-15, November.
  26. Fabian Akkerman & Martijn Mes, 2025. "Distance approximation to support customer selection in vehicle routing problems," Annals of Operations Research, Springer, vol. 350(1), pages 269-297, July.
  27. Angel Juan & Javier Faulin & Josep Jorba & Jose Caceres & Joan Marquès, 2013. "Using parallel & distributed computing for real-time solving of vehicle routing problems with stochastic demands," Annals of Operations Research, Springer, vol. 207(1), pages 43-65, August.
  28. Pillac, Victor & Gendreau, Michel & Guéret, Christelle & Medaglia, Andrés L., 2013. "A review of dynamic vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 225(1), pages 1-11.
  29. Legrain, Antoine & Omer, Jérémy & Rosat, Samuel, 2020. "An online stochastic algorithm for a dynamic nurse scheduling problem," European Journal of Operational Research, Elsevier, vol. 285(1), pages 196-210.
  30. Luo, Zhixing & Qin, Hu & Zhang, Dezhi & Lim, Andrew, 2016. "Adaptive large neighborhood search heuristics for the vehicle routing problem with stochastic demands and weight-related cost," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 85(C), pages 69-89.
  31. Bertazzi, Luca & Secomandi, Nicola, 2018. "Faster rollout search for the vehicle routing problem with stochastic demands and restocking," European Journal of Operational Research, Elsevier, vol. 270(2), pages 487-497.
  32. Jin Qin & Yong Ye & Bi-rong Cheng & Xiaobo Zhao & Linling Ni, 2017. "The Emergency Vehicle Routing Problem with Uncertain Demand under Sustainability Environments," Sustainability, MDPI, vol. 9(2), pages 1-24, February.
  33. Baris Yildiz & Martin Savelsbergh, 2019. "Provably High-Quality Solutions for the Meal Delivery Routing Problem," Transportation Science, INFORMS, vol. 53(5), pages 1372-1388, September.
  34. Guodong Yu & Yu Yang, 2019. "Dynamic routing with real-time traffic information," Operational Research, Springer, vol. 19(4), pages 1033-1058, December.
  35. Luca Bertazzi, 2012. "Minimum and Worst-Case Performance Ratios of Rollout Algorithms," Journal of Optimization Theory and Applications, Springer, vol. 152(2), pages 378-393, February.
  36. Hong-Le Tee & Soung-Yue Liew & Chee-Siang Wong & Boon-Yaik Ooi, 2022. "An Estimated-Travel-Time Data Scraping and Analysis Framework for Time-Dependent Route Planning," Data, MDPI, vol. 7(5), pages 1-18, April.
  37. Remy Spliet & Adriana F. Gabor, 2015. "The Time Window Assignment Vehicle Routing Problem," Transportation Science, INFORMS, vol. 49(4), pages 721-731, November.
  38. Zhang, Junlong & Lam, William H.K. & Chen, Bi Yu, 2016. "On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows," European Journal of Operational Research, Elsevier, vol. 249(1), pages 144-154.
  39. Bertazzi, Luca & Bosco, Adamo & Laganà, Demetrio, 2015. "Managing stochastic demand in an Inventory Routing Problem with transportation procurement," Omega, Elsevier, vol. 56(C), pages 112-121.
  40. Wadi Khalid Anuar & Lai Soon Lee & Hsin-Vonn Seow & Stefan Pickl, 2022. "A Multi-Depot Dynamic Vehicle Routing Problem with Stochastic Road Capacity: An MDP Model and Dynamic Policy for Post-Decision State Rollout Algorithm in Reinforcement Learning," Mathematics, MDPI, vol. 10(15), pages 1-70, July.
  41. Jorge Oyola & Halvard Arntzen & David L. Woodruff, 2017. "The stochastic vehicle routing problem, a literature review, Part II: solution methods," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 349-388, December.
  42. Geursen, Izaak L. & Santos, Bruno F. & Yorke-Smith, Neil, 2023. "Fleet planning under demand and fuel price uncertainty using actor–critic reinforcement learning," Journal of Air Transport Management, Elsevier, vol. 109(C).
  43. Justin C. Goodson & Barrett W. Thomas & Jeffrey W. Ohlmann, 2016. "Restocking-Based Rollout Policies for the Vehicle Routing Problem with Stochastic Demand and Duration Limits," Transportation Science, INFORMS, vol. 50(2), pages 591-607, May.
  44. Toriello, Alejandro & Vielma, Juan Pablo, 2012. "Fitting piecewise linear continuous functions," European Journal of Operational Research, Elsevier, vol. 219(1), pages 86-95.
  45. Tingxi Wen & Zhongnan Zhang & Kelvin K L Wong, 2016. "Multi-Objective Algorithm for Blood Supply via Unmanned Aerial Vehicles to the Wounded in an Emergency Situation," PLOS ONE, Public Library of Science, vol. 11(5), pages 1-22, May.
  46. Soeffker, Ninja & Ulmer, Marlin W. & Mattfeld, Dirk C., 2022. "Stochastic dynamic vehicle routing in the light of prescriptive analytics: A review," European Journal of Operational Research, Elsevier, vol. 298(3), pages 801-820.
  47. Nikola Mardešić & Tomislav Erdelić & Tonči Carić & Marko Đurasević, 2023. "Review of Stochastic Dynamic Vehicle Routing in the Evolving Urban Logistics Environment," Mathematics, MDPI, vol. 12(1), pages 1-44, December.
  48. Lei, Chao & Lin, Wei-Hua & Miao, Lixin, 2014. "A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 238(3), pages 699-710.
  49. Yasin Gocgun, 2018. "Simulation-based approximate policy iteration for dynamic patient scheduling for radiation therapy," Health Care Management Science, Springer, vol. 21(3), pages 317-325, September.
  50. Basso, Rafael & Kulcsár, Balázs & Sanchez-Diaz, Ivan & Qu, Xiaobo, 2022. "Dynamic stochastic electric vehicle routing with safe reinforcement learning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 157(C).
  51. Taylan İlhan & Seyed M. R. Iravani & Mark S. Daskin, 2011. "TECHNICAL NOTE---The Adaptive Knapsack Problem with Stochastic Rewards," Operations Research, INFORMS, vol. 59(1), pages 242-248, February.
  52. Shu Zhang & Jeffrey W. Ohlmann & Barrett W. Thomas, 2018. "Dynamic Orienteering on a Network of Queues," Transportation Science, INFORMS, vol. 52(3), pages 691-706, June.
  53. Hanpeng Zhang & Yuxin Wu & Yi Liao & Yuvraj Gajpal, 2020. "Cooperative Strategies in Two-Echelon Rescue Delivery Environment with Accessibility Uncertainty," Sustainability, MDPI, vol. 12(13), pages 1-18, July.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.