Integrated Shift Scheduling and Load Assignment Optimization for Attended Home Delivery

References

• Agatz N, Campbell AM, Fleischmann M, Savelsbergh M (2008) Challenges and opportunities in attended home delivery. Golden B, Raghavan S, Wasil E, eds. The Vehicle Routing Problem: Latest Advances and New Challenges (Springer, Boston), 379–396.Crossref, Google Scholar
• Agatz N, Campbell AM, Fleischmann M, Savelsbergh M (2011) Time slot management in attended home delivery. Transportation Sci. 45(3):435–449.Link, Google Scholar
• Baldacci R, Toth P, Vigo D (2007) Recent advances in vehicle routing exact algorithms. 4OR 5(4):269–298.Crossref, 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
• Birge JR, Louveaux FV (1988) A multicut algorithm for two-stage stochastic linear programs. Eur. J. Oper. Res. 34(3):384–392.Crossref, Google Scholar
• Bruck B, Cordeau JF, Lori M (2018) A practical time slot management and routing problem for attended home services. Omega 81(December):208–219.Crossref, Google Scholar
• Campbell AM, Savelsbergh M (2006) Incentive schemes for attended home delivery services. Transportation Sci. 40(3):327–341.Link, Google Scholar
• Chang TS, Yen HM (2012) City-courier routing and scheduling problems. Eur. J. Oper. Res. 223(2):489–498.Crossref, Google Scholar
• Ehmke JF, Campbell AM (2014) Customer acceptance mechanisms for home deliveries in metropolitan areas. Eur. J. Oper. Res. 233(1):193–207.Crossref, Google Scholar
• Ghiani G, Manni E, Quaranta A (2010) Shift scheduling problem in same-day courier industry. Transportation Sci. 44(1):116–124.Link, Google Scholar
• Hernandez F, Gendreau M, Potvin JY (2017) Heuristics for time slot management: A periodic vehicle routing problem view. Internat. Trans. Oper. Res. 24(6):1233–1252.Crossref, Google Scholar
• Klein R, Neugebauer M, Ratkovitch D, Steinhardt C (2019) Differentiated time slot pricing under routing considerations in attended home delivery. Transportation Sci. 53(1):236–255.Link, Google Scholar
• Laporte G, Louveaux FV (1993) The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. 13(3):133–142.Crossref, Google Scholar
• Larsen A, Madsen O, Solomon M (2002) Partially dynamic vehicle routing-models and algorithms. J. Oper. Res. Soc. 53(6):637–646.Crossref, Google Scholar
• Lund K, Madsen O, Rygaard J (1996) Vehicle routing problems with varying degrees of dynamism. Technical report, Technical University of Denmark, Lyngby.Google Scholar
• McDaniel D, Devine M (1977) A modified Benders’ partitioning algorithm for mixed integer programming. Management Sci. 24(3):312–319.Link, 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
• Ritzinger U, Puchinger J, Hartl RF (2016) A survey on dynamic and stochastic vehicle routing problems. Internat. J. Production Res. 54(1):1–17.Crossref, Google Scholar
• Snežana MM, Krishnamurti R, Laporte G (2004) Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Transportation Res. Part B: Methodological 38(8):669–685.Crossref, 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
• Ulmer MW, Mattfeld DC, Köster F (2014) Anticipation of stochastic customer requests in vehicle routing: Value function approximation based on a dynamic lookup-table. Working paper, Technische Universität Braunschweig, Braunschweig, Germany.Google Scholar
• Ulmer MW, Mattfeld DC, Hennig M, Goodson JC (2016) A rollout algorithm for vehicle routing with stochastic customer requests. Logistics Management: Contributions of the Section Logistics of the German Academic Association for Business Research (Springer International Publishing, Basel, Switzerland), 217–227.Crossref, Google Scholar
• Van den Bergh J, Beliën J, De Bruecker P, Demeulemeester E, De Boeck L (2012) Personnel scheduling: A literature review. Eur. J. Oper. Res. 226(3):367–385.Crossref, Google Scholar
• Van Slyke RM, Wets R (1969) L-shaped linear programs with applications to optimal control and stochastic programming. SIAM J. Appl. Math. 17(4):638–663.Crossref, Google Scholar
• Wolsey LA, Nemhauser GL (2014) Integer and Combinatorial Optimization (John Wiley & Sons, Hoboken, NJ).Google Scholar
• Yan S, Lin JR, Lai CW (2013) The planning and real-time adjustment of courier routing and scheduling under stochastic travel times and demands. Transportation Res. Part E: Logist. Transportation Rev. 53(July):34–48.Crossref, Google Scholar
• Yang X, Strauss AK, Currie CS, Eglese R (2016) Choice-based demand management and vehicle routing in e-fulfillment. Transportation Sci. 50(2):473–488.Link, Google Scholar