Integrated Vehicle Routing and Service Scheduling Under Time and Cancellation Uncertainties with Application in Nonemergency Medical Transportation

References

• Allaoua H, Borne S, Létocart L, Calvo RW (2013) A matheuristic approach for solving a home health care problem. Electronic Notes Discrete Math. 41:471–478.Crossref, Google Scholar
• Bard JF, Shao Y, Qi X, Jarrah AI (2014) The traveling therapist scheduling problem. IIE Trans. 46(7):683–706.Crossref, Google Scholar
• Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4(1):238–252.Crossref, Google Scholar
• Bennett AR, Erera AL (2011) Dynamic periodic fixed appointment scheduling for home health. IIE Trans. Healthcare Systems Engrg. 1(1):6–19.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
• Bent RW, Van Hentenryck P (2007) Waiting and relocation strategies in online stochastic vehicle routing. Internat. Joint Conf. Artificial Intelligence 7:1816–1821.Google Scholar
• Berbeglia G, Cordeau J-F, Laporte G (2010) Dynamic pickup and delivery problems. Eur. J. Oper. Res. 202(1):8–15.Crossref, Google Scholar
• Berbeglia G, Cordeau J-F, Laporte G (2012) A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem. INFORMS J. Comput. 24(3):343–355.Link, Google Scholar
• Berg BP, Denton BT, Erdogan SA, Rohleder T, Huschka T (2014) Optimal booking and scheduling in outpatient procedure centers. Comput. Oper. Res. 50:24–37.Crossref, Google Scholar
• Bertsimas DJ, Simchi-Levi D (1996) A new generation of vehicle routing research: Robust algorithms, addressing uncertainty. Oper. Res. 44(2):286–304.Link, 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
• Bertsimas DJ, Van Ryzin G (1993) Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles. Oper. Res. 41(1):60–76.Link, Google Scholar
• Bertsimas D, Jaillet P, Martin S (2019) Online vehicle routing: The edge of optimization in large-scale applications. Oper. Res. 67(1):143–162.Link, Google Scholar
• Bräysy O, Gendreau M (2005a) Vehicle routing problem with time windows, Part I: Route construction and local search algorithms. Transportation Sci. 39(1):104–118.Link, Google Scholar
• Bräysy O, Gendreau M (2005b) Vehicle routing problem with time windows, Part II: Metaheuristics. Transportation Sci. 39(1):119–139.Link, Google Scholar
• Bryant M (2019) Ford enters NEMT space with national rollout of GoRide Health. HealthCareDrive (May 9), https://www.healthcaredive.com/news/ford-enters-nemt-space-with-national-rollout-of-goride-health/554413/.Google Scholar
• Cappanera P, Scutellà MG (2015) Joint assignment, scheduling, and routing models to home care optimization: A pattern-based approach. Transportation Sci. 49(4):830–852.Link, Google Scholar
• Carello G, Lanzarone E (2014) A cardinality-constrained robust model for the assignment problem in home care services. Eur. J. Oper. Res. 236(2):748–762.Crossref, Google Scholar
• Centers for Disease Control and Prevention (2020) People who are at higher risk for severe illness. Accessed August 11, 2021, https://www.cdc.gov/coronavirus/2019-ncov/need-extra-precautions/people-with-medical-conditions.html.Google Scholar
• Cömert SE, Yazgan HR, Sertvuran I, Şengül H (2017) A new approach for solution of vehicle routing problem with hard time window: An application in a supermarket chain. Sadhana 42(12):2067–2080.Crossref, Google Scholar
• Cordeau J-F, Laporte G (2007) The dial-a-ride problem: Models and algorithms. Ann. Oper. Res. 153(1):29–46.Crossref, Google Scholar
• Deng Y, Shen S (2016) Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints. Math. Programming 157(1):245–276.Crossref, Google Scholar
• Denton B, Gupta D (2003) A sequential bounding approach for optimal appointment scheduling. IIE Trans. 35(11):1003–1016.Crossref, Google Scholar
• Desrochers M, Desrosiers J, Solomon M (1992) A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40(2):342–354.Link, Google Scholar
• Dickey MR (2018). Ford launches on-demand medical transportation service. TechCrunch (April 18), https://techcrunch.com/2018/04/18/ford-launches-on-demand-medical-transportation-service/.Google Scholar
• Dror M, Laporte G, Trudeau P (1989) Vehicle routing with stochastic demands: Properties and solution frameworks. Transportation Sci. 23(3):166–176.Link, Google Scholar
• Erdogan SA, Denton B (2013) Dynamic appointment scheduling of a stochastic server with uncertain demand. INFORMS J. Comput. 25(1):116–132.Link, Google Scholar
• Fikar C, Hirsch P (2017) Home healthcare routing and scheduling: A review. Comput. Oper. Res. 77:86–95.Crossref, Google Scholar
• Fukasawa R, Longo H, Lysgaard J, De Aragão MP, Reis M, Uchoa E, Werneck RF (2006) Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Programming 106(3):491–511.Crossref, Google Scholar
• Gupta D, Denton B (2008) Appointment scheduling in healthcare: Challenges and opportunities. IIE Trans. 40(9):800–819.Crossref, Google Scholar
• Heching A, Hooker JN, Kimura R (2019) A logic-based Benders approach to home healthcare delivery. Transportation Sci. 53(2):510–522.Link, Google Scholar
• Jain AK (2010) Data clustering: 50 years beyond K-means. Pattern Recognition Lett. 31(8):651–666.Crossref, Google Scholar
• Jiang R, Shen S, Zhang Y (2017) Integer programming approaches for appointment scheduling with random no-shows and service durations. Oper. Res. 65(6):1638–1656.Link, Google Scholar
• Kleywegt AJ, Shapiro A, Homem-de Mello T (2002) The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2):479–502.Crossref, Google Scholar
• Lanzarone E, Matta A (2014) Robust nurse-to-patient assignment in home care services to minimize overtimes under continuity of care. Oper. Res. Health Care 3(2):48–58.Crossref, Google Scholar
• Laporte G (1992) The vehicle routing problem: An overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(3):345–358.Crossref, Google Scholar
• Laporte G (2007) What you should know about the vehicle routing problem. Naval Res. Logist. 54(8):811–819.Crossref, Google Scholar
• Moon TK (1996) The expectation-maximization algorithm. IEEE Signal Processing Magazine 13(6):47–60.Crossref, Google Scholar
• Nickel S, Schröder M, Steeg J (2012) Mid-term and short-term planning support for home healthcare services. Eur. J. Oper. Res. 219(3):574–587.Crossref, Google Scholar
• Parragh SN, Doerner KF, Hartl RF (2008) A survey on pickup and delivery problems. J. für Betriebswirtschaft. 58(1):21–51.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
• Pinedo M (2012) Scheduling: Theory, Algorithms, and Systems, vol. 5 (Springer-Verlag, New York).Crossref, Google Scholar
• Powell WB (1996) A stochastic formulation of the dynamic assignment problem, with an application to truckload motor carriers. Transportation Sci. 30(3):195–219.Link, Google Scholar
• Powell WB, Towns MT, Marar A (2000) On the value of optimal myopic solutions for dynamic routing and scheduling problems in the presence of user noncompliance. Transportation Sci. 34(1):67–85.Link, Google Scholar
• Ralphs TK, Kopman L, Pulleyblank WR, Trotter LE (2003) On the capacitated vehicle routing problem. Math. Programming 94(2-3):343–359.Crossref, Google Scholar
• Rasmussen MS, Justesen T, Dohn A, Larsen J (2012) The home care crew scheduling problem: Preference-based visit clustering and temporal dependencies. Eur. J. Oper. Res. 219(3):598–610.Crossref, Google Scholar
• Savelsbergh MW, Sol M (1995) The general pickup and delivery problem. Transportation Sci. 29(1):17–29.Link, Google Scholar
• Simao HP, Day J, George AP, Gifford T, Nienow J, Powell WB (2009) An approximate dynamic programming algorithm for large-scale fleet management: A case application. Transportation Sci. 43(2):178–197.Link, Google Scholar
• Toth P, Vigo D (2002) Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discrete Appl. Math. 123(1-3):487–512.Crossref, Google Scholar
• U.S. Census Bureau (2010) QuickFacts data table on U.S. census website. Accessed August 11, 2021, https://www.census.gov/quickfacts/fact/table/MI/PST045219#.Google Scholar
• Yuan B, Liu R, Jiang Z (2015) A branch-and-price algorithm for the home healthcare scheduling and routing problem with stochastic service times and skill requirements. Internat. J. Production Res. 53(24):7450–7464.Crossref, Google Scholar
• Zacharias C, Pinedo M (2014) Appointment scheduling with no-shows and overbooking. Production Oper. Management 23(5):788–801.Crossref, Google Scholar
• Zhan Y, Wan G (2018) Vehicle routing and appointment scheduling with team assignment for home services. Comput. Oper. Res. 100:1–11.Crossref, Google Scholar
• Zhan Y, Wang Z, Wan G (2021) Home service routing and appointment scheduling with stochastic service times. Eur. J. Oper. Res. 288(1):98–110.Crossref, Google Scholar