Capturing Travel Mode Adoption in Designing On-Demand Multimodal Transit Systems

References

• Agatz N, Hewitt M, Thomas BW (2020) “Make no little plans”: Impactful research to solve the next generation of transportation problems. Networks 77(2):269–286.Crossref, Google Scholar
• Alumur S, Kara B, Karasan O (2012) Multimodal hub location and hub network design. Omega 40(6):927–939.Crossref, Google Scholar
• Basciftci B, Van Hentenryck P (2020) Bilevel optimization for on-demand multimodal transit systems. Hebrard E, Musliu N, eds. Integration of Constraint Programming, Artificial Intelligence, and Operations Research (Springer International Publishing, Cham, Switzerland), 52–68.Crossref, Google Scholar
• Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4:238–252.Crossref, Google Scholar
• Bianco L, Caramia M, Giordani S (2009) A bilevel flow model for hazmat transportation network design. Transportation Res. Part C: Emerging Tech. 17(2):175–196.Crossref, Google Scholar
• Borndörfer R, Grötschel M, Pfetsch M (2007) A column-generation approach to line planning in public transport. Transportation Sci. 41(1):123–132.Link, Google Scholar
• Brotcorne L, Labbé M, Marcotte P, Savard G (2001) A bilevel model for toll optimization on a multicommodity transportation network. Transportation Sci. 35(4):345–358.Link, Google Scholar
• Brotcorne L, Labbé M, Marcotte P, Savard G (2008) Joint design and pricing on a network. Oper. Res. 56(5):1104–1115.Link, Google Scholar
• Bucarey V, Fortz B, González-Blanco N, Labbé M, Mesa JA (2022) Benders decomposition for network design covering problems. 137:105417.Google Scholar
• Campbell A, Van Woensel T (2019) Special issue on recent advances in urban transport and logistics through optimization and analytics. Transportation Sci. 53(1):1–5.Link, Google Scholar
• Campbell J, Ernst A, Krishnamoorthy M (2005a) Hub arc location problems: Part ii—Formulations and optimal algorithms. Management Sci. 51(10):1556–1571.Link, Google Scholar
• Campbell J, Ernst A, Krishnamoorthy M (2005b) Hub arc location problems: Part i—Introduction and results. Management Sci. 51(10):1540–1555.Link, Google Scholar
• Cancela H, Mauttone A, Urquhart M (2015) Mathematical programming formulations for transit network design. Transportation Res. Part B: Methodological 77:17–37.Crossref, Google Scholar
• Chowdhury S, Ceder AA (2016) Users’ willingness to ride an integrated public-transport service: A literature review. Transport Policy 48:183–195.Crossref, Google Scholar
• Colson B, Marcotte P, Savard G (2005) Bilevel programming: A survey. 4OR 3(2):87–107.Crossref, Google Scholar
• Colson B, Marcotte P, Savard G (2007) An overview of bilevel optimization. Ann. Oper. Res. 153:235–256.Crossref, Google Scholar
• Correa JR, Stier-Moses NE (2010) Wardrop equilibria. Cochran JJ, ed. Wiley Encyclopedia of Operations Research and Management Science (John Wiley & Sons, Hoboken, NJ), 1–12.Google Scholar
• Curtin K, Biba S (2011) The transit route arc-node service maximization problem. Eur. J. Oper. Res. 208(1):46–56.Crossref, Google Scholar
• Dalmeijer K, Van Hentenryck P (2020) Transfer-expanded graphs for on-demand multimodal transit systems. Hebrard E, Musliu N, eds. Integration of Constraint Programming, Artificial Intelligence, and Operations Research (Springer International Publishing, Cham, Switzerland), 167–175.Crossref, Google Scholar
• Farahani R, Hekmatfar M, Arabani A, Nikbakhsh E (2013a) Hub location problems: A review of models, classification, solution techniques, and applications. Comput. Indust. Engrg. 64(4):1096–1109.Crossref, Google Scholar
• Farahani R, Miandoabchi E, Szeto W, Rashidi H (2013b) A review of urban transportation network design problems. Eur. J. Oper. Res. 229(2):281–302.Crossref, Google Scholar
• Fontaine P, Minner S (2014) Benders decomposition for discrete-continuous linear bilevel problems with application to traffic network design. Transportation Res. Part B: Methodological 70:163–172.Crossref, Google Scholar
• Gao Z, Wu J, Sun H (2005) Solution algorithm for the bi-level discrete network design problem. Transportation Res. Part B: Methodological 39(6):479–495.Crossref, Google Scholar
• García-Archilla B, Lozano A, Mesa J, Perea F (2013) Grasp algorithms for the robust railway network design problem. J. Heuristics 19:399–422.Crossref, Google Scholar
• Guan J, Yang H, Wirasinghe S (2006) Simultaneous optimization of transit line configuration and passenger line assignment. Transportation Res. Part B: Methodological 40(10):885–902.Crossref, Google Scholar
• Gutiérrez-Jarpa G, Obreque C, Laporte G, Marianov V (2013) Rapid transit network design for optimal cost and origin-destination demand capture. Comput. Oper. Res. 40(12):3000–3009.Crossref, Google Scholar
• Hooker JN (2002) Logic, optimization, and constraint programming. INFORMS J. Comput. 14(4):295–321.Link, Google Scholar
• Hooker JN (2007) Planning and scheduling by logic-based Benders decomposition. Oper. Res. 55(3):588–602.Link, Google Scholar
• Hooker J, Ottosson G (2003) Logic-based Benders decomposition. Math. Programming 96:33–60.Crossref, Google Scholar
• Kalashnikov V, Maldonado H, Camacho-Vallejo R, Kalashnykova N (2016) A heuristic algorithm solving bilevel toll optimization problems. Internat. J. Logist. Management 27(1):31–51.Crossref, Google Scholar
• Labbé M, Marcotte P, Savard G (1998) A bilevel model of taxation and its application to optimal highway pricing. Management Sci. 44(12-part-1):1608–1622.Link, Google Scholar
• Laporte G, Marín A, Mesa J, Ortega F (2007) An integrated methodology for the rapid transit network design problem. Geraets F, Kroon L, Schoebel A, Wagner D, Zaroliagis CD, eds. Algorithmic Methods for Railway Optimization (Springer, Berlin), 187–199.Crossref, Google Scholar
• Laporte G, Marín A, Mesa J, Perea F (2011a) Designing robust rapid transit networks with alternative routes. J. Advanced Transportation 45(1):54–65.Crossref, Google Scholar
• Laporte G, Mesa J, Ortega F, Perea F (2011b) Planning rapid transit networks. Socio-Econom. Planning Sci. 45(3):95–104.Crossref, Google Scholar
• Laporte G, Mesa J, Ortega F, Sevillano I (2005) Maximizing trip coverage in the location of a single rapid transit alignment. Ann. Oper. Res. 136:49–63.Crossref, Google Scholar
• LeBlanc L, Boyce D (1986) A bilevel programming algorithm for exact solution of the network design problem with user-optimal flows. Transportation Res. Part B: Methodological 20(3):259–265.Crossref, Google Scholar
• Magnanti T, Wong R (1981) Accelerating Benders decomposition: Algorithmic enhancement and model selection criteria. Oper. Res. 29(3):464–484.Link, Google Scholar
• Mahéo A, Kilby P, Van Hentenryck P (2019) Benders decomposition for the design of a hub and shuttle public transit system. Transportation Sci. 53(1):77–88.Link, Google Scholar
• Marín A, García-Ródenas R (2009) Location of infrastructure in urban railway networks. Comput. Oper. Res. 36(5):1461–1477.Crossref, Google Scholar
• Marin A, Jaramillo P (2009) Urban rapid transit network design: Accelerated Benders decomposition. Ann. Oper. Res. 169:35–53.Crossref, Google Scholar
• Matisziw T, Murray AT, Kim C (2006) Strategic route extension in transit networks. Eur. J. Oper. Res. 171(2):661–673.Crossref, Google Scholar
• Paneque MP, Bierlaire M, Gendron B, Azadeh SS (2021) Integrating advanced discrete choice models in mixed integer linear optimization. Transportation Res. Part B: Methodological 146:26–49.Crossref, Google Scholar
• Papadakos N (2009) Integrated airline scheduling. Comput. Oper. Res. 36(1):176–195.Crossref, Google Scholar
• Pinto H, Hyland M, Mahmassani H, Verbas I (2020) Joint design of multimodal transit networks and shared autonomous mobility fleets. Transportation Res. Part C: Emerging Tech. 113:2–20.Crossref, Google Scholar
• Riley C, Legrain A, Van Hentenryck P (2019) Column generation for real-time ride-sharing operations. Rousseau LM, Stergiou K, eds. Integration of Constraint Programming, Artificial Intelligence, and Operations Research (Springer International Publishing, Cham, Switzerland), 472–487.Crossref, Google Scholar
• Schöbel A (2012) Line planning in public transportation: Models and methods. OR Spectrum 34:491–510.Crossref, Google Scholar
• Schöbel A, Scholl S (2006) Line planning with minimal traveling time. Kroon LG, Möhring RH, eds. Proc. Fifth Workshop Algorithmic Methods Models Optim. Railways. OpenAccess Series in Informatics, vol. 2 (Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany).Google Scholar
• Sinha A, Malo P, Deb K (2018) A review on bilevel optimization: From classical to evolutionary approaches and applications. IEEE Trans. Evolutionary Comput. 22(2):276–295.Crossref, Google Scholar
• Steiner K, Irnich S (2020) Strategic planning for integrated mobility-on-demand and urban public bus networks. Transportation Sci. 54(6):1616–1639.Link, Google Scholar
• Thorsteinsson ES (2001) Branch-and-check: A hybrid framework integrating mixed integer programming and constraint logic programming. Walsh T, ed. Principles and Practice of Constraint Programming—CP 2001. Lecture Notes in Computer Science, vol. 2239 (Springer, Berlin), 16–30.Crossref, Google Scholar
• Van Hentenryck P (2019) Social-aware on-demand mobility systems. ISE Magazine 51:10.Google Scholar
• Wu C, Murray A (2005) Optimizing public transit quality and system access: The multiple-route, maximal covering/shortest-path problem. Environment Planning B: Urban Analytics City Sci. 32(2):163–178.Google Scholar
• Yan X, Zhao X, Han Y, Hentenryck PV, Dillahunt T (2021) Mobility-on-demand vs. fixed-route transit systems: An evaluation of traveler preferences in low-income communities. Transportation Res. Part A: Policy Practice 148:481–495.Crossref, Google Scholar
• Yao J, Shi F, Zhou Z, Qin J (2012) Combinatorial optimization of exclusive bus lanes and bus frequencies in multi-modal transportation network. J. Transportation Engrg. 138(12):1422–1429.Crossref, Google Scholar
• Ye X, Pendyala RM, Gottardi G (2007) An exploration of the relationship between mode choice and complexity of trip chaining patterns. Transportation Res. Part B: Methodological 41(1):96–113.Crossref, Google Scholar
• Yu B, Kong L, Sun Y, Yao B, Gao Z (2015) A bi-level programming for bus lane network design. Transportation Res. Part C: Emerging Tech. 55:310–327.Crossref, Google Scholar