IDEAS home Printed from https://ideas.repec.org/p/jgu/wpaper/1819.html
   My bibliography  Save this paper

Strategic Planning for Integrated Mobility-on-Demand and Urban Public Bus Networks

Author

Listed:
  • Konrad Steiner

    (Johannes Gutenberg-University)

  • Stefan Irnich

    (Johannes Gutenberg-University)

Abstract

Traditional planning for urban transportation usually assumes a given or calculated split between motorized individual transport and public transportation. However, app-based services and ridesharing in the field of mobility on demand (MoD) create an intermediate mode of transport, whose long-term role in the urban mobility landscape and within public transport systems is not fully understood as of today. If the public transport industry wants to capture the opportunities these new services offer and mitigate the risks that come with them, planning tools for integrated intermodal networks are indispensable. In this work, we develop a strategic network planning optimization model for bus lines that allows for intermodal trips with MoD as a first or last leg. For an existing public transport network, we decide simultaneously on the use of existing lines and segments in the future fixed-route network, on areas of the city where an integrated MoD service should be offered, on how MoD interacts with the fixed route network via transfer points, and on passenger routes. The objective is the optimization of the financial performance of the resulting network, including the additional demand and revenues induced by enhanced network coverage. The model provides several options for modeling MoD costs, which allows for linking with operational models such as dial-a-ride. Moreover, our model considers a range of additional important strategic decisions like subsidies for a potential private sector operator of MoD services and the interplay between the demand for public transport and the role of MoD. We develop a path-based formulation of the problem and a branch-and-price algorithm as well as an enhanced enumeration-based approach to solve real-world instances to proven optimality. The model is tested on instances generated with the help of real-world data from a medium-sized German city that currently operates around 20 bus lines.

