IDEAS home Printed from https://ideas.repec.org/a/spr/pubtra/v15y2023i2d10.1007_s12469-022-00312-5.html
   My bibliography  Save this article

A simulation-based optimization approach for designing transit networks

Author

Listed:
  • Obiora A. Nnene

    (University of Cape Town)

  • Johan W. Joubert

    (Centre for Transport Development)

  • Mark H. P. Zuidgeest

    (University of Cape Town)

Abstract

Public transport network design deals with finding efficient network solution(s) from a set of alternatives that best satisfies the often-conflicting objectives of stakeholders like passengers and operators. This work presents a simulation-based optimization (SBO) model for designing public transport networks. The work’s novelty is in developing such a network design model that fully accounts for the stochastic behavior of commuters on the transit network. The SBO discipline solves decision-based problems like the transit network design problem (TNDP) by combining simulation and optimization models. The proposed model integrates a disaggregated activity-based travel demand simulation with a multi-objective network optimization algorithm. Trip-based travel demand models are commonly used to represent traveler behavior in the literature. The approach limits its ability to accommodate the stochastic realities of traveler behavior in a transit network design solution. Using activity-based simulation instead makes it possible to account for a more realistic traveler behavior, especially real-time decisions made in response to changing network dynamics which ultimately affect the distribution of demand over time on the network. The proposed model is applied to the improved design of the integrated public transport network in the City of Cape Town, South Africa. The results show SBO can design efficient network solutions that reflect the objectives of network stakeholders.

