首页 | 本学科首页   官方微博 | 高级检索  
     检索      

面向大客流的城轨备用车投放车站选择与优化模型
引用本文:叶茂,钱钟文,李俊铖,曹从咏.面向大客流的城轨备用车投放车站选择与优化模型[J].交通运输工程学报,2021,21(5):227-237.
作者姓名:叶茂  钱钟文  李俊铖  曹从咏
作者单位:1.南京理工大学 自动化学院,江苏 南京 2100942.南京理工大学 交通信息融合与系统控制工业和信息化部重点实验室,江苏 南京 2100943.广州地铁集团有限公司,广东 广州 510380
基金项目:国家重点研发计划项目2017YFB1201202江苏省交通运输科技项目2020Y17
摘    要:为快速疏解城轨线路上车站的大客流,减少乘客的等待时间,研究了备用车投放问题; 在考虑列车追踪关系、列车停站时间等约束的基础上,建立了综合备用车投放时机确定、投放最佳车站选择和时刻表动态调整的多目标优化模型; 界定了城轨备用车开行条件,提出了城轨备用车投放时机的定量化判定方法; 用0-1变量表征车站是否具备备用车投放条件,并将其作为模型输入,以减小大客流车站乘客等待时间和降低运行图偏离时间(延误时间)为优化目标,构建了备用车投放的混合整数非线性规划模型,该模型通过比较不同的备用车投放方案效率得到最佳的备用车投放车站和后续开行计划; 为同时求解0-1变量与连续变量,设计了带惩罚函数的改进粒子群优化算法求解模型。研究结果表明:该方法可对所有符合备用车开行条件的车站制定投放方案,并进一步筛选出最优的备用车投放车站,最多可减少1 318 209 s的乘客等待时间,优化效率为21.9%,且改进的粒子群优化算法对混合整数非线性规划模型的适用性较好; 相比于既有城轨线路列车运行调整和时刻表优化方法,本文提出的方法在应对突发大客流的备用车投放时机上做出了更加定量化的判断,优先考虑了大客流车站的疏解能力和效率,并优化了备用车与后续列车的开行方案,可以有效解决高峰时段车站大客流问题。 

关 键 词:城市轨道交通    备用车    多目标优化模型    粒子群优化算法    大客流    时刻表
收稿时间:2021-06-18

Selection and optimization model of standby train deployment stations on urban rail transit for large passenger flow
YE Mao,QIAN Zhong-wen,LI Jun-cheng,CAO Cong-yong.Selection and optimization model of standby train deployment stations on urban rail transit for large passenger flow[J].Journal of Traffic and Transportation Engineering,2021,21(5):227-237.
Authors:YE Mao  QIAN Zhong-wen  LI Jun-cheng  CAO Cong-yong
Institution:1.School of Automation, Nanjing University of Science and Technology, Nanjing 210094, Jiangsu, China2.MIIT Key Lab of Traffic Information Fusion and System Control, Nanjing University of Science and Technology, Nanjing 210094, Jiangsu, China3.Guangzhou Metro Group Co., Ltd., Guangzhou 510380, Guangdong, China
Abstract:In order to quickly relieve the large passenger flow of stations on urban rail transit lines and reduce the total waiting time of passengers, the problem of standby train deployment was studied. Based on the consideration of train tracking relationship, train dwelling time, and other constraints, a multi-objective optimization model was established to determine the timing of standby train deployment, select the best station, and dynamically adjust the schedule. The conditions for the deployment of standby trains were defined and a quantitative determination method for the timing of the standby train operation was proposed. A 0-1 variable was used to characterize whether the station was equipped for standby trains, and it was used as the model input. Then, a mixed integer nonlinear programming (MINP) model of standby train deployment was established to minimize the waiting time of passengers at the station with large passenger flow, and the deviation time (delay time) of the timetable was constructed. The model compared the efficiency of different standby train deployment schemes to get the best standby train deployment station and the subsequent operation plan. An improved particle swarm optimization algorithm with a penalty function was designed to deal with the 0-1 variable and continuous variables simultaneously. Research results show that the method can make plans for all stations satisfying the conditions of standby train deployment, and further select the best standby train stations from the alternative stations. The maximum total passenger waiting time reduces by 1 318 209 s, and the optimization efficiency reduces about 21.9%. Moreover, the improved particle swarm optimization algorithm has good applicability to the MINP model. Compared to the existing urban rail line train operation adjustment and schedule optimization methods, the proposed method provides a more quantitative judgment on the timing of the standby train deployment in response to large passenger flow situations. It provides the evacuation capacity and efficiency of stations with large passenger flow stations and optimizes the operation plans of the standby and subsequent trains. The problem of large passenger flows at stations during peak hours can be relieve effectively. 4 tabs, 9 figs, 30 refs. 
Keywords:
本文献已被 万方数据 等数据库收录!
点击此处可从《交通运输工程学报》浏览原始摘要信息
点击此处可从《交通运输工程学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号