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

Application of Tabu Search Algorithm on the Scheduling Problem of Shunting Locomotive

作　　者：王烁[1] 何世伟[1] 黎浩东[1] 申永生[1] 

机构地区：[1]北京交通大学交通运输学院,北京100044

出　　处：《铁道运输与经济》2011年第2期83-87,共5页Railway Transport and Economy

基　　金：国家自然科学基金项目(60776825);北京交通大学优秀博士生创新基金(141076522);北京交通大学研究生创新项目(2009YJS042)

摘　　要：在分析论述调机运用计划编制方法的基础上,提出应用禁忌搜索算法进行编组站调机运用计划的编制。分别以最小化延迟解体列车和编组列车加权数量为目标建立数学模型,以解编顺序作为优化对象,设计禁忌搜索算法对其进行求解,并以解体顺序为例,采用两两交换(2-opt)方式构建邻域,以该操作前后列车解体顺序的变化作为禁忌对象构建禁忌表,利用软件编程实现模型计算,并通过算例验证该算法的可行性和有效性。Based on analyzing the scheduling method of shunting locomotive,this paper puts forward the scheduling plan by using tabu search algorithm.Establishing the mathematical model by taking the minimized weighted number of tardy uncoupling and formation trains as targets,and designing the tabu search algorithm to make solution by taking the sequence of train uncoupling as optimized object.Then the tabu search algorithm is designed to make solution by using 2-opt strategy with example of sequence of uncoupling,and the tabu table was established by taking the change of breaking up sequence before and after the operation as tabu object,and the model calculation was realized by using software programme.The algorithm was proved feasible and effective by the examples.

关 键 词：编组站 调机运用计划 解编顺序 禁忌搜索算法 

分 类 号：U268.2[机械工程—车辆工程]