检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李登辉 彭其渊[1,2] 赵军[1,2] 张子悦[1,2] 张永祥 LI Denghui;PENG Qiyuan;ZHAO Jun;ZHANG Ziyue;ZHANG Yongxiang(School of Transportation and Logistics,Southwest Jiaotong University,Chengdu 611756,China;National United Engineering Laboratory of Integrated and Intelligent Transportation,Southwest Jiaotong University,Chengdu 611756,China)
机构地区:[1]西南交通大学交通运输与物流学院,四川成都611756 [2]西南交通大学综合交通运输智能化国家地方联合工程实验室,四川成都611756
出 处:《铁道学报》2024年第12期8-21,共14页Journal of the China Railway Society
基 金:国家重点研发计划(2022YFB4300502);国家自然科学基金(52272325);四川省自然科学基金(2023NSFSC0390,2023NSFSC0901)。
摘 要:考虑停运列车、调整列车到发时刻和顺序等调整措施,研究含多条线路并开行若干跨线列车的高速铁路网络在区间能力完全丧失下的列车运行调整问题。基于在运行图中“抽线-插线”的思想,通过提前为列车在途经区间生成若干备选运行线,构建整数线性规划模型;充分考虑车站平面布置,提出适应路网条件下更为准确的车站能力建模方法。设计两阶段算法进行求解:第1阶段不考虑列车非作业停站的起停附加时分,构建混合整数线性规划模型,确定列车到发顺序和停运情况;第2阶段基于阶段1得到的列车到发顺序,全面考虑起停附加时分,构建整数线性规划模型,重新对未停运列车在途经车站的到发时刻进行优化。以含164个车站、829列列车的网络为背景,构造一组含单点和多点干扰的大规模切实算例,对所提出方法的性能和实用性进行验证。This paper studied a train rescheduling problem in a high-speed railway network(including multiple lines and operating multiple cross-line trains)under complete section blockage,by considering measures such as cancelling trains,adjusting train arrival and departure times and sequences.Based on the idea of“Timetable Deletion-Insertion”,the problem was formulated into an integer linear programming model by pre-generating a set of alternative trips for each section visited by each train.Through fully considering the station layout,a more accurate modelling method that adapts to the network conditions was proposed for the station capacity.A two-stage algorithm was developed to solve the model.In the first stage,a mixed integer linear programming model was formulated to determine the arrival-departure sequence and cancellation of trains without considering the acceleration and deceleration times of trains caused by their unplanned stops.In the second stage,with the train arrival-departure sequence obtained by the first stage as input,an integer linear programming model where the train acceleration and deceleration times were completely considered was built to re-optimize the departure and arrival times at stations visited by uncancelled trains.A set of large-scale realistic instances with single and multiple disruption(s)based on a network consisting of 164 stations and 829 trains were constructed to verify the performance and practicality of the proposed algorithm.
关 键 词:高速铁路调度 列车运行调整 路网 整数线性规划 两阶段算法
分 类 号:U292.4[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3