城市轨道交通网络中断下的有效路径搜索模型

doi:10.3969/j.issn.1002-0268.2015.10.016

Abstract
Figure/Table
References (0)
Related Citation (15)

Abstract A valid path searching method was applied in an interrupted urban rail transit network line to determine a rapid, accurate, and easy path for evacuating stranded passengers. The method is based on the established urban rail transit network model and considers the characteristics of interrupted rail networks. Valid paths were redefined with constraint conditions, such as fault points, maximum transfer times, and generalized cost. The depth-first algorithm was also improved, and the valid path searching model for interrupted urban rail transit network lines was established. The model was validated in Shanghai Metro Network, an interrupted urban rail transit, by using the C# programming language. Results show that when People Square station is interrupted, five valid paths can be searched between Shanghai West Railway station and Pudong International Airport station with constraints.

Key words： traffic engineering urban rail transit valid path depth-first

Received: 10 June 2015

Fund:Supported by the National Nature Science Foundation of China (No.51208261):the Scientific Research Project of School of Wentian of Hohai University (No.WT15003)

Corresponding Authors: HAN Xue,E-mail address:hanxue_echo@163.com E-mail: hanxue_echo@163.com

	Service

	E-mail this article
	Add to my bookshelf
	Add to citation manager
	E-mail Alert
	RSS
	Articles by authors
	HAN Xue
	WANG Di
	LIU Ying-shun
	GUO Tang-yi

Cite this article:

HAN Xue,WANG Di,LIU Ying-shun, et al. Valid Path Searching of an Interrupted Urban Rail Transit Network[J]. Journal of Highway and Transportation Research and Development, 2016, 10(2): 79-83.

URL:

http://manu27.magtech.com.cn/Jwk_gljtkj_en/EN/10.3969/j.issn.1002-0268.2015.10.016 OR http://manu27.magtech.com.cn/Jwk_gljtkj_en/EN/Y2016/V10/I2/79

[1] DIAL R B. A Probabilistic Multi-Path Traffic Assignment Model Which Obviates the Need for Path Enumeration[J]. Transportation Research, 1971,5(2):83-111.
[2] LI Jing, PENG Guo-xiong, ZANG Yi-wen, et al. An Improved Multi-path Assignment Model and Alorithms Design[J]. Systems Engineering-Theory & Practice, 2001, 21(9):130-134. (in Chinese)
[3] LOZAN A, STORCHI G. Shortest Viable Hyper Path in Multimodal Networks[J]. Transportation Research Part B, 2002, 36(10):853-874.
[4] NIU Xue-qin, WANG Wei. Study on the Model of Transit Network Multi-path Assignment Based on Shortest Path Search[J]. Journal of Southeast University:Natural Science Edition, 2002, 32(6):917-919. (in Chinese)
[5] WEI Hang, PU Yun, LI Jun. An Approach to Biobjective Shortest Path[J]. Systems Engineering, 2005, 23(7):113-117. (in Chinese)
[6] ZHANG Xiao-ning, LIN Hang-fei, CHEN Xiao-hong. An Application of Residual Shortest Route Algorithm in Traffic OD Survey[J]. Journal of Tongji University:Natural Science Edition, 2006, 34(10):1335-1339. (in Chinese)
[7] HAO Guang, ZHANG Dian-ye, FENG Xun-sheng,et al. Model and Algorithm for Shortest Path of Multiple Objectives[J]. Journal of Southwest Jiaotong University, 2007,42(5):641-646. (in Chinese)
[8] HOU Li-wen, JIANG Fu. Method of Traffic Allocation Based on Ant Algorithm and Its Application[J]. Journal of Shanghai Jiaotong University, 2001, 35(6):930-933. (in Chinese)
[9] LI Zhi-chun, HUANG Hai-jun. Determining the Efficient Paths in Stochastic Traffic Assignment[J]. Journal of Transportation Systems Engineering and Information Technology, 2003, 3(1):28-32. (in Chinese)
[10] ZHANG Bo, YE Jia-wei, HU Yu-cong, et al. Application of Optimizing the Path by Simulated Annealing[J]. China Journal of Highway and Transport, 2004, 17(1):79-81. (in Chinese)
[11] YUE Yi-xiang, ZHOU Lei-shan, YUE Qun-xing,et al. Improved ant Colony Algorithm for Logistics Distribution Routing Problem[J]. Computer Integrated Manufacturing Systems, 2006, 12(6):905-910. (in Chinese)