IDEAS home Printed from https://ideas.repec.org/a/spr/pubtra/v8y2016i2d10.1007_s12469-016-0131-1.html
   My bibliography  Save this article

A path-based greedy algorithm for multi-objective transit routes design with elastic demand

Author

Listed:
  • Amirali Zarrinmehr

    (Tarbiat Modares University)

  • Mahmoud Saffarzadeh

    (Tarbiat Modares University)

  • Seyedehsan Seyedabrishami

    (Tarbiat Modares University)

  • Yu Marco Nie

    (Northwestern University)

Abstract

This paper is concerned with the problem of finding optimal sub-routes from a set of predefined candidate transit routes with the objectives of maximizing transit ridership as well as minimizing operational costs. The main contributions of this paper are: (1) considering transit ridership maximization in a multi-objective bi-level optimization framework; (2) proposing a greedy algorithm for the multi-objective design problem; (3) applying an efficient path-based algorithm to solve the lower level multi-modal traffic assignment problem. Numerical experiments indicate that the proposed algorithm is not only able to approximate the Pareto-optimal solutions with satisfactory accuracy, but also achieves a fast performance even for problems of real-world scale.

Suggested Citation

  • Amirali Zarrinmehr & Mahmoud Saffarzadeh & Seyedehsan Seyedabrishami & Yu Marco Nie, 2016. "A path-based greedy algorithm for multi-objective transit routes design with elastic demand," Public Transport, Springer, vol. 8(2), pages 261-293, September.
    • Handle: RePEc:spr:pubtra:v:8:y:2016:i:2:d:10.1007_s12469-016-0131-1
    DOI: 10.1007/s12469-016-0131-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12469-016-0131-1
    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-016-0131-1?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. Spiess, Heinz & Florian, Michael, 1989. "Optimal strategies: A new assignment model for transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 23(2), pages 83-102, April.
    2. Elnaz Miandoabchi & Reza Farahani & Wout Dullaert & W. Szeto, 2012. "Hybrid Evolutionary Metaheuristics for Concurrent Multi-Objective Design of Urban Road and Public Transit Networks," Networks and Spatial Economics, Springer, vol. 12(3), pages 441-480, September.
    3. 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.
    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. Ben-Ayed, Omar & Boyce, David E. & Blair, Charles E., 1988. "A general bilevel linear programming formulation of the network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 22(4), pages 311-318, August.
    6. Quentin K. Wan & Hong K. Lo, 2009. "Congested multimodal transit network design," Public Transport, Springer, vol. 1(3), pages 233-251, August.
    7. Nie, Yu (Marco), 2010. "A class of bush-based algorithms for the traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 44(1), pages 73-89, January.
    8. Lo, Hong K. & Yip, C. W. & Wan, K. H., 2003. "Modeling transfer and non-linear fare structure in multi-modal network," Transportation Research Part B: Methodological, Elsevier, vol. 37(2), pages 149-170, February.
    9. Ceder, Avishai & Wilson, Nigel H. M., 1986. "Bus network design," Transportation Research Part B: Methodological, Elsevier, vol. 20(4), pages 331-344, August.
    10. Yu (Marco) Nie, 2012. "A Note on Bar-Gera's Algorithm for the Origin-Based Traffic Assignment Problem," Transportation Science, INFORMS, vol. 46(1), pages 27-38, February.
    11. Guihaire, Valérie & Hao, Jin-Kao, 2008. "Transit network design and scheduling: A global review," Transportation Research Part A: Policy and Practice, Elsevier, vol. 42(10), pages 1251-1273, December.
    Full references (including those not matched with items on IDEAS)

    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. Elnaz Miandoabchi & Reza Farahani & Wout Dullaert & W. Szeto, 2012. "Hybrid Evolutionary Metaheuristics for Concurrent Multi-Objective Design of Urban Road and Public Transit Networks," Networks and Spatial Economics, Springer, vol. 12(3), pages 441-480, September.
    2. 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.
    3. 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.
    4. Javier Duran & Lorena Pradenas & Victor Parada, 2019. "Transit network design with pollution minimization," Public Transport, Springer, vol. 11(1), pages 189-210, June.
    5. Cancela, Héctor & Mauttone, Antonio & Urquhart, María E., 2015. "Mathematical programming formulations for transit network design," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 17-37.
    6. Huang, Di & Liu, Zhiyuan & Liu, Pan & Chen, Jun, 2016. "Optimal transit fare and service frequency of a nonlinear origin-destination based fare structure," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 96(C), pages 1-19.
    7. 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.
    8. 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.
    9. Szeto, W.Y. & Jiang, Y., 2014. "Transit route and frequency design: Bi-level modeling and hybrid artificial bee colony algorithm approach," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 235-263.
    10. Ahmed, Leena & Mumford, Christine & Kheiri, Ahmed, 2019. "Solving urban transit route design problem using selection hyper-heuristics," European Journal of Operational Research, Elsevier, vol. 274(2), pages 545-559.
    11. Ibarra-Rojas, O.J. & Delgado, F. & Giesen, R. & Muñoz, J.C., 2015. "Planning, operation, and control of bus transport systems: A literature review," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 38-75.
    12. Loder, Allister & Bliemer, Michiel C.J. & Axhausen, Kay W., 2022. "Optimal pricing and investment in a multi-modal city — Introducing a macroscopic network design problem based on the MFD," Transportation Research Part A: Policy and Practice, Elsevier, vol. 156(C), pages 113-132.
    13. 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.
    14. 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.
    15. Elnaz Miandoabchi & Reza Farahani & W. Szeto, 2012. "Bi-objective bimodal urban road network design using hybrid metaheuristics," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 20(4), pages 583-621, December.
    16. Benjamin Otto, 2019. "Aggregation techniques for frequency assignment in public transportation," Public Transport, Springer, vol. 11(1), pages 51-87, June.
    17. Daraio, Cinzia & Diana, Marco & Di Costa, Flavia & Leporelli, Claudio & Matteucci, Giorgio & Nastasi, Alberto, 2016. "Efficiency and effectiveness in the urban public transport sector: A critical review with directions for future research," European Journal of Operational Research, Elsevier, vol. 248(1), pages 1-20.
    18. Kumar, Pramesh & Khani, Alireza, 2022. "Planning of integrated mobility-on-demand and urban transit networks," Transportation Research Part A: Policy and Practice, Elsevier, vol. 166(C), pages 499-521.
    19. David Schmaranzer & Roland Braune & Karl F. Doerner, 2021. "Multi-objective simulation optimization for complex urban mass rapid transit systems," Annals of Operations Research, Springer, vol. 305(1), pages 449-486, October.
    20. 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.

    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:8:y:2016:i:2:d:10.1007_s12469-016-0131-1. 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.