摘要
城市轨道交通网络形成之后,为实施"一票换乘"需建立轨道交通自动售检票清算管理中心,进行客流信息统计和票务收入清分,而清分的核心在于解决客流在网络上的分布问题。本文结合城市轨道交通系统的基本特性,提出一种考虑乘客多路径出行选择的客流概率分布模型,并设计基于深度优先的路径搜索算法。该模型既体现了乘客出行阻抗最小化的选择心理,又反映了路径多样化的实际情况,具有较强的实用性。最后通过北京轨道交通网络实际客流数据验证模型和算法的有效性。
Under the condition of urban rail transit network operation with one-ticket transfer, the AFC Clearing Center (ACC) needs to be established to solve the problems of passenger volume statistics and ticket fare clearing, the core of which lies in distribution of passenger flow. Thus, the paper puts forward a passenger flow distribution model for urban rail transit network considering multi-route choice, which meets the passenger's psychology of minimum cost and also reflects the fact of path-selecting multiplicity, and then proposes an algorithm for available path searching based on depth-first in the graph theory. Finally the model and algorithm are verified with the data from the Beijing urban rail transit network.
出处
《铁道学报》
EI
CAS
CSCD
北大核心
2009年第2期110-114,共5页
Journal of the China Railway Society
关键词
城市轨道交通
客流分布
多路径分配
出行阻抗
K短路搜索
urban rail transit
passenger flow distribution
multi-route assignment
travel cost
K shortest paths search