Budgeting Time for Dynamic Vehicle Routing with Stochastic Customer Requests

References

• Angelelli E, Bianchessi N, Mansini R, Speranza MG (2009) Short term strategies for a dynamic multi-period routing problem. Transportation Res. Part C: Emerging Tech. 17(2):106–119.Crossref, Google Scholar
• Barto AG (1998) Reinforcement Learning: An Introduction (MIT Press, Cambridge, MA).Google Scholar
• Bent RW, Van Hentenryck P (2003) Dynamic vehicle routing with stochastic requests. Proc. 18th Internat. Joint Conf. Artificial Intelligence (Morgan Kaufmann, San Francisco), 1362–1363.Google Scholar
• Bent RW, Van Hentenryck P (2004) Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Oper. Res. 52(6):977–987.Link, Google Scholar
• Bertsekas DP, Castañon DA (1989) Adaptive aggregation methods for infinite horizon dynamic programming. IEEE Trans. Automatic Control 34(6):589–598.Crossref, Google Scholar
• Bertsimas DJ, Van Ryzin G (1991) A stochastic and dynamic vehicle routing problem in the Euclidean plane. Oper. Res. 39(4):601–615.Link, Google Scholar
• Branke J, Middendorf M, Noeth G, Dessouky M (2005) Waiting strategies for dynamic vehicle routing. Transportation Sci. 39(3):298–312.Link, Google Scholar
• Campbell AM (2006) Aggregation for the probabilistic traveling salesman problem. Comput. Oper. Res. 33(9):2703–2724.Crossref, Google Scholar
• Clausen C, Wechsler H (2000) Quad-q-learning. IEEE Trans. Neural Networks 11(2):279–294.Crossref, Google Scholar
• Daganzo CF (1984) Checkpoint dial-a-ride systems. Transportation Res. Part B: Methodological 18(4):315–327.Crossref, Google Scholar
• Dennis WT (2011) Parcel and Small Package Delivery Industry (Createspace, North Charleston, SC).Google Scholar
• Ehmke JF (2012) Integration of Information and Optimization Models for Routing in City Logistics, Internat. Series Oper. Res. Management Sci., Vol. 177 (Springer, New York).Crossref, Google Scholar
• Ehmke JF, Campbell AM, Urban TL (2015) Ensuring service levels in routing problems with time windows and stochastic travel times. Eur. J. Oper. Res. 240(2):539–550.Crossref, Google Scholar
• Esser K, Kurte J (2015) KEP 2015. Marktanalyse, Bundesverband Paket und Expresslogistik e.V. BIEK, Berlin.Google Scholar
• Finkel RA, Bentley JL (1974) Quad trees: A data structure for retrieval on composite keys. Acta Informatica 4(1):1–9.Crossref, Google Scholar
• Flatberg T, Hasle G, Kloster O, Nilssen EJ, Riise A (2007) Dynamic and stochastic vehicle routing in practice. Zeimpekis V, Tarantilis CD, Giaglis GM, Minis I, eds. Dynamic Fleet Management, Oper. Res./Comput. Sci. Interfaces Series, Vol. 38 (Springer, New York), 41–63.Crossref, Google Scholar
• Gendreau M, Guertin F, Potvin JY, Séguin R (2006) Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Transportation Res. Part C: Emerging Tech. 14(3):157–174.Crossref, Google Scholar
• Gendreau M, Guertin F, Potvin JY, Taillard E (1999) Parallel tabu search for real-time vehicle routing and dispatching. Transportation Sci. 33(4):381–390.Link, Google Scholar
• George A, Powell WB, Kulkarni SR, Mahadevan S (2008) Value function approximation using multiple aggregation for multiattribute resource management. J. Machine Learn. Res. 9(10):2079–2111.Google Scholar
• Ghiani G, Manni E, Thomas BW (2012) A comparison of anticipatory algorithms for the dynamic and stochastic traveling salesman problem. Transportation Sci. 46(3):374–387.Link, Google Scholar
• Ghiani G, Manni E, Quaranta A, Triki C (2009) Anticipatory algorithms for same-day courier dispatching. Transportation Res. Part E: Logist. Transportation Rev. 45(1):96–106.Crossref, Google Scholar
• Goodson JC, Ohlmann JW, Thomas BW (2013) Rollout policies for dynamic solutions to the multivehicle routing problem with stochastic demand and duration limits. Oper. Res. 61(1):138–154.Link, Google Scholar
• Hvattum LM, Løkketangen A, Laporte G (2006) Solving a dynamic and stochastic vehicle routing problem with a sample scenario hedging heuristic. Transportation Sci. 40(4):421–438.Link, Google Scholar
• Ichoua S, Gendreau M, Potvin JY (2000) Diversion issues in real-time vehicle dispatching. Transportation Sci. 34(4):426–438.Link, Google Scholar
• Ichoua S, Gendreau M, Potvin JY (2006) Exploiting knowledge about future demands for real-time vehicle dispatching. Transportation Sci. 40(2):211–225.Link, Google Scholar
• Kall P, Wallace SW (1994) Stochastic Programming (John Wiley & Sons, New York).Google Scholar
• Larsen A, Madsen OBG, Solomon MM (2002) Partially dynamic vehicle routing–models and algorithms. J. Oper. Res. Soc. 53(6):637–646.Crossref, Google Scholar
• Lecluyse C, Van Woensel T, Peremans H (2009) Vehicle routing with stochastic time-dependent travel times. 4OR 7(4):363–377.Crossref, Google Scholar
• Lin ETJ, Lan LW, Hsu CST (2010) Assessing the on-road route efficiency for an air-express courier. J. Advanced Transportation 44(4):256–266.Crossref, Google Scholar
• Lowe J, Khan AA, Bhatale B (2014) Same-day delivery: Surviving and thriving in a world where instant gratification rules. White paper 20–20, Cognizant, Teaneck, NJ.Google Scholar
• Meisel S (2011) Anticipatory Optimization for Dynamic Decision Making, Oper. Res./Comput. Sci. Interfaces Series, Vol. 51 (Springer, New York).Crossref, Google Scholar
• Mitrović-Minić S, Laporte G (2004) Waiting strategies for the dynamic pickup and delivery problem with time windows. Transportation Res. Part B: Methodological 38(7):635–655.Crossref, Google Scholar
• Novoa C, Storer R (2009) An approximate dynamic programming approach for the vehicle routing problem with stochastic demands. Eur. J. Oper. Res. 196(2):509–515.Crossref, Google Scholar
• 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.Crossref, Google Scholar
• Powell WB (2011) Approximate Dynamic Programming: Solving the Curses of Dimensionality, Wiley Series Probab. Statist., Vol. 842 (John Wiley & Sons, Hoboken, NJ).Crossref, Google Scholar
• Powell WB, Ryzhov IO (2012) Optimal Learning, Wiley Series Probab. Statist., Vol. 841 (John Wiley & Sons, Hoboken, NJ).Crossref, Google Scholar
• Psaraftis HN (1980) A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transportation Sci. 14(2):130–154.Link, Google Scholar
• Puterman ML (2014) Markov Decision Processes: Discrete Stochastic Dynamic Programming (John Wiley & Sons, Hoboken, NJ).Google Scholar
• Ritzinger U, Puchinger J, Hartl RF (2015) A survey on dynamic and stochastic vehicle routing problems. Internat. J. Production Res. 54(1):215–231.Crossref, Google Scholar
• Rosenkrantz DJ, Stearns RE, Lewis PM (1974) Approximate algorithms for the traveling salesperson problem. Proc. IEEE 15th Annual Sympos. Switching Automata Theory, 33–42.Crossref, Google Scholar
• Secomandi N (2000) Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands. Comput. Oper. Res. 27(11):1201–1225.Crossref, Google Scholar
• Soeffker N, Ulmer MW, Mattfeld DC (2016) Problem-specific state space partitioning for dynamic vehicle routing problems. Nissen V, Stelzer D, Straßburger S, eds. Proc. MKWI (TU Ilmenau, Ilmenau, Germany), 229–240.Google Scholar
• Sungur I, Ren Y, Ordóñez F, Dessouky M, Zhong H (2010) A model and algorithm for the courier delivery problem with uncertainty. Transportation Sci. 44(2):193–205.Link, Google Scholar
• Swihart MR, Papastavrou JD (1999) A stochastic and dynamic model for the single-vehicle pick-up and delivery problem. Eur. J. Oper. Res. 114(3):447–464.Crossref, Google Scholar
• Tassiulas L (1996) Adaptive routing on the plane. Oper. Res. 44(5):823–832.Link, Google Scholar
• Thomas BW (2007) Waiting strategies for anticipating service requests from known customer locations. Transportation Sci. 41(3):319–331.Link, Google Scholar
• Thomas BW, White CC III (2004) Anticipatory route selection. Transportation Sci. 38(4):473–487.Link, Google Scholar
• Thomas BW, White CC III (2007) The dynamic shortest path problem with anticipation. Eur. J. Oper. Res. 176(2):836–854.Crossref, Google Scholar
• Ulmer MW, Mattfeld DC (2013) Modeling customers in the Euclidean plane for routing applications. Fink H, Geiger MJ, eds. Proc. 14th EU/ME Workshop (Helmut Schmidt Universität, Hamburg, Germany), 98–103.Google Scholar
• Ulmer MW, Brinkmann J, Mattfeld DC (2015) Anticipatory planning for courier, express and parcel services. Dethloff J, Haasis HD, Kopfer H, Kotzab H, Schönberger J, eds. Logistics Management, Lecture Notes Logist. (Springer International Publishing, Switzerland), 313–324.Crossref, Google Scholar
• Ulmer MW, Mattfeld DC, Soeffker N (2016) Dynamic multi-period vehicle routing: Approximate value iteration based on dynamic lookup tables. Technical report, Technische Universität Braunschweig, Braunschweig, Germany.Google Scholar
• Van Hemert JI, La Poutré JA (2004) Dynamic routing problems with fruitful regions: Models and evolutionary computation. Yao X, Burke EK, Lozano JA, Smith J, Merelo-Guervós JJ, Bullinaria JA, Rowe JE, Tino P, Kabán A, Schwefel HP, eds. Parallel Problem Solving from Nature–PPSN VIII, Lecture Notes Comput. Sci., Vol. 3242 (Springer-Verlag, Berlin Heidelberg), 692–701.Crossref, Google Scholar