基于里程最大化的动车组交路计划优化方法
|
摘要
动车组交路计划是编制动车组运用计划与检修计划的重要基础,对于加强动车组的运营管理具有重要作用。针对动车组交路计划编制的问题,主要在动车组一级检修的里程周期和时间周期的约束下,以动车组运行里程最大化和列车车次接续时间最小化为优化目标,构建了动车组交路计划优化的0-1整数规划模型。在此基础上,设计了交路计划优化编制的算例,并采用Lingo软件对模型进行求解,优化结果验证了模型的有效性。
Electric Multiple Unit(EMU) routing scheduling is an important foundation of the EMU operation and maintenance plan, and it plays an important role in strengthening the operational management of EMU. This article focused on the problem of EMU routing scheduling, proposed a 0-1 mixed-integer programming model. The model was mainly taken the mileage and time cycle of EMU routine maintenance as the constraints, aimed at maximizing the running mileage and minimizing the total connection time of EMU. On this base, an example of optimizing the EMU routing scheduling was designed which was solved by the software of Lingo, and computed result verified the validity of the model.
Electric Multiple Unit(EMU) routing scheduling is an important foundation of the EMU operation and maintenance plan, and it plays an important role in strengthening the operational management of EMU. This article focused on the problem of EMU routing scheduling, proposed a 0-1 mixed-integer programming model. The model was mainly taken the mileage and time cycle of EMU routine maintenance as the constraints, aimed at maximizing the running mileage and minimizing the total connection time of EMU. On this base, an example of optimizing the EMU routing scheduling was designed which was solved by the software of Lingo, and computed result verified the validity of the model.
引文
[1]苗建瑞,王莹,杨肇夏.基于最优接续网络的动车组交路计划优化模型与算法研究[J].铁道学报,2010,32(2):1-7.
[2]李华,韩宝明,张琦,等.动车组交路计划优化模型与算法研究[J].铁道学报,2013,35(3):1-8.
[3]王忠凯.动车组运用检修计划优化方法的研究[D].北京:中国铁道科学研究院,2012.
[4]杨文韬,周强.客运专线动车组交路计划模型研究[J].铁道运输与经济,2013,(12):30-36.
[5]黄兴亮.动车组交路计划编制优化理论与方法研究[D].成都:西南交通大学,2009.
[6]PJ Fioole,L Kroon,G Maróti,et al.A rolling stock circulation model for combining and splitting of passenger trains[J].European Journal of Operational Research,2006,174(2):1281–1297.
[7]A Alfieri,R Groot,L Kroon,et al.Efficient Circulation of Railway Rolling Stock[J].TRANSPORTATION SCIENCE,2006,40(30):378-391.
[8]SP Hong,KM Kim,K Lee,et al.A pragmatic algorithm for the train-set routing:The case of Korea high-speed railway[J].2009,37(3):637-645.
[9]王继强.基于LINGO的旅行商问题的建模方法[J].计算机工程与科学,2014,36(5):947-950.
[10]I Kara,T Bektas.Integer linear programming formulations of multiple salesman problems and its variation[J].European Journal of Operational Research,2006,174(3):1449-1458.
[2]李华,韩宝明,张琦,等.动车组交路计划优化模型与算法研究[J].铁道学报,2013,35(3):1-8.
[3]王忠凯.动车组运用检修计划优化方法的研究[D].北京:中国铁道科学研究院,2012.
[4]杨文韬,周强.客运专线动车组交路计划模型研究[J].铁道运输与经济,2013,(12):30-36.
[5]黄兴亮.动车组交路计划编制优化理论与方法研究[D].成都:西南交通大学,2009.
[6]PJ Fioole,L Kroon,G Maróti,et al.A rolling stock circulation model for combining and splitting of passenger trains[J].European Journal of Operational Research,2006,174(2):1281–1297.
[7]A Alfieri,R Groot,L Kroon,et al.Efficient Circulation of Railway Rolling Stock[J].TRANSPORTATION SCIENCE,2006,40(30):378-391.
[8]SP Hong,KM Kim,K Lee,et al.A pragmatic algorithm for the train-set routing:The case of Korea high-speed railway[J].2009,37(3):637-645.
[9]王继强.基于LINGO的旅行商问题的建模方法[J].计算机工程与科学,2014,36(5):947-950.
[10]I Kara,T Bektas.Integer linear programming formulations of multiple salesman problems and its variation[J].European Journal of Operational Research,2006,174(3):1449-1458.