IDEAS home Printed from https://ideas.repec.org/r/pal/jorsoc/v53y2002i6d10.1057_palgrave.jors.2601352.html
   My bibliography  Save this item

Partially dynamic vehicle routing—models and algorithms

Citations

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


Cited by:

  1. Roberto Aringhieri & Giuliana Carello & Daniela Morale, 2016. "Supporting decision making to improve the performance of an Italian Emergency Medical Service," Annals of Operations Research, Springer, vol. 236(1), pages 131-148, January.
  2. Roberto Aringhieri & Giuliana Carello & Daniela Morale, 2016. "Supporting decision making to improve the performance of an Italian Emergency Medical Service," Annals of Operations Research, Springer, vol. 236(1), pages 131-148, January.
  3. María I. Restrepo & Frédéric Semet & Thomas Pocreau, 2019. "Integrated Shift Scheduling and Load Assignment Optimization for Attended Home Delivery," Transportation Science, INFORMS, vol. 53(4), pages 1150-1174, July.
  4. Marlin W. Ulmer & Barrett W. Thomas & Dirk C. Mattfeld, 2019. "Preemptive depot returns for dynamic same-day delivery," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(4), pages 327-361, December.
  5. Barrett W. Thomas, 2007. "Waiting Strategies for Anticipating Service Requests from Known Customer Locations," Transportation Science, INFORMS, vol. 41(3), pages 319-331, August.
  6. Ann Melissa Campbell & Martin Savelsbergh, 2006. "Incentive Schemes for Attended Home Delivery Services," Transportation Science, INFORMS, vol. 40(3), pages 327-341, August.
  7. Farzaneh Karami & Wim Vancroonenburg & Greet Vanden Berghe, 2020. "A periodic optimization approach to dynamic pickup and delivery problems with time windows," Journal of Scheduling, Springer, vol. 23(6), pages 711-731, December.
  8. 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.
  9. M. Barkaoui & J. Berger & A. Boukhtouta, 2019. "An evolutionary approach for the target search problem in uncertain environment," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 808-835, October.
  10. Dessouky, Maged M. & Ordóñez, Fernando & Quadrifoglio, Luca, 2005. "Productivity and Cost-Effectiveness of Demand Responsive Transit Systems," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt9qj1d5s0, Institute of Transportation Studies, UC Berkeley.
  11. Anirudh Subramanyam & Frank Mufalli & José M. Lí?nez-Aguirre & Jose M. Pinto & Chrysanthos E. Gounaris, 2021. "Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty," Operations Research, INFORMS, vol. 69(1), pages 30-60, January.
  12. 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.
  13. Kai Gutenschwager & Christian Niklaus & Stefan Voß, 2004. "Dispatching of an Electric Monorail System: Applying Metaheuristics to an Online Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 38(4), pages 434-446, November.
  14. Allan Larsen & Oli B. G. Madsen & Marius M. Solomon, 2004. "The A Priori Dynamic Traveling Salesman Problem with Time Windows," Transportation Science, INFORMS, vol. 38(4), pages 459-472, November.
  15. Nielsen, Clara Chini & Pisinger, David, 2023. "Tactical planning for dynamic technician routing and scheduling problems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
  16. Hugo P. Simão & Jeff Day & Abraham P. George & Ted Gifford & John Nienow & Warren B. Powell, 2009. "An Approximate Dynamic Programming Algorithm for Large-Scale Fleet Management: A Case Application," Transportation Science, INFORMS, vol. 43(2), pages 178-197, May.
  17. Soumia Ichoua & Michel Gendreau & Jean-Yves Potvin, 2006. "Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching," Transportation Science, INFORMS, vol. 40(2), pages 211-225, May.
  18. Queiroz, Michell & Lucas, Flavien & Sörensen, Kenneth, 2024. "Instance generation tool for on-demand transportation problems," European Journal of Operational Research, Elsevier, vol. 317(3), pages 696-717.
  19. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).
  20. Wen, Jian & Nassir, Neema & Zhao, Jinhua, 2019. "Value of demand information in autonomous mobility-on-demand systems," Transportation Research Part A: Policy and Practice, Elsevier, vol. 121(C), pages 346-359.
  21. Ninja Soeffker & Marlin W. Ulmer & Dirk C. Mattfeld, 2019. "Adaptive State Space Partitioning for Dynamic Decision Processes," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 61(3), pages 261-275, June.
  22. Gianpaolo Ghiani & Emanuele Manni & Barrett W. Thomas, 2012. "A Comparison of Anticipatory Algorithms for the Dynamic and Stochastic Traveling Salesman Problem," Transportation Science, INFORMS, vol. 46(3), pages 374-387, August.
  23. Zhi-Long Chen & Hang Xu, 2006. "Dynamic Column Generation for Dynamic Vehicle Routing with Time Windows," Transportation Science, INFORMS, vol. 40(1), pages 74-88, February.
  24. Russell W. Bent & Pascal Van Hentenryck, 2004. "Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers," Operations Research, INFORMS, vol. 52(6), pages 977-987, December.
  25. 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.
  26. Marlin W. Ulmer & Justin C. Goodson & Dirk C. Mattfeld & Marco Hennig, 2019. "Offline–Online Approximate Dynamic Programming for Dynamic Vehicle Routing with Stochastic Requests," Service Science, INFORMS, vol. 53(1), pages 185-202, February.
  27. Zhang, Jian & Luo, Kelin & Florio, Alexandre M. & Van Woensel, Tom, 2023. "Solving large-scale dynamic vehicle routing problems with stochastic requests," European Journal of Operational Research, Elsevier, vol. 306(2), pages 596-614.
  28. Pascal Hentenryck & Russell Bent & Eli Upfal, 2010. "Online stochastic optimization under time constraints," Annals of Operations Research, Springer, vol. 177(1), pages 151-183, June.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.