• 查询稿件
  • 获取最新论文
  • 知晓行业信息
李建, 林柏梁, 武建平. 基于里程最大化的动车组交路计划优化方法[J]. 铁路计算机应用, 2017, 26(7): 32-36.
引用本文: 李建, 林柏梁, 武建平. 基于里程最大化的动车组交路计划优化方法[J]. 铁路计算机应用, 2017, 26(7): 32-36.
LI Jian, LIN Boliang, WU Jianping. Optimization method for EMU routing scheduling based on maximum running mileage[J]. Railway Computer Application, 2017, 26(7): 32-36.
Citation: LI Jian, LIN Boliang, WU Jianping. Optimization method for EMU routing scheduling based on maximum running mileage[J]. Railway Computer Application, 2017, 26(7): 32-36.

基于里程最大化的动车组交路计划优化方法

Optimization method for EMU routing scheduling based on maximum running mileage

  • 摘要: 动车组交路计划是编制动车组运用计划与检修计划的重要基础,对于加强动车组的运营管理具有重要作用。针对动车组交路计划编制的问题,主要在动车组一级检修的里程周期和时间周期的约束下,以动车组运行里程最大化和列车车次接续时间最小化为优化目标,构建了动车组交路计划优化的0-1整数规划模型。在此基础上,设计了交路计划优化编制的算例,并采用Lingo软件对模型进行求解,优化结果验证了模型的有效性。

     

    Abstract: 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.

     

/

返回文章
返回