Agussurja L, Cheng SF, Lau HC (2019) A state aggregation approach for stochastic multiperiod last-mile ride-sharing problems. Transp Sci 53(1):148–166.
- Angelelli E, Archetti C, Filippi C, Vindigni M (2021) A dynamic and probabilistic orienteering problem. Comput Oper Res 136:105454.
Paper not yet in RePEc: Add citation now
- Angelelli E, Bianchessi N, Mansini R, Speranza MG (2009) Short term strategies for a dynamic multi-period routing problem. Transp Res Part C Emerg Technol 17(2):106–119.
Paper not yet in RePEc: Add citation now
- Attanasio A, Cordeau JF, Ghiani G, Laporte G (2004) Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Comput 30(3):377–387.
Paper not yet in RePEc: Add citation now
Azi N, Gendreau M, Potvin JY (2012) A dynamic vehicle routing problem with multiple delivery routes. Ann Oper Res 199(1):103–112.
- Barto AG (1998) Reinforcement learning: an introduction. MIT Press.
Paper not yet in RePEc: Add citation now
Basso R, Kulcsár B, Sanchez-Diaz I, Qu X (2022) Dynamic stochastic electric vehicle routing with safe reinforcement learning. Transp Res Part E Logist Transp Rev 157:102496.
- Bellman R (1957) Dynamic programming, 1st edn. Princeton University Press, Princeton, NJ, USA.
Paper not yet in RePEc: Add citation now
- Bent R, Van Hentenryck P (2007) Waiting and relocation strategies in online stochastic vehicle routing. In: IJCAI, pp 1816–1821.
Paper not yet in RePEc: Add citation now
Bent RW, Van Hentenryck P (2004) Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Oper Res 52(6):977–987.
- Bozanta A, Cevik M, Kavaklioglu C, Kavuk EM, Tosun A, Sonuc SB, Duranel A, Basar A (2022) Courier routing and assignment for food delivery service using reinforcement learning. Comput Ind Eng 164:107871.
Paper not yet in RePEc: Add citation now
Chen X, Ulmer MW, Thomas BW (2022) Deep q-learning for same-day delivery with vehicles and drones. Eur J Oper Res 298(3):939–952.
Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568–581.
Fleckenstein D, Klein R, Steinhardt C (2023) Recent advances in integrating demand management and vehicle routing: a methodological review. Eur J Oper Res 306(2):499–518.
Gendreau M, Guertin F, Potvin JY, Taillard E (1999) Parallel tabu search for real-time vehicle routing and dispatching. Transp Sci 33(4):381–390.
Ghiani G, Manni E, Thomas BW (2012) A comparison of anticipatory algorithms for the dynamic and stochastic traveling salesman problem. Transp Sci 46(3):374–387.
- Giménez-Palacios I, Parreño F, Álvarez-Valdés R, Paquay C, Oliveira BB, Carravilla MA, Oliveira JF (2022) First-mile logistics parcel pickup: vehicle routing with packing constraints under disruption. Transp Res Part E Logist Transp Rev 164:102812.
Paper not yet in RePEc: Add citation now
- Hanshar FT, Ombuki-Berman BM (2007) Dynamic vehicle routing using genetic algorithms. Appl Intell 27(1):89–99.
Paper not yet in RePEc: Add citation now
Ichoua S, Gendreau M, Potvin JY (2000) Diversion issues in real-time vehicle dispatching. Transp Sci 34(4):426–438.
Ichoua S, Gendreau M, Potvin JY (2006) Exploiting knowledge about future demands for real-time vehicle dispatching. Transp Sci 40(2):211–225.
- Ikonen E, Selek I, Najim K (2016) Process control using finite Markov chains with iterative clustering. Comput Chem Eng 93:293–308.
Paper not yet in RePEc: Add citation now
- Kaufman L, Rousseeuw PJ (1987) Clustering by means of medoids. In: Dodge Y (ed) First international conference on statistical data analysis based on the L1-norm and related methods.
Paper not yet in RePEc: Add citation now
- Kilby P, Prosser P, Shaw P (1998) Dynamic VRPS: a study of scenarios. University of Strathclyde Technical Report 1(11).
Paper not yet in RePEc: Add citation now
- Klapp MA, Erera AL, Toriello A (2018) The one-dimensional dynamic dispatch waves problem. Transp Sci 52(2):402–415.
Paper not yet in RePEc: Add citation now
Klein V, Steinhardt C (2023) Dynamic demand management and online tour planning for same-day delivery. Eur J Oper Res 307(2):860–886.
Larsen A, Madsen OB, Solomon MM (2002) Partially dynamic vehicle routing-models and algorithms. J Oper Res Soc 53(6):637–646.
- Lee IS, Lau HY (2004) Adaptive state space partitioning for reinforcement learning. Eng Appl Artif Intell 17(6):577–588.
Paper not yet in RePEc: Add citation now
Montemanni R, Gambardella LM, Rizzoli AE, Donati AV (2005) Ant colony system for a dynamic vehicle routing problem. J Comb Optim 10(4):327–343.
Pillac V, Gendreau M, Guéret C, Medaglia AL (2013) A review of dynamic vehicle routing problems. Eur J Oper Res 225(1):1–11.
- Powell WB (2011) Approximate dynamic programming: solving the curses of dimensionality, Wiley series in probability and statistics, vol 842. Wiley, New York.
Paper not yet in RePEc: Add citation now
- Psaraftis HN, Wen M, Kontovas CA (2016) Dynamic vehicle routing problems: three decades and counting. Networks 67(1):3–31.
Paper not yet in RePEc: Add citation now
Ritzinger U, Puchinger J, Hartl RF (2016) A survey on dynamic and stochastic vehicle routing problems. Int J Prod Res 54(1):215–231.
- Rosenkrantz DJ, Stearns RE, Lewis PM (1974) Approximate algorithms for the traveling salesperson problem. In: switching and automata theory, 1974., IEEE conference record of 15th annual symposium on, IEEE, pp 33–42.
Paper not yet in RePEc: Add citation now
- Soeffker N, Ulmer MW, Mattfeld DC (2017) On fairness aspects of customer acceptance mechanisms in dynamic vehicle routing. In: Large RO, Kramer N, Radig AK, Schäfer M, Sulzbach A (eds) Proceedings of Logistikmanagement 2017, pp 17–24.
Paper not yet in RePEc: Add citation now
Soeffker N, Ulmer MW, Mattfeld DC (2019) Adaptive state space partitioning for dynamic decision processes. Bus Inf Syst Eng 61(3):261–275.
Soeffker N, Ulmer MW, Mattfeld DC (2022) Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review. Eur J Oper Res 298(3):801–820.
Thomas BW (2007) Waiting strategies for anticipating service requests from known customer locations. Transp Sci 41(3):319–331.
Ulmer MW, Mattfeld DC, Köster F (2018) Budgeting time for dynamic vehicle routing with stochastic customer requests. Transp Sci 52(1):20–37.
Ulmer MW, Soeffker N, Mattfeld DC (2018) Value function approximation for dynamic multi-period vehicle routing. Eur J Oper Res 269(3):883–899.
- United Parcel Service of America, Inc (2018) UPS Pulse of the Online Shopper™ Study - Global Study Executive Summary. https://www.ups.com/assets/resources/media/knowledge-center/ups-pulse-of-the-online-shopper.PDF , [Online; accessed 16-December-2021].
Paper not yet in RePEc: Add citation now
Voccia SA, Campbell AM, Thomas BW (2019) The same-day delivery problem for online purchases. Transp Sci 53(1):167–184.
Zhang J, Luo K, Florio AM, Van Woensel T (2023) Solving large-scale dynamic vehicle routing problems with stochastic requests. Eur J Oper Res 306(2):596–614.