IDEAS home Printed from https://ideas.repec.org/a/spr/pubtra/v9y2017i3d10.1007_s12469-017-0159-x.html
   My bibliography  Save this article

Transit priority lanes in the congested road networks

Author

Listed:
  • Saeed Asadi Bagloee

    (University of Melbourne)

  • Majid Sarvi

    (University of Melbourne)

  • Avishai Ceder

    (University of Auckland)

Abstract

Given the advances in communication technologies and real-time traffic management, transit priority lanes are emerging as an indispensable component of intelligent transport systems. This scheme calls for giving priority to public transport. In this study, the question of interest is: Which roads can be nominated to give an exclusive lane to transit modes? Due to computational and theoretical complexities, the literature has yet to address this problem comprehensively at the network level considering various modes (public and private). Additionally, taking space away from private modes in favor of public transport may adversely affect the congestion level. To this end, inspired by the Braess Paradox, we seek mis-utilized space used by private modes to be dedicated to transit modes mainly on congested roads. To find such candidate roads, we define a merit index based on transit ridership and congestion level. The problem then becomes to find the best subset of these candidate roads to cede a lane to transit mode. It is formulated as a bilevel mixed-integer, nonlinear programming problem in which the decision variables are binary (1: to cause the respective road to have an exclusive transit lane or 0: not). The adverse effects are minimized on the upper level represented by total travel time (public and private modes) spent on the network. The lower level accounts for a bimodal traffic assignment, to consider the impact of transit priority on private modes. We then develop an efficient low-RAM-intensity branch and bound as a solution algorithm. The search for the subset is made in such a way that improved public transport is achieved at zero cost to the overall performance of the network. A real dataset from the city of Winnipeg, Canada is used for numerical evaluations.

Suggested Citation

  • Saeed Asadi Bagloee & Majid Sarvi & Avishai Ceder, 2017. "Transit priority lanes in the congested road networks," Public Transport, Springer, vol. 9(3), pages 571-599, October.
    • Handle: RePEc:spr:pubtra:v:9:y:2017:i:3:d:10.1007_s12469-017-0159-x
    DOI: 10.1007/s12469-017-0159-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12469-017-0159-x
    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-017-0159-x?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. Marshall L. Fisher, 2004. "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science, INFORMS, vol. 50(12_supple), pages 1861-1871, December.
    2. 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.
    3. Guler, S. Ilgin & Cassidy, Michael J., 2012. "Strategies for sharing bottleneck capacity among buses and cars," Transportation Research Part B: Methodological, Elsevier, vol. 46(10), pages 1334-1345.
    4. Boyce David & Xiong Qian, 2004. "User-Optimal and System-Optimal Route Choices for a Large Road Network," Review of Network Economics, De Gruyter, vol. 3(4), pages 1-10, December.
    5. Bagloee, Saeed Asadi & Asadi, Mohsen, 2016. "Crash analysis at intersections in the CBD: A survival analysis model," Transportation Research Part A: Policy and Practice, Elsevier, vol. 94(C), pages 558-572.
    6. Fontaine, Pirmin & Minner, Stefan, 2014. "Benders Decomposition for Discrete–Continuous Linear Bilevel Problems with application to traffic network design," Transportation Research Part B: Methodological, Elsevier, vol. 70(C), pages 163-172.
    7. Florian, Michael & Morosan, Calin D., 2014. "On uniqueness and proportionality in multi-class equilibrium assignment," Transportation Research Part B: Methodological, Elsevier, vol. 70(C), pages 173-185.
    8. Eichler, Michael & Daganzo, Carlos F., 2006. "Bus lanes with intermittent priority: Strategy formulae and an evaluation," Transportation Research Part B: Methodological, Elsevier, vol. 40(9), pages 731-744, November.
    9. Gao, Ziyou & Wu, Jianjun & Sun, Huijun, 2005. "Solution algorithm for the bi-level discrete network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 39(6), pages 479-495, July.
    10. Omar Ben-Ayed & Charles E. Blair, 1990. "Computational Difficulties of Bilevel Linear Programming," Operations Research, INFORMS, vol. 38(3), pages 556-560, June.
    11. Wang, Shuaian & Meng, Qiang & Yang, Hai, 2013. "Global optimization methods for the discrete network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 50(C), pages 42-60.
    12. Zheng, Nan & Geroliminis, Nikolas, 2013. "On the distribution of urban road space for multimodal congested networks," Transportation Research Part B: Methodological, Elsevier, vol. 57(C), pages 326-341.
    13. Cova, Thomas J. & Johnson, Justin P., 2003. "A network flow model for lane-based evacuation routing," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(7), pages 579-604, August.
    14. Basso, Leonardo J. & Guevara, Cristián Angelo & Gschwender, Antonio & Fuster, Marcelo, 2011. "Congestion pricing, transit subsidies and dedicated bus lanes: Efficient and practical solutions to congestion," Transport Policy, Elsevier, vol. 18(5), pages 676-684, September.
    15. Larry J. Leblanc, 1975. "An Algorithm for the Discrete Network Design Problem," Transportation Science, INFORMS, vol. 9(3), pages 183-199, August.
    16. Poorzahedy, Hossain & Rouhani, Omid M., 2007. "Hybrid meta-heuristic algorithms for solving network design problem," European Journal of Operational Research, Elsevier, vol. 182(2), pages 578-596, October.
    17. Hedayat Z. Aashtiani & Hossain Poorzahedy *, 2004. "Braess' phenomenon in the management of networks and dissociation of equilibrium concepts," Transportation Planning and Technology, Taylor & Francis Journals, vol. 27(6), pages 469-482, September.
    18. Bagloee, Saeed Asadi & Asadi, Mohsen, 2015. "Prioritizing road extension projects with interdependent benefits under time constraint," Transportation Research Part A: Policy and Practice, Elsevier, vol. 75(C), pages 196-216.
    19. Liu, Ronghui & Van Vliet, Dirck & Watling, David, 2006. "Microsimulation models incorporating both demand and supply dynamics," Transportation Research Part A: Policy and Practice, Elsevier, vol. 40(2), pages 125-150, February.
    20. Marshall L. Fisher, 2004. "Comments on ÜThe Lagrangian Relaxation Method for Solving Integer Programming ProblemsÝ," Management Science, INFORMS, vol. 50(12_supple), pages 1872-1874, December.
    21. Claudia D’Ambrosio & Andrea Lodi, 2013. "Mixed integer nonlinear programming tools: an updated practical overview," Annals of Operations Research, Springer, vol. 204(1), pages 301-320, April.
    22. Qun Chen, 2015. "An Optimization Model for the Selection of Bus-Only Lanes in a City," PLOS ONE, Public Library of Science, vol. 10(7), pages 1-12, July.
    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. Bagloee, Saeed Asadi & (Avi) Ceder, Avishai & Sarvi, Majid & Asadi, Mohsen, 2019. "Is it time to go for no-car zone policies? Braess Paradox Detection," Transportation Research Part A: Policy and Practice, Elsevier, vol. 121(C), pages 251-264.
    2. Yunqiang Xue & Lin Cheng & Meng Zhong & Xiaokang Sun, 2023. "Evaluation of Bus Lane Layouts Based on a Bi-Level Programming Model—Using Part of the Qingshan Lake District of Nanchang City, China, as an Example," Sustainability, MDPI, vol. 15(11), pages 1-13, May.
    3. Yao, Jia & Cheng, Ziyi & Chen, Anthony, 2023. "Bibliometric analysis and systematic literature review of the traffic paradoxes (1968–2022)," Transportation Research Part B: Methodological, Elsevier, vol. 177(C).
    4. Yunqiang Xue & Lin Cheng & Kuang Wang & Jing An & Hongzhi Guan, 2020. "System Dynamics Analysis of the Relationship between Transit Metropolis Construction and Sustainable Development of Urban Transportation—Case Study of Nanchang City, China," Sustainability, MDPI, vol. 12(7), pages 1-25, April.

    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. Bagloee, Saeed Asadi & Sarvi, Majid & Wolshon, Brian & Dixit, Vinayak, 2017. "Identifying critical disruption scenarios and a global robustness index tailored to real life road networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 98(C), pages 60-81.
    2. Pirmin Fontaine & Stefan Minner, 2017. "A dynamic discrete network design problem for maintenance planning in traffic networks," Annals of Operations Research, Springer, vol. 253(2), pages 757-772, June.
    3. Fontaine, Pirmin & Minner, Stefan, 2014. "Benders Decomposition for Discrete–Continuous Linear Bilevel Problems with application to traffic network design," Transportation Research Part B: Methodological, Elsevier, vol. 70(C), pages 163-172.
    4. Arash Kaviani & Russell G. Thompson & Abbas Rajabifard & Majid Sarvi, 2020. "A model for multi-class road network recovery scheduling of regional road networks," Transportation, Springer, vol. 47(1), pages 109-143, February.
    5. Wang, David Z.W. & Liu, Haoxiang & Szeto, W.Y., 2015. "A novel discrete network design problem formulation and its global optimization solution algorithm," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 79(C), pages 213-230.
    6. Liu, Jiangtao & Zhou, Xuesong, 2016. "Capacitated transit service network design with boundedly rational agents," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 225-250.
    7. 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.
    8. Tan, Zhijia & Yang, Hai & Tan, Wei & Li, Zhichun, 2016. "Pareto-improving transportation network design and ownership regimes," Transportation Research Part B: Methodological, Elsevier, vol. 91(C), pages 292-309.
    9. Hosseininasab, Seyyed-Mohammadreza & Shetab-Boushehri, Seyyed-Nader, 2015. "Integration of selecting and scheduling urban road construction projects as a time-dependent discrete network design problem," European Journal of Operational Research, Elsevier, vol. 246(3), pages 762-771.
    10. Xiang Zhang & S. Travis Waller, 2019. "Implications of link-based equity objectives on transportation network design problem," Transportation, Springer, vol. 46(5), pages 1559-1589, October.
    11. Tang, Qing & Hu, Xianbiao & Lu, Jiawei & Zhou, Xuesong, 2021. "Analytical characterization of multi-state effective discharge rates for bus-only lane conversion scheduling problem," Transportation Research Part B: Methodological, Elsevier, vol. 148(C), pages 106-131.
    12. Qiang Zhang & Shi Qiang Liu & Andrea D’Ariano, 2023. "Bi-objective bi-level optimization for integrating lane-level closure and reversal in redesigning transportation networks," Operational Research, Springer, vol. 23(2), pages 1-51, June.
    13. Anderson, Paul & Geroliminis, Nikolas, 2020. "Dynamic lane restrictions on congested arterials," Transportation Research Part A: Policy and Practice, Elsevier, vol. 135(C), pages 224-243.
    14. 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.
    15. Di, Xuan & Ma, Rui & Liu, Henry X. & Ban, Xuegang (Jeff), 2018. "A link-node reformulation of ridesharing user equilibrium with network design," Transportation Research Part B: Methodological, Elsevier, vol. 112(C), pages 230-255.
    16. Khooban, Zohreh & Farahani, Reza Zanjirani & Miandoabchi, Elnaz & Szeto, W.Y., 2015. "Mixed network design using hybrid scatter search," European Journal of Operational Research, Elsevier, vol. 247(3), pages 699-710.
    17. Liu, Haoxiang & Szeto, W.Y. & Long, Jiancheng, 2019. "Bike network design problem with a path-size logit-based equilibrium constraint: Formulation, global optimization, and matheuristic," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 284-307.
    18. Haque, Khademul & Mishra, Sabyasachee & Golias, Mihalis M., 2021. "Multi-period transportation network investment decision making and policy implications using econometric framework," Research in Transportation Economics, Elsevier, vol. 89(C).
    19. Hosseininasab, Seyyed-Mohammadreza & Shetab-Boushehri, Seyyed-Nader & Hejazi, Seyed Reza & Karimi, Hadi, 2018. "A multi-objective integrated model for selecting, scheduling, and budgeting road construction projects," European Journal of Operational Research, Elsevier, vol. 271(1), pages 262-277.
    20. Fragkos, Ioannis & Cordeau, Jean-François & Jans, Raf, 2021. "Decomposition methods for large-scale network expansion problems," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 60-80.

    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:9:y:2017:i:3:d:10.1007_s12469-017-0159-x. 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.