城市道路单向交通组织优化
|
摘要
我国城市交通拥堵问题日趋严重。但由于交通管理手段的滞后,在城市主干道拥挤不堪时,很多支路却被闲置。采用城市支路分流主干道交通量,将支路的单向交通组织作为缓解城市交通压力的有效管理手段,优化路网结构、提高支路利用率,从而达到缓解交通拥挤的目的。
本文通过分析单向交通的特征和城市道路系统中支路的建设和利用程度现状,以支路作为单向交通组织的优化对象,以减轻道路负荷水平并保障出行公平性的目标,对单向交通组织优化问题进行分析。建立了以路段饱和度超限量和车辆绕行系数最小化为目标的双层规划模型,并设计了求解模型的模拟退火算法。算例结果表明单向交通组织可以降低路段饱和度超限量,缓解干道路段的拥堵,但随着绕行系数比重的增大,路段饱和度超限量的优化能力逐渐减弱。同时对实例路网进行了单向交通组织优化的实证分析,并将优化方案与实际运行方案进行了比较。
在此基础上,考虑到交叉口延误对单向交通组织和路径选择行为的影响,建立了带交叉口延误的单向交通组织优化的双层规划模型,并考虑交叉口延误对单向交通优化算法进行扩展。算例结果表明考虑交叉口延误时支路分流能力不及无交叉口延误影响时的情况,但是支路流量分布更为均衡。
The traffic problem has become increasingly serious in our country. However, because the traffic management lags behind the traffic demand development, the arterial roads are congested while lots of branch road are left unused. Taking the advantage of branch road to distribute the arterial traffic demand, the one-way traffic of the branch can be regarded as an effective approach to alleviate urban traffic stress, which can improve the utilization of the branch road, optimize the road network configuration, and reduce the arterial pressure.
By describing the one-way traffic characters and the constructing and using state of the branch road, the one-way traffic optimization of branch road was analyzed with the aims of reducing traffic load and ensuring the road equity. The bi-level programming model was established with the objectives of minimizing the portion that road saturation exceeds the anticipant saturation and vehicle detour index. Then the simulated annealing algorithm was designed to solve the be-level model. The numerical result showed that one-way traffic organization could reduce the over-saturation portion of road section, but with the increase of detour index proportion, the potential of reduced degree decreases gradually. A real network was tested to evaluate the effectiveness of the model and algorithm. And then a contrastive analysis of the proposal solution and the practical performing solution was made.
Moreover, considering the effect of intersection delay in one-way traffic organization and route choice behavior, the optimization model of one-way traffic organization with intersection delay was set up and the corresponding algorithm was developed from the existing work. The numerical result illustrated that though the distributing capacity of the branch road without considering intersection delay was less than that of considering intersection delay, the flow distribution of the former was more balanced than the latter.
本文通过分析单向交通的特征和城市道路系统中支路的建设和利用程度现状,以支路作为单向交通组织的优化对象,以减轻道路负荷水平并保障出行公平性的目标,对单向交通组织优化问题进行分析。建立了以路段饱和度超限量和车辆绕行系数最小化为目标的双层规划模型,并设计了求解模型的模拟退火算法。算例结果表明单向交通组织可以降低路段饱和度超限量,缓解干道路段的拥堵,但随着绕行系数比重的增大,路段饱和度超限量的优化能力逐渐减弱。同时对实例路网进行了单向交通组织优化的实证分析,并将优化方案与实际运行方案进行了比较。
在此基础上,考虑到交叉口延误对单向交通组织和路径选择行为的影响,建立了带交叉口延误的单向交通组织优化的双层规划模型,并考虑交叉口延误对单向交通优化算法进行扩展。算例结果表明考虑交叉口延误时支路分流能力不及无交叉口延误影响时的情况,但是支路流量分布更为均衡。
The traffic problem has become increasingly serious in our country. However, because the traffic management lags behind the traffic demand development, the arterial roads are congested while lots of branch road are left unused. Taking the advantage of branch road to distribute the arterial traffic demand, the one-way traffic of the branch can be regarded as an effective approach to alleviate urban traffic stress, which can improve the utilization of the branch road, optimize the road network configuration, and reduce the arterial pressure.
By describing the one-way traffic characters and the constructing and using state of the branch road, the one-way traffic optimization of branch road was analyzed with the aims of reducing traffic load and ensuring the road equity. The bi-level programming model was established with the objectives of minimizing the portion that road saturation exceeds the anticipant saturation and vehicle detour index. Then the simulated annealing algorithm was designed to solve the be-level model. The numerical result showed that one-way traffic organization could reduce the over-saturation portion of road section, but with the increase of detour index proportion, the potential of reduced degree decreases gradually. A real network was tested to evaluate the effectiveness of the model and algorithm. And then a contrastive analysis of the proposal solution and the practical performing solution was made.
Moreover, considering the effect of intersection delay in one-way traffic organization and route choice behavior, the optimization model of one-way traffic organization with intersection delay was set up and the corresponding algorithm was developed from the existing work. The numerical result illustrated that though the distributing capacity of the branch road without considering intersection delay was less than that of considering intersection delay, the flow distribution of the former was more balanced than the latter.
引文
[1]Downs A. Smart Growth:why we discuss it more than we do it[J]. Journal of the American Planning Association,2005,71(4):367-378.
[2]2009长沙市交通状况年度报告[R], www.tranbbs.com,2009.
[3]Vasquez, Gabriel M., Taylor, Maureen. What cultural values influence American public relations practitioners[J]. Public Relations Review,1999,25 (4):433-449.
[4]Davies, Marin J. One-way traffic[J]. Trends in Biotechnology,2001,19 (7): 244-260.
[5]吴元祥.单向交通网络系统分析[J].科技管理,1999：25-28.
[6]李荣波.关于单向交通通行能力的探讨[J].中国市政工程,1998,3：1-6.
[7]马俊来,王炜,边扬.单向交通条件下信号交叉口1通行能力通行能力计算方法[J].公路交通科技,2005,22(4)：103-107.
[8]裴玉龙,伊新苗.城市单向交通组织方案规划及其评价研究[J].东北公路,2003,26(3)：118-120.
[9]赖比尔.城市道路单向交通规划研究[D].西安：西安公路交通大学,2000.
[10]朱桃丽.城市道路单向交通方案设计研究[D].长沙：湖南大学,2007.
[11]王玉娥.城市道路单单向交通方案技术评价研究[D].长沙：湖南大学,2008.
[12]李然然.单向交通组织绕行影响分析[D].西安：西南交通大学,2010.
[13]Robbins H E. A theorem on graphs with an application to a problem of traffic control[J]. American Math Monthly,1939,46:281-283.
[14]Roberts F S. Discrete mathematical models with applications to social biological and environmental problems[M]. Prentice-Hall, Englewood Cliffs, NJ,1976.
[15]Boesch F, Tindel R. Robbins" theorem for mixed graphs[J]. Amer Math Monthly, 1980,87:716-719.
[16]Chung F R K, Garey M R, Tarjian R E. Strongly connected orientations of mixed multi-graphs[J]. Networks,1985,15:477-484.
[17]Roberts F S, Xu Y. On the optimal strongly connected orientation of city street graphs I:large grids[J]. Siamj Disc Math,1988,1:199-222.
[18]Roberts F S, Xu Y. On the optimal strongly connected orientations of city street graphs II:two east-west avenues or north-south streets[J]. Networks,1989,19: 221-233.
[19]Roberts F S, Xu Y. On the optimal strongly connected orientations of city street graphs III:three east-west avenues or north-south streets[J], Networks,1992,22: 109-143.
[20]Drezner Z, Wesolowsky G O. Selecting an optimum configuration of one-way and two-way routes. Transportation Science,1997,31:386-384.
[21]Drezner Z, Salhi S. Selecting a good configurations of one-way and two-way routes using tabu search[J]. Control Cybernet,2000,29:725-740.
[22]李岚.城市道路单向交通设置方法研究[D].吉林：吉林大学,2001.
[23]魏广奇.城市单向道路定向方法研究[D].长沙：长沙理工大学,2005.
[24]吴薇薇,宁宣熙.城市街道网单行道改造方案的评估[J].系统工程理论与实践,2009,29(7)：153-159.
[25]Wolshon B, Urbna E, Levitan M. National view of hurricane evacuation plans and policies:a comparison and state practice[J]. Transportation Research, Part A, 2003,37(3):257-275.
[26]Kim S, Shekhar S. Contraflow network reconfiguration for evacuation planning: A summary of results[C]. Proceeding of the 13rd Annual ACM International Workshop on Geographic Information Systems, Bremen,2005, New York:ACM Press,2005:250-259.
[27]Kim S, Shekhar S. Contraflow transportation network reconfiguration for evacuation route planning[R]. IEEE Transaction on Knowledge and data engineering,2008,20(8):1115-1129.
[28]Thomas J, Justin P. A network flow model for lane-based evacuation routing[J]. Transportation Research Part A,2003,37,579-604.
[29]Liu Y, Lai X L et al. Two-level integrated optimization system for planning of emergency evacuation[J]. Journal of Transportation Engineering,2006,800-809.
[30]Georgios K, Srinivas P. Planning for evacuation:insights from an efficient network design model[J]. Journal of Infrastructure System,2009,21-30.
[31]严新平，吕超能等.大型活动后车道单行优化的双层舰划[J].西南交通大学学报,2009,44(1)：112-117.
[32]吴兵,李晔.交通管理与控制[M].北京：人民交通出版社,2005.
[33]王克新.充分发挥单向交通管理优势解决城市的交通拥堵.新疆工学院学报,1999,(3)：214-217.
[34]Development Consulting Group, Typlan Consulting Ltd. One way couplets impact analysis final report[R]. Prepared for Downtown Kelowna Association, Kelowna, Southern British Columbia, Canada,2003.
[35]张宇飞.城市单向交通组织的发展和特点[J].中国市政工程,2003,(5)：5-7.
[36]高臣辉.青岛市单向交通盘活了城市道路资源[J].科技成果纵横：33.
[37]夏海平,薛美根.上海市单向交通系统综合分析研究[C].现代化道路交通管理发展与展望——第八届多国城市交通学术会议论文集,2003
[38]于晓淦.南京市城市交通效益分析和发展对策[J].交通与计算机,2007,5：110-113.
[39]Schwigher C M, Leary, Fulton T H. Central business district traffic circulation improvement-a case study:Salina, Kansas[C]//69th Annual Meeting of the Institute of Transportation Engineers,1999.
[40]瞿忠民.道路交通组织优化[M].北京：人民交通出版社,2004.
[41]GA/T486-2004,城市道路单向交通组织原则[S].北京：中国标准出版社,2004.
[42]赵升.城市道路单向交通影响、规划及综合评价研究[D].成都：西南交通大学,2004.
[43]CJJ 37-90,城市道路设计规范[S].北京：中国标准出版社,2004.
[44]石飞.城市道路等级级配及布局方法研究[D].南京：东南大学博士学位论文,2006.
[45]Michael C P. The supply of residential access streets and secondary arterial roads[J]. Transportation Research Part B:Methodological,1980,14(1):121-132.
[46]Radnor J P, Norman J A, Paul H W. Transportation engineering planning and design[J]. John Wiley & Songs in Corporated.1982.
[47]刘望保.国内外城市交通微循环和支路网的研究进展和展望[J].规划师，2009,6(25)：21-24.
[48]黄恩厚.城市道路交通微循环系统改扩建优化理论与方法[D].长沙：中南大学,2009.
[49]Ben-Ayed O, Blair C E. Computational difficulties of Bi-level Linear Programming[J]. Operation Research,1990,38:556-559.
[50]Yang H, Bell M G H. Models and algorithms for road network design:a review and some new developments[J]. Transport Review,1998,18(3):257-278.
[51]Yang H and Meng Q. Highway pricing and capacity choice in a road network under a build-operate-transfer scheme[J]. Transportation Research-A,2000,34: 207-222.
[52]Moore J T and Bard J F. The mixed integer bi-level programming problem[J]. Operations Research,1990,38:911-921.
[53]Edmunds T A and Bard J F. An algorithm for the mixed-Integer nonlinear bi-level programming problem[J]. Annals of Operation Research,1992,34:149-162.
[54]Metropolis N, Rosenbluth A, Rosenbluth M et al. Equation of state calculations by fast computing machines[J]. Journal of Chemical Physics,1953, 21:1087-1092.
[55]Kirkpatrick S, Gelatt Jr C D, Vecchi M P. Optimization by simulation annealing[J]. Science,1983,220:671-680.
[56]Fabian V. Simulated annealing simulated[J]. Computers Math. Applc.1997, 33(1/2):1-94.
[57]任刚.交通管理措施下的交通分配模型与算法[M].南京：东南大学出版社,2007，96-100.
[58]Nathan H G, Ajay K R. Monograph on traffic flow theory[J]. USA:The Federal Highway Administration,1996.
[59]Highway capacity manual 2000.Transportation Research Board. National Research Council, Washington, DC, USA,2000.
[60]Webster F V. Traffic signals settings[J]. Road Research Technical Paper No.39, Her Majesty's Stationery Office, London,1958.
[61]王园园.交通影响分析中考虑交叉口延误的交通分配[D].同济大学,2008
[62]Zion M, List G F, Manning C. Testing delay models with field data for four-way, stop sign controlled intersections[J]. Transpn. Res. Rec,1989,1225,83-90.
[63]K.yte M. All-way stop-controlled intersections:draft procedures for capacity and level of service analysis[J]. Department of Civil Engineering, University of Idaho,1989.
[64]Kyte M, Marek J. Estimating capacity and delay at a single-lane approach, all-way stop-controlled intersection[J]. Transpn. Res. Rec.1989,1225,73-82.
[65]Bellman R E. On a routing problem[J]. Quarterly Applied Mathematics,1958,16: 87-90.
[66]Caldwell T. On finding minimal route in a network with turning penalties[J]. Communications of the ACM,1961,4:107-108.
[67]Kirby R F, Potts R B. The minimum route problem for networks with turn penalties and prohibitions[J]. Transportation Research,1969,3:397-408.
[68]Ziliaskopoulos A K, Mahmassani H S. A note on least time path computation considering delays and prohibitions for intersection movements[J]. Transportation Research B,1996,30(5):359-367.
[69]De la Barra T. Integrated land use and transport modeling[M]. Cambridge University Press,1989:65-87.
[70]Lenner D, Pretolanid D. Auction algorithm for shortest hyper path problems[J]. Technical Report. Camerina University,1998.
[71]杜牧青,程琳.考虑交叉口转向延误的最短路径拍卖算法[J].西南交通大学报,2010,45(2)：249-254.
[2]2009长沙市交通状况年度报告[R], www.tranbbs.com,2009.
[3]Vasquez, Gabriel M., Taylor, Maureen. What cultural values influence American public relations practitioners[J]. Public Relations Review,1999,25 (4):433-449.
[4]Davies, Marin J. One-way traffic[J]. Trends in Biotechnology,2001,19 (7): 244-260.
[5]吴元祥.单向交通网络系统分析[J].科技管理,1999：25-28.
[6]李荣波.关于单向交通通行能力的探讨[J].中国市政工程,1998,3：1-6.
[7]马俊来,王炜,边扬.单向交通条件下信号交叉口1通行能力通行能力计算方法[J].公路交通科技,2005,22(4)：103-107.
[8]裴玉龙,伊新苗.城市单向交通组织方案规划及其评价研究[J].东北公路,2003,26(3)：118-120.
[9]赖比尔.城市道路单向交通规划研究[D].西安：西安公路交通大学,2000.
[10]朱桃丽.城市道路单向交通方案设计研究[D].长沙：湖南大学,2007.
[11]王玉娥.城市道路单单向交通方案技术评价研究[D].长沙：湖南大学,2008.
[12]李然然.单向交通组织绕行影响分析[D].西安：西南交通大学,2010.
[13]Robbins H E. A theorem on graphs with an application to a problem of traffic control[J]. American Math Monthly,1939,46:281-283.
[14]Roberts F S. Discrete mathematical models with applications to social biological and environmental problems[M]. Prentice-Hall, Englewood Cliffs, NJ,1976.
[15]Boesch F, Tindel R. Robbins" theorem for mixed graphs[J]. Amer Math Monthly, 1980,87:716-719.
[16]Chung F R K, Garey M R, Tarjian R E. Strongly connected orientations of mixed multi-graphs[J]. Networks,1985,15:477-484.
[17]Roberts F S, Xu Y. On the optimal strongly connected orientation of city street graphs I:large grids[J]. Siamj Disc Math,1988,1:199-222.
[18]Roberts F S, Xu Y. On the optimal strongly connected orientations of city street graphs II:two east-west avenues or north-south streets[J]. Networks,1989,19: 221-233.
[19]Roberts F S, Xu Y. On the optimal strongly connected orientations of city street graphs III:three east-west avenues or north-south streets[J], Networks,1992,22: 109-143.
[20]Drezner Z, Wesolowsky G O. Selecting an optimum configuration of one-way and two-way routes. Transportation Science,1997,31:386-384.
[21]Drezner Z, Salhi S. Selecting a good configurations of one-way and two-way routes using tabu search[J]. Control Cybernet,2000,29:725-740.
[22]李岚.城市道路单向交通设置方法研究[D].吉林：吉林大学,2001.
[23]魏广奇.城市单向道路定向方法研究[D].长沙：长沙理工大学,2005.
[24]吴薇薇,宁宣熙.城市街道网单行道改造方案的评估[J].系统工程理论与实践,2009,29(7)：153-159.
[25]Wolshon B, Urbna E, Levitan M. National view of hurricane evacuation plans and policies:a comparison and state practice[J]. Transportation Research, Part A, 2003,37(3):257-275.
[26]Kim S, Shekhar S. Contraflow network reconfiguration for evacuation planning: A summary of results[C]. Proceeding of the 13rd Annual ACM International Workshop on Geographic Information Systems, Bremen,2005, New York:ACM Press,2005:250-259.
[27]Kim S, Shekhar S. Contraflow transportation network reconfiguration for evacuation route planning[R]. IEEE Transaction on Knowledge and data engineering,2008,20(8):1115-1129.
[28]Thomas J, Justin P. A network flow model for lane-based evacuation routing[J]. Transportation Research Part A,2003,37,579-604.
[29]Liu Y, Lai X L et al. Two-level integrated optimization system for planning of emergency evacuation[J]. Journal of Transportation Engineering,2006,800-809.
[30]Georgios K, Srinivas P. Planning for evacuation:insights from an efficient network design model[J]. Journal of Infrastructure System,2009,21-30.
[31]严新平，吕超能等.大型活动后车道单行优化的双层舰划[J].西南交通大学学报,2009,44(1)：112-117.
[32]吴兵,李晔.交通管理与控制[M].北京：人民交通出版社,2005.
[33]王克新.充分发挥单向交通管理优势解决城市的交通拥堵.新疆工学院学报,1999,(3)：214-217.
[34]Development Consulting Group, Typlan Consulting Ltd. One way couplets impact analysis final report[R]. Prepared for Downtown Kelowna Association, Kelowna, Southern British Columbia, Canada,2003.
[35]张宇飞.城市单向交通组织的发展和特点[J].中国市政工程,2003,(5)：5-7.
[36]高臣辉.青岛市单向交通盘活了城市道路资源[J].科技成果纵横：33.
[37]夏海平,薛美根.上海市单向交通系统综合分析研究[C].现代化道路交通管理发展与展望——第八届多国城市交通学术会议论文集,2003
[38]于晓淦.南京市城市交通效益分析和发展对策[J].交通与计算机,2007,5：110-113.
[39]Schwigher C M, Leary, Fulton T H. Central business district traffic circulation improvement-a case study:Salina, Kansas[C]//69th Annual Meeting of the Institute of Transportation Engineers,1999.
[40]瞿忠民.道路交通组织优化[M].北京：人民交通出版社,2004.
[41]GA/T486-2004,城市道路单向交通组织原则[S].北京：中国标准出版社,2004.
[42]赵升.城市道路单向交通影响、规划及综合评价研究[D].成都：西南交通大学,2004.
[43]CJJ 37-90,城市道路设计规范[S].北京：中国标准出版社,2004.
[44]石飞.城市道路等级级配及布局方法研究[D].南京：东南大学博士学位论文,2006.
[45]Michael C P. The supply of residential access streets and secondary arterial roads[J]. Transportation Research Part B:Methodological,1980,14(1):121-132.
[46]Radnor J P, Norman J A, Paul H W. Transportation engineering planning and design[J]. John Wiley & Songs in Corporated.1982.
[47]刘望保.国内外城市交通微循环和支路网的研究进展和展望[J].规划师，2009,6(25)：21-24.
[48]黄恩厚.城市道路交通微循环系统改扩建优化理论与方法[D].长沙：中南大学,2009.
[49]Ben-Ayed O, Blair C E. Computational difficulties of Bi-level Linear Programming[J]. Operation Research,1990,38:556-559.
[50]Yang H, Bell M G H. Models and algorithms for road network design:a review and some new developments[J]. Transport Review,1998,18(3):257-278.
[51]Yang H and Meng Q. Highway pricing and capacity choice in a road network under a build-operate-transfer scheme[J]. Transportation Research-A,2000,34: 207-222.
[52]Moore J T and Bard J F. The mixed integer bi-level programming problem[J]. Operations Research,1990,38:911-921.
[53]Edmunds T A and Bard J F. An algorithm for the mixed-Integer nonlinear bi-level programming problem[J]. Annals of Operation Research,1992,34:149-162.
[54]Metropolis N, Rosenbluth A, Rosenbluth M et al. Equation of state calculations by fast computing machines[J]. Journal of Chemical Physics,1953, 21:1087-1092.
[55]Kirkpatrick S, Gelatt Jr C D, Vecchi M P. Optimization by simulation annealing[J]. Science,1983,220:671-680.
[56]Fabian V. Simulated annealing simulated[J]. Computers Math. Applc.1997, 33(1/2):1-94.
[57]任刚.交通管理措施下的交通分配模型与算法[M].南京：东南大学出版社,2007，96-100.
[58]Nathan H G, Ajay K R. Monograph on traffic flow theory[J]. USA:The Federal Highway Administration,1996.
[59]Highway capacity manual 2000.Transportation Research Board. National Research Council, Washington, DC, USA,2000.
[60]Webster F V. Traffic signals settings[J]. Road Research Technical Paper No.39, Her Majesty's Stationery Office, London,1958.
[61]王园园.交通影响分析中考虑交叉口延误的交通分配[D].同济大学,2008
[62]Zion M, List G F, Manning C. Testing delay models with field data for four-way, stop sign controlled intersections[J]. Transpn. Res. Rec,1989,1225,83-90.
[63]K.yte M. All-way stop-controlled intersections:draft procedures for capacity and level of service analysis[J]. Department of Civil Engineering, University of Idaho,1989.
[64]Kyte M, Marek J. Estimating capacity and delay at a single-lane approach, all-way stop-controlled intersection[J]. Transpn. Res. Rec.1989,1225,73-82.
[65]Bellman R E. On a routing problem[J]. Quarterly Applied Mathematics,1958,16: 87-90.
[66]Caldwell T. On finding minimal route in a network with turning penalties[J]. Communications of the ACM,1961,4:107-108.
[67]Kirby R F, Potts R B. The minimum route problem for networks with turn penalties and prohibitions[J]. Transportation Research,1969,3:397-408.
[68]Ziliaskopoulos A K, Mahmassani H S. A note on least time path computation considering delays and prohibitions for intersection movements[J]. Transportation Research B,1996,30(5):359-367.
[69]De la Barra T. Integrated land use and transport modeling[M]. Cambridge University Press,1989:65-87.
[70]Lenner D, Pretolanid D. Auction algorithm for shortest hyper path problems[J]. Technical Report. Camerina University,1998.
[71]杜牧青,程琳.考虑交叉口转向延误的最短路径拍卖算法[J].西南交通大学报,2010,45(2)：249-254.