Routing Optimization with Vehicle–Customer Coordination

References

• Agatz N, Erera AL, Savelsbergh MW, Wang X (2011) Dynamic ride-sharing: A simulation study in metro Atlanta. Procedia Soc. Behav. Sci. 17:532–550.Crossref, Google Scholar
• Alonso-Mora J, Samaranayake S, Wallar A, Frazzoli E, Rus D (2017) On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment. Proc. Natl. Acad. Sci. USA 114(3):462–467.Crossref, Google Scholar
• Alyasiry AM, Forbes M, Bulmer M (2019) An exact algorithm for the pickup and delivery problem with time windows and last-in-first-out loading. Transportation Sci. 53(6):1695–1705.Link, Google Scholar
• Baldacci R, Mingozzi A, Roberti R (2012) New state-space relaxations for solving the traveling salesman problem with time windows. INFORMS J. Comput. 24(3):356–371.Link, Google Scholar
• Balseiro SR, Brown DB, Chen C (2021) Dynamic pricing of relocating resources in large networks. Management Sci. 67(7):4075–4094.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
• Besbes O, Castro F, Lobel I (2021) Surge pricing and its spatial supply response. Management Sci. 67(3):1350–1367.Link, Google Scholar
• Bimpikis K, Candogan O, Saban D (2019) Spatial pricing in ride-sharing networks. Oper. Res. 67(3):744–769.Link, Google Scholar
• Boland N, Hewitt M, Marshall L, Savelsbergh M (2017) The continuous-time service network design problem. Oper. Res. 65(5):1303–1321.Link, Google Scholar
• Boland N, Savelsbergh M (2019) Perspectives on integer programming for time-dependent models. TOP 27(2):147–173.Crossref, Google Scholar
• Braverman A, Dai JG, Liu X, Ying L (2019) Empty-car routing in ridesharing systems. Oper. Res. 67(5):1437–1452.Link, Google Scholar
• Bubeck S, Lee YT, Li Y, Sellke M (2019) Competitively chasing convex bodies. Charikar M, Cohen E, eds. Proc. 51st Annual ACM SIGACT Sympos. Theory Comput. (Association for Computing Machinery, New York), 861–868.Google Scholar
• Carlsson JG, Song S (2017) Coordinated logistics with a truck and a drone. Management Sci. 64(9):4052–4069.Link, Google Scholar
• Chardaire P, McKeown GP, Verity-Harrison S, Richardson S (2005) Solving a time-space network formulation for the convoy movement problem. Oper. Res. 53(2):219–230.Link, Google Scholar
• Cordeau JF (2006) A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54(3):573–586.Link, Google Scholar
• Dabia S, Ropke S, van Woensel T, De Kok T (2013) Branch and price for the time-dependent vehicle routing problem with time windows. Transportation Sci. 47(3):380–396.Link, Google Scholar
• Dash S, Günlük O, Lodi A, Tramontani A (2012) A time bucket formulation for the traveling salesman problem with time windows. INFORMS J. Comput. 24(1):132–147.Link, Google Scholar
• Desaulniers G (2010) Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows. Oper. Res. 58(1):179–192.Link, Google Scholar
• Friedman J, Linial N (1993) On convex body chasing. Discrete Comput. Geometry 9(3):293–321.Crossref, Google Scholar
• Gambella C, Naoum-Sawaya J, Ghaddar B (2018) The vehicle routing problem with floating targets: Formulation and solution approaches. INFORMS J. Comput. 30(3):554–569.Link, Google Scholar
• Holland C, Levis J, Nuggehalli R, Santilli B, Winters J (2017) UPS optimizes delivery routes. Interfaces 47(1):8–23.Link, Google Scholar
• Hu B, Hu M, Zhu H (2022) Surge pricing and two-sided temporal responses in ride hailing. Manufacturing Service Oper. Management 24(1):91–109.Link, Google Scholar
• Liu Y, Jia R, Ye J, Qu X (2022) How machine learning informs ride-hailing services: A survey. Comm. Transportation Res. 2:100075.Crossref, Google Scholar
• Lyft (2022) Introducing shared saver, our most affordable ride. Accessed October 24, 2022, https://blog.lyft.com/posts/introducing-shared-saver.Google Scholar
• NYC Taxi & Limousine Commission (2022) TLC trip record data. Accessed October 24, 2022, https://www1.nyc.gov/site/tlc/about/tlc-trip-record-data.page.Google Scholar
• OpenStreetMap (2022) Planet OSM. Accessed October 24, 2022, https://www.openstreetmap.org.Google Scholar
• Ozbaygin G, Karasan OE, Savelsbergh M, Yaman H (2017) A branch-and-price algorithm for the vehicle routing problem with roaming delivery locations. Transportation Res. Part B Methodological 100:115–137.Crossref, Google Scholar
• Özkan E, Ward AR (2020) Dynamic matching for real-time ride sharing. Stochastic Systems 10(1):29–70.Link, Google Scholar
• Poikonen S, Golden B (2020) The mothership and drone routing problem. INFORMS J. Comput. 32(2):249–262.Link, 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
• Santi P, Resta G, Szell M, Sobolevsky S, Strogatz SH, Ratti C (2014) Quantifying the benefits of vehicle pooling with shareability networks. Proc. Natl. Acad. Sci. USA 111(37):13290–13294.Crossref, Google Scholar
• Savelsbergh MW, Sol M (1995) The general pickup and delivery problem. Transportation Sci. 29(1):17–29.Link, Google Scholar
• Stieber A, Fügenschuh A, Epp M, Knapp M, Rothe H (2015) The multiple traveling salesmen problem with moving targets. Optim. Lett. 9(8):1569–1583.Crossref, Google Scholar
• Uber (2022) Express pool: Walk a little, save a lot with Uber’s most affordable option. Accessed October 24, 2022, https://www.uber.com/us/en/ride/express-pool/.Google Scholar
• Vazifeh MM, Santi P, Resta G, Strogatz SH, Ratti C (2018) Addressing the minimum fleet problem in on-demand urban mobility. Nature 557(7706):534–538.Crossref, Google Scholar
• Wei S, Feng S, Ke J, Yang H (2022) Calibration and validation of matching functions for ride-sourcing markets. Comm. Transportation Res. 2:100058.Crossref, Google Scholar
• Xia J, Wang K, Wang S (2019) Drone scheduling to monitor vessels in emission control areas. Transportation Res. Part B Methodological 119:174–196.Crossref, Google Scholar
• Yan C, Zhu H, Korolko N, Woodard D (2020) Dynamic pricing and matching in ride-hailing platforms. Naval Res. Logist. 67(8):705–724.Crossref, Google Scholar