Suggested Citation

  • Konrad Steiner & Stefan Irnich, 2018. "Strategic Planning for Integrated Mobility-on-Demand and Urban Public Bus Networks," Working Papers 1819, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
  • Handle: RePEc:jgu:wpaper:1819
    as

    Download full text from publisher

    File URL: https://download.uni-mainz.de/RePEc/pdf/Discussion_Paper_1819.pdf
    File Function: First version, 2018
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Goerigk, Marc & Schmidt, Marie, 2017. "Line planning with user-optimal route choice," European Journal of Operational Research, Elsevier, vol. 259(2), pages 424-436.
    2. Ho, Sin C. & Szeto, W.Y. & Kuo, Yong-Hong & Leung, Janny M.Y. & Petering, Matthew & Tou, Terence W.H., 2018. "A survey of dial-a-ride problems: Literature review and recent developments," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 395-421.
    3. Rothenbächer, Ann-Kathrin & Drexl, Michael & Irnich, Stefan, 2016. "Branch-and-price-and-cut for a service network design and hub location problem," European Journal of Operational Research, Elsevier, vol. 255(3), pages 935-947.
    4. Farahani, Reza Zanjirani & Miandoabchi, Elnaz & Szeto, W.Y. & Rashidi, Hannaneh, 2013. "A review of urban transportation network design problems," European Journal of Operational Research, Elsevier, vol. 229(2), pages 281-302.
    5. Shen, Yu & Zhang, Hongmou & Zhao, Jinhua, 2018. "Integrating shared autonomous vehicle in public transportation system: A supply-side simulation of the first-mile service in Singapore," Transportation Research Part A: Policy and Practice, Elsevier, vol. 113(C), pages 125-136.
    6. Mads Jepsen & Bjørn Petersen & Simon Spoorendonk & David Pisinger, 2008. "Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows," Operations Research, INFORMS, vol. 56(2), pages 497-511, April.
    7. Jean-François Cordeau & Gilbert Laporte, 2007. "The dial-a-ride problem: models and algorithms," Annals of Operations Research, Springer, vol. 153(1), pages 29-46, September.
    8. Agatz, Niels & Erera, Alan & Savelsbergh, Martin & Wang, Xing, 2012. "Optimization for dynamic ride-sharing: A review," European Journal of Operational Research, Elsevier, vol. 223(2), pages 295-303.
    9. Guy Desaulniers & Jacques Desrosiers & Marius M. Solomon (ed.), 2005. "Column Generation," Springer Books, Springer, number 978-0-387-25486-9, September.
    10. Hai Wang & Amedeo Odoni, 2016. "Approximating the Performance of a “Last Mile” Transportation System," Transportation Science, INFORMS, vol. 50(2), pages 659-675, May.
    11. Ralf Borndörfer & Martin Grötschel & Marc E. Pfetsch, 2007. "A Column-Generation Approach to Line Planning in Public Transport," Transportation Science, INFORMS, vol. 41(1), pages 123-132, February.
    12. Itf, 2015. "Urban Mobility System Upgrade: How shared self-driving cars could change city traffic," International Transport Forum Policy Papers 6, OECD Publishing.
    13. Michel Gamache & François Soumis & Gérald Marquis & Jacques Desrosiers, 1999. "A Column Generation Approach for Large-Scale Aircrew Rostering Problems," Operations Research, INFORMS, vol. 47(2), pages 247-263, April.
    14. Stefan Irnich & Guy Desaulniers, 2005. "Shortest Path Problems with Resource Constraints," Springer Books, in: Guy Desaulniers & Jacques Desrosiers & Marius M. Solomon (ed.), Column Generation, chapter 0, pages 33-65, Springer.
    15. Chowdhury, Subeh & Ceder, Avishai (Avi), 2016. "Users’ willingness to ride an integrated public-transport service: A literature review," Transport Policy, Elsevier, vol. 48(C), pages 183-195.
    16. Aldaihani, Majid M. & Quadrifoglio, Luca & Dessouky, Maged M. & Hall, Randolph, 2004. "Network design for a grid hybrid transit service," Transportation Research Part A: Policy and Practice, Elsevier, vol. 38(7), pages 511-530, August.
    17. Diana, Marco & Dessouky, Maged M. & Xia, Nan, 2006. "A model for the fleet sizing of demand responsive transportation services with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 40(8), pages 651-666, September.
    18. Peraphan Jittrapirom & Valeria Caiati & Anna-Maria Feneri & Shima Ebrahimigharehbaghi & María J. Alonso González & Jishnu Narayan, 2017. "Mobility as a Service: A Critical Review of Definitions, Assessments of Schemes, and Key Challenges," Urban Planning, Cogitatio Press, vol. 2(2), pages 13-25.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Molenbruch, Yves & Braekers, Kris & Hirsch, Patrick & Oberscheider, Marco, 2021. "Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm," European Journal of Operational Research, Elsevier, vol. 290(1), pages 81-98.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Timo Gschwind & Stefan Irnich, 2012. "Effective Handling of Dynamic Time Windows and Synchronization with Precedences for Exact Vehicle Routing," Working Papers 1211, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    2. Behrend, Moritz & Meisel, Frank & Fagerholt, Kjetil & Andersson, Henrik, 2019. "An exact solution method for the capacitated item-sharing and crowdshipping problem," European Journal of Operational Research, Elsevier, vol. 279(2), pages 589-604.
    3. Sohani Liyanage & Hussein Dia & Rusul Abduljabbar & Saeed Asadi Bagloee, 2019. "Flexible Mobility On-Demand: An Environmental Scan," Sustainability, MDPI, vol. 11(5), pages 1-39, February.
    4. Nicola Bianchessi & Stefan Irnich & Christian Tilk, 2020. "A Branch-Price-and-Cut Algorithm for the Capacitated Multiple Vehicle Traveling Purchaser Problem with Unitary Demand," Working Papers 2003, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    5. Christian Tilk & Michael Drexl & Stefan Irnich, 2018. "Nested Branch-and-Price-and-Cut for Vehicle Routing Problems with Multiple Resource Interdependencies," Working Papers 1801, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    6. MELIS, Lissa & SÖRENSEN, Kenneth, 2021. "The real-time on-demand bus routing problem: What is the cost of dynamic requests?," Working Papers 2021003, University of Antwerp, Faculty of Business and Economics.
    7. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
    8. Qie He & Stefan Irnich & Yongjia Song, 2018. "Branch-Cut-and-Price for the Vehicle Routing Problem with Time Windows and Convex Node Costs," Working Papers 1804, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    9. Tilk, Christian & Drexl, Michael & Irnich, Stefan, 2019. "Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies," European Journal of Operational Research, Elsevier, vol. 276(2), pages 549-565.
    10. Wong, Yale Z. & Hensher, David A. & Mulley, Corinne, 2020. "Mobility as a service (MaaS): Charting a future context," Transportation Research Part A: Policy and Practice, Elsevier, vol. 131(C), pages 5-19.
    11. Ann-Kathrin Rothenbächer & Michael Drexl & Stefan Irnich, 2016. "Branch-and-Price-and-Cut for the Truck-andTrailer Routing Problem with Time Windows," Working Papers 1617, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    12. Ann-Kathrin Rothenbächer, 2019. "Branch-and-Price-and-Cut for the Periodic Vehicle Routing Problem with Flexible Schedule Structures," Transportation Science, INFORMS, vol. 53(3), pages 850-866, May.
    13. Tang, Zhe-Yi & Tian, Li-Jun & Wang, David Z.W., 2021. "Multi-modal morning commute with endogenous shared autonomous vehicle penetration considering parking space constraint," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 151(C).
    14. Aslaksen, Ingvild Eide & Svanberg, Elisabeth & Fagerholt, Kjetil & Johnsen, Lennart C. & Meisel, Frank, 2021. "A combined dial-a-ride and fixed schedule ferry service for coastal cities," Transportation Research Part A: Policy and Practice, Elsevier, vol. 153(C), pages 306-325.
    15. Mourad, Abood & Puchinger, Jakob & Chu, Chengbin, 2019. "A survey of models and algorithms for optimizing shared mobility," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 323-346.
    16. Rich, Jeppe & Seshadri, Ravi & Jomeh, Ali Jamal & Clausen, Sofus Rasmus, 2023. "Fixed routing or demand-responsive? Agent-based modelling of autonomous first and last mile services in light-rail systems," Transportation Research Part A: Policy and Practice, Elsevier, vol. 173(C).
    17. Ke, Jintao & Yang, Hai & Li, Xinwei & Wang, Hai & Ye, Jieping, 2020. "Pricing and equilibrium in on-demand ride-pooling markets," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 411-431.
    18. Zhang, Zhenhao & Tafreshian, Amirmahdi & Masoud, Neda, 2020. "Modular transit: Using autonomy and modularity to improve performance in public transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    19. Katrin Heßler & Stefan Irnich, 2023. "Partial Dominance in Branch-Price-and-Cut for the Basic Multicompartment Vehicle-Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 50-65, January.
    20. Ann-Kathrin Rothenbächer, 2017. "Branch-and-Price-and-Cut for the Periodic Vehicle Routing Problem with Flexible Schedule Structures," Working Papers 1714, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.

    More about this item

    Keywords

    mobility on demand; strategic network planning; intermodal networks; multimodality; dial-a-ride; branch-and-price;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:jgu:wpaper:1819. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Research Unit IPP (email available below). General contact details of provider: https://edirc.repec.org/data/vlmaide.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.