• 查询稿件
  • 获取最新论文
  • 知晓行业信息
叶红霞. 基于分层递进衔接的城市轨道交通网络末班车时间优化研究与实践[J]. 铁路计算机应用, 2018, 27(6): 62-66.
引用本文: 叶红霞. 基于分层递进衔接的城市轨道交通网络末班车时间优化研究与实践[J]. 铁路计算机应用, 2018, 27(6): 62-66.
YE Hongxia. Optimization of connection scheme for last trains in urban rail transit network based on hierarchical progressive convergence[J]. Railway Computer Application, 2018, 27(6): 62-66.
Citation: YE Hongxia. Optimization of connection scheme for last trains in urban rail transit network based on hierarchical progressive convergence[J]. Railway Computer Application, 2018, 27(6): 62-66.

基于分层递进衔接的城市轨道交通网络末班车时间优化研究与实践

Optimization of connection scheme for last trains in urban rail transit network based on hierarchical progressive convergence

  • 摘要: 在城市轨道交通网络化运营和“一票制换乘”的条件下,末班车乘客购票进站后因换乘失败而无法抵达目的地的现象时有发生。为最大程度满足末班车乘客的出行需求,基于分层递进衔接的思路,根据各线路与基准线路的换乘关系划分协调层次,基于网络末班车换乘客流流量和流向确定协调主方向,按照协调层次建立末班车时间推算模型,并从特定衔接方向和发车时间域两个方面对模型进行优化。对广州城市轨道交通网络末班车时间进行推算和优化的结果表明,优化后的末班车时间能更好地适应末班车乘客的出行需求,验证了模型和优化方法的有效性。

     

    Abstract: On the condition of urban rail transit network operation and “one vote transfer”, it often occurs that passengers in the last train are unable to reach the destination because of the transfer failure. This paper adopted the thought of hierarchical progressive convergence, coordinated the division level based on relationships between reference line and other lines. Based on the last train transfer passenger flow and direction, a model of the last train time schedule was established according to the hierarchical coordination. The model was optimized in two aspects: specific direction of connection and departure time intervals. The paper calculated and optimized the last train time schedule in Guangzhou urban rail transit network. The result shows that the optimized last train time can better adapt to the last trains passenger travel demand, and verifies the validity of the model and optimization method.

     

/

返回文章
返回