Suggested Citation

  • Obiora A. Nnene & Johan W. Joubert & Mark H. P. Zuidgeest, 2023. "A simulation-based optimization approach for designing transit networks," Public Transport, Springer, vol. 15(2), pages 377-409, June.
    • Handle: RePEc:spr:pubtra:v:15:y:2023:i:2:d:10.1007_s12469-022-00312-5
    DOI: 10.1007/s12469-022-00312-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12469-022-00312-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12469-022-00312-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Flötteröd, Gunnar & Rohde, Jannis, 2011. "Operational macroscopic modeling of complex urban road intersections," Transportation Research Part B: Methodological, Elsevier, vol. 45(6), pages 903-922, July.
    2. Szeto, W.Y. & Wu, Yongzhong, 2011. "A simultaneous bus route design and frequency setting problem for Tin Shui Wai, Hong Kong," European Journal of Operational Research, Elsevier, vol. 209(2), pages 141-155, March.
    3. Philipp Heyken Soares & Christine L. Mumford & Kwabena Amponsah & Yong Mao, 2019. "An adaptive scaled network for public transport route optimisation," Public Transport, Springer, vol. 11(2), pages 379-412, August.
    4. Jin Y. Yen, 1971. "Finding the K Shortest Loopless Paths in a Network," Management Science, INFORMS, vol. 17(11), pages 712-716, July.
    5. Christina Iliopoulou & Konstantinos Kepaptsoglou & Eleni Vlahogianni, 2019. "Metaheuristics for the transit route network design problem: a review and comparative analysis," Public Transport, Springer, vol. 11(3), pages 487-521, October.
    6. Javier Durán-Micco & Pieter Vansteenwegen, 2022. "A survey on the transit network design and frequency setting problem," Public Transport, Springer, vol. 14(1), pages 155-190, March.
    7. Daganzo, Carlos F. & Ouyang, Yanfeng, 2019. "A general model of demand-responsive transportation services: From taxi to ridesharing to dial-a-ride," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 213-224.
    8. Mohsen Momenitabar & Jeremy Mattson, 2021. "A Multi-Objective Meta-Heuristic Approach to Improve the Bus Transit Network: A Case Study of Fargo-Moorhead Area," Sustainability, MDPI, vol. 13(19), pages 1-25, September.
    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. Sönke Beckmann & Sebastian Trojahn & Hartmut Zadek, 2023. "Process Model for the Introduction of Automated Buses," Sustainability, MDPI, vol. 15(19), pages 1-36, September.

    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. Sunhyung Yoo & Jinwoo Brian Lee & Hoon Han, 2023. "A Reinforcement Learning approach for bus network design and frequency setting optimisation," Public Transport, Springer, vol. 15(2), pages 503-534, June.
    2. Philipp Heyken Soares, 2021. "Zone-based public transport route optimisation in an urban network," Public Transport, Springer, vol. 13(1), pages 197-231, March.
    3. David Canca & Belén Navarro-Carmona & Gabriel Villa & Alejandro Zarzo, 2023. "A Multilayer Network Approach for the Bimodal Bus–Pedestrian Line Planning Problem," Mathematics, MDPI, vol. 11(19), pages 1-36, October.
    4. Igor Varyash & Alexey Mikhaylov & Nikita Moiseev & Kirill Aleshin, 2020. "Triple bottom line and corporate social responsibility performance indicators for Russian companies," Entrepreneurship and Sustainability Issues, VsI Entrepreneurship and Sustainability Center, vol. 8(1), pages 313-329, September.
    5. Li, Guoyuan & Chen, Anthony, 2023. "Strategy-based transit stochastic user equilibrium model with capacity and number-of-transfers constraints," European Journal of Operational Research, Elsevier, vol. 305(1), pages 164-183.
    6. Pierre-Léo Bourbonnais & Catherine Morency & Martin Trépanier & Éric Martel-Poliquin, 2021. "Transit network design using a genetic algorithm with integrated road network and disaggregated O–D demand data," Transportation, Springer, vol. 48(1), pages 95-130, February.
    7. Camporeale, Rosalia & Caggiani, Leonardo & Ottomanelli, Michele, 2019. "Modeling horizontal and vertical equity in the public transport design problem: A case study," Transportation Research Part A: Policy and Practice, Elsevier, vol. 125(C), pages 184-206.
    8. Durán-Micco, Javier & Vansteenwegen, Pieter, 2022. "Transit network design considering link capacities," Transport Policy, Elsevier, vol. 127(C), pages 148-157.
    9. Arbex, Renato Oliveira & da Cunha, Claudio Barbieri, 2015. "Efficient transit network design and frequencies setting multi-objective optimization by alternating objective genetic algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 355-376.
    10. Peng Wu & Ling Xu & Ada Che & Feng Chu, 2022. "A bi-objective decision model and method for the integrated optimization of bus line planning and lane reservation," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1298-1327, July.
    11. Huili Zhang & Yinfeng Xu & Xingang Wen, 2015. "Optimal shortest path set problem in undirected graphs," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 511-530, April.
    12. Ivona Brajević, 2021. "A Shuffle-Based Artificial Bee Colony Algorithm for Solving Integer Programming and Minimax Problems," Mathematics, MDPI, vol. 9(11), pages 1-20, May.
    13. Daria Dzyabura & Srikanth Jagabathula, 2018. "Offline Assortment Optimization in the Presence of an Online Channel," Management Science, INFORMS, vol. 64(6), pages 2767-2786, June.
    14. Melchiori, Anna & Sgalambro, Antonino, 2020. "A branch and price algorithm to solve the Quickest Multicommodity k-splittable Flow Problem," European Journal of Operational Research, Elsevier, vol. 282(3), pages 846-857.
    15. Luss, Hanan & Wong, Richard T., 2005. "Graceful reassignment of excessively long communications paths in networks," European Journal of Operational Research, Elsevier, vol. 160(2), pages 395-415, January.
    16. Raka Jovanovic & Islam Safak Bayram & Sertac Bayhan & Stefan Voß, 2021. "A GRASP Approach for Solving Large-Scale Electric Bus Scheduling Problems," Energies, MDPI, vol. 14(20), pages 1-23, October.
    17. Rinaldi, Marco & Viti, Francesco, 2017. "Exact and approximate route set generation for resilient partial observability in sensor location problems," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 86-119.
    18. Nayan, Ashish & Wang, David Z.W., 2017. "Optimal bus transit route packaging in a privatized contracting regime," Transportation Research Part A: Policy and Practice, Elsevier, vol. 97(C), pages 146-157.
    19. Timothy M. Sweda & Irina S. Dolinskaya & Diego Klabjan, 2017. "Adaptive Routing and Recharging Policies for Electric Vehicles," Transportation Science, INFORMS, vol. 51(4), pages 1326-1348, November.
    20. Chen, Bi Yu & Chen, Xiao-Wei & Chen, Hui-Ping & Lam, William H.K., 2020. "Efficient algorithm for finding k shortest paths based on re-optimization technique," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).

    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:spr:pubtra:v:15:y:2023:i:2:d:10.1007_s12469-022-00312-5. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.