Transit priority lanes in the congested road networks

被引：13
作者：
Bagloee S.A. [1 ]
Sarvi M. [1 ]
Ceder A. [2 ]
机构：
[1] Department of Infrastructure Engineering, Melbourne School of Engineering, University of Melbourne, Melbourne, 3010, VIC
[2] Department of Civil and Environmental Engineering, Transportation Research Centre, University of Auckland, 20 Symonds Street, Auckland
来源：
Public Transport | 2017年 / 9卷 / 03期
关键词：
Bilevel; Braess paradox; Branch and bound; Transit priority lane;
D O I：
10.1007/s12469-017-0159-x
中图分类号：
学科分类号：
摘要：
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. © 2017, Springer-Verlag Berlin Heidelberg.
引用
收藏
页码：571 / 599
页数：28
相关论文
共 73 条
[1]  
Aashtiani H.Z., The multi-modal traffic assignment problem, (1979)
[2]  
Aashtiani H.Z., Poorzahedy H., Braess’ phenomenon in the management of networks and dissociation of equilibrium concepts, Transp Plan Technol, 27, pp. 469-482, (2004)
[3]  
Achterberg T., Wunderling R., Mixed integer programming: analyzing 12 years of progress, Facets of combinatorial optimization. Springer, New York, pp. 449-481, (2013)
[4]  
Bagherian M., Mesbah M., Ferreira L., Using delay functions to evaluate transit priority at signals, Public Transp, 7, pp. 61-75, (2015)
[5]  
Bagloee S.A., Asadi M., Prioritizing road extension projects with interdependent benefits under time constraint, Transp Res Part A Policy Pract, 75, pp. 196-216, (2015)
[6]  
Bagloee S.A., Asadi M., Crash analysis at intersections in the CBD: a survival analysis model, Transp Res Part A Policy Pract, 94, pp. 558-572, (2016)
[7]  
Bagloee S.A., Tavana M., An efficient hybrid heuristic method for prioritising large transportation projects with interdependent activities, Int J Logist Syst Manag, 11, pp. 114-142, (2012)
[8]  
Bagloee S.A., Ceder A., Tavana M., Bozic C., A heuristic methodology to tackle the Braess Paradox detecting problem tailored for real road networks, Transp A Transp Sci, 10, pp. 437-456, (2013)
[9]  
Bagloee S.A., Sarvi M., Patriksson M., A hybrid branch-and-bound and Benders decomposition algorithm for the network design problem, Comput Aided Civil Infrastruct Eng, (2016)
[10]  
Bagloee S.A., Sarvi M., Wallace M., Bicycle lane priority: promoting bicycle as a green mode even in congested urban area, Transp Res Part A Policy Pract, 87, pp. 102-121, (2016)
12345678