禁忌搜索算法在编组站调机运用计划中的应用.PDFVIP

禁忌搜索算法在编组站调机运用计划中的应用 1 王烁 何世伟 黎浩东 申永生 （北京交通大学 交通运输学院 北京，100044） 摘要: 确定列车的解编顺序是编制编组站阶段计划的核心内容之一。本文研究了调机运用计划的优化编制 问题，以解编顺序作为优化对象，分别以最小化延迟解体列车加权数量和最小化延迟编组列车加权数量为 目标建立了数学模型，并设计一种禁忌搜索算法对其进行求解，以解体顺序为例，采用2-opt方式构建邻域， 同时以2-opt操作前后列车解体顺序的变化作为禁忌对象构建禁忌表，运用VC++6.0编程实现。最后设计算 例对模型和算法进行了验证，计算结果表明，所设计的禁忌搜索算法可以取得较理想的结果，为编组站调 机运用计划的优化编制提供了一种解决途径。 关键词:编组站；调机运用；解编顺序；禁忌搜索算法 Tabu Search Algorithm for the Scheduling Problem of Shunting Locomotive Wang Shuo He Shiwei Li Haodong Shen Yongsheng (School of Traffic and Transportation, Beijing JiaoTong University, Beijing, 100044, China) Abstract: To identify the sequence of train breaking up and making up is the key problem of phase plan in marshalling station. Taking the sequence of train breaking up and making up as the decision, this paper studies the optimization of the scheduling problem of shunting locomotive, mathematical model that minimizing the total number of weighted tardy trains of breaking up and making up has been proposed. Then the tabu search algorithm with 2-opt strategy has been designed which takes the sequence of breaking up as example, the tabu object is the change of sequence of breaking up. A computational example has also been presented to validate the model and algorithm. The computational example indicates that the tabu search algorithm designed in this paper can produce a very good dispatching plan, which provides a new way for the computer-aided scheduling of shunting locomotives. Key words: marshalling station, scheduling problem of shunting locomotive, sequence of train breaking up and making up