交通运输系统工程与信息

交通运输系统工程与信息 ›› 2022, Vol. 22 ›› Issue (5): 125-134.DOI: 10.16097/j.cnki.1009-6744.2022.05.013

• 系统工程理论与方法 • 上一篇    下一篇

考虑换乘异质性的城市轨道交通时刻表协同优化模型

孙会君，代佩伶，郭欣*   

  1. 北京交通大学，综合交通运输大数据应用技术交通运输行业重点实验室，北京 100044
  • 收稿日期:2022-05-26 修回日期:2022-07-19 接受日期:2022-07-21 出版日期:2022-10-25 发布日期:2022-10-21
  • 作者简介:孙会君(1974- )，女，河北衡水人，教授，博士。
  • 基金资助:
    国家自然科学基金；111引智计划

Train Timetable Collaborative Optimization Model Considering Transfer Heterogeneity for Urban Rail Transit System

SUN Hui-jun, DAI Pei-ling, GUO Xin*   

  1. Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport, Beijing Jiaotong University, Beijing 100044, China
  • Received:2022-05-26 Revised:2022-07-19 Accepted:2022-07-21 Online:2022-10-25 Published:2022-10-21
  • Supported by:
    National Natural Science Foundation of China (72171020，72101013)；The 111 Project (B20071)

PDF

摘要： 在城市轨道交通网络化运营条件下，极易导致换乘站的换乘需求差异过大。为提高列车时刻表与换乘需求的匹配度，本文基于网络中换乘站的空间拓扑结构和换乘需求在时间和方向上的特点，通过构建量化换乘差异的协同度指标，建立以列车同步次数最大化为目标的列车时刻表优化模型，优化轨道交通网络线路间成功衔接次数，提升乘客换乘出行效率。针对提出的混合 整数非线性规划模型，本文设计了一种基于天牛须搜索的粒子群优化算法进行求解，并将模型及算法应用于北京市轨道交通网络进行算例分析。结果表明，所构建的模型能依据换乘需求在空间、时间及方向上的差异，利用协同度分级优化轨道交通路网中列车协同状态；优化后全网列车同步到达次数增加33.86%，乘客平均换乘等待时间减少22.75%；相较于PSO和BAS算法，本文所提的算法具有更好的全局搜索能力和求解效率。本文可有效提高轨道交通换乘效率，为提升城 市轨道交通服务质量提供理论参考。

关键词: 城市交通, 协同度, 天牛须搜索算法, 列车时刻表

Abstract: Under the background of urban rail transit network operation, there exists significant heterogeneity of transfer demand at the transfer stations. This paper develops the indicator of coordination degree to quantify transfer heterogeneity, according to the transit network topological characteristic of the transfer stations, and various transfer demands at different times and directions. Then, a train timetable optimization model is built to optimize the number of train synchronization and improve passenger transfer efficiency. Besides, a particle swarm optimization algorithm based on the beetle antennae search is designed to solve the proposed mixed-integer nonlinear programming model. We then test our approaches by a case study of the Beijing rail transit network. The results show that (1) the presented model can optimize the train coordination for the urban rail transit network based on the indicator of coordination degree, (2) the number of train synchronization can be improved by 33.86% and the average passenger waiting time can be reduced by 22.75%, and (3) the designed algorithm is of better performance than the primary PSO and BAS algorithms in the aspects of the global search ability and solving efficiency. Summarily, our approaches can significantly improve the efficiency of urban rail transit transfer and provide theoretical references for improving the quality of urban rail transit service.

Key words: urban traffic, coordination degree, beetle antennae search, train timetable

中图分类号: