吉林大学学报(工学版) ›› 2011, Vol. 41 ›› Issue (增刊1): 81-84.

• paper • Previous Articles     Next Articles

Transit efficiency network design model based on the restriction of station capacity

ZHAO Shu-zhi, TIAN Qing-fei, CAO Yang   

  1. College of Transportation, Jilin University, Changchun 130022, China
  • Received:2010-11-09 Online:2011-09-01 Published:2011-09-01

Abstract:

In order to solve the problem of transit efficiency network design,this thesis firstly proposes a network weighting function based on the definition of transportation efficiency.The k-shortest paths algorithm is applied to search efficiency lines and the line with the highest transportation efficiency is selected to be layed on the road nerwork.When updating the OD matrix,the station capacity with control coefficient and proximity principle are used to assign overload passenger flow.The model is applied to transit network plan of Meihekou.It is shown that the transportation efficiency of transit network designed is highest and the network meets the correlative design norms.Therefore,the model has a high theoretical value and practical meaning.

Key words: traffic and transportation engineering, transit network design, transportation efficiency, station capacity, k-shortest paths

CLC Number: 

  • U491.1


[1] 王炜,杨新苗,陈学武。城市公共交通系统规划方法与管理技术
[M].北京:科学出版社,2002:61-95.

[2] 韩印,李维斌,李晓峰,等。城市公交线网调整优化PSO算法
[J].中国公路学报,1999,12(3):100-104.H an Yin,Li Wei-bin,Li Xiao-feng,et al.The algorithm PSO of adjustment and optimization for publict raffic network
[J].China Journal of Highway and Transport,1999,12(3):100-104.

[3] Anita Sch & #246;bel.Locating stops along bus or railway lines abicriteria problem
[J].Annals of Operations Research,2005,136:211-227.

[4] Gleason J M.Set covering approach to the location of express bus stops
[J].Omega,1973,3:605-608.

[5] 雷中林。铁路路网系统运输能力理论与计算方法研究
[D].北京:北京交通大学交通运输学院,2006.Lei Zhong-lin.Research on the theory and calculatingm ethods of railway network carrying capacity
[D].Beijing:School of Traffic & TransPortation,Beijing Jiaotong University,2006.

[6] 高鹏。动态限制搜索区域的带约束k-最优路径算法 研究
[D].长春:吉林大学交通学院,2009.Gao Peng.Research on the constrained k-shor test paths algorithm within a dynamic restricted searching area
[D].Changchun:College of Transportation,Jilin University,2009.

[7] 白轶多,胡鹏,夏兰芳,等。关于k次短路径问题的分析与求解
[J].武汉大学学报:信息科学版,2009,34 (4):492-494. Bai Yi-duo,Hu Peng,Xia Lan-fang,et al.A kthshortest path algorithm based on k-1shortest paths
[J].Journal of Wuhan University(Geomatics and Information Science Edition),2009,34(4):492-494.

[8] 朱永刚。城市公交网络设计与优化方法研究
[D].长春:吉林大学交通学院,2010. Zhu Yong-gang.Research on network design and optimization method of urban public transportation
[D].Changchun:College of Transportation,Jilin University,2010.

[9] 费舍里桦。城市交通
[M].任福田译。北京:中国建筑 工业出版社,1984.

[10] 董振海。精通MATLAB7编程与数据库应用
[M]. 北京:电子工业出版社,2007.

[1] LI Shi-wu, XU Yi, SUN Wen-cai, WANG Lin-hong, GUO Meng-zhu, CHAI Meng. Pupil diameter based construction conflict self-feedback discrimination method [J]. 吉林大学学报(工学版), 2016, 46(2): 418-425.
[2] ZHU Jin-cheng, XIAO Feng, SHUAI Bin, LIU Xiao-bo. Impact and feasibility of charging taxis in pricing zone [J]. 吉林大学学报(工学版), 2015, 45(1): 89-96.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!