首页 | 本学科首页   官方微博 | 高级检索  
     

禁忌搜索算法在编组站调机运用计划中的应用
引用本文:王烁,何世伟,黎浩东,申永生. 禁忌搜索算法在编组站调机运用计划中的应用[J]. 铁道运输与经济, 2011, 33(2): 83-87
作者姓名:王烁  何世伟  黎浩东  申永生
作者单位:北京交通大学,交通运输学院,北京,100044
基金项目:国家自然科学基金项目(60776825); 北京交通大学优秀博士生创新基金(141076522);北京交通大学研究生创新项目(2009YJS042)
摘    要:在分析论述调机运用计划编制方法的基础上,提出应用禁忌搜索算法进行编组站调机运用计划的编制。分别以最小化延迟解体列车和编组列车加权数量为目标建立数学模型,以解编顺序作为优化对象,设计禁忌搜索算法对其进行求解,并以解体顺序为例,采用两两交换(2-opt)方式构建邻域,以该操作前后列车解体顺序的变化作为禁忌对象构建禁忌表,利用软件编程实现模型计算,并通过算例验证该算法的可行性和有效性。

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

Application of Tabu Search Algorithm on the Scheduling Problem of Shunting Locomotive
WANG Shuo,HE Shi-wei,LI Hao-dong,SHEN Yong-sheng. Application of Tabu Search Algorithm on the Scheduling Problem of Shunting Locomotive[J]. Rail Way Transport and Economy, 2011, 33(2): 83-87
Authors:WANG Shuo  HE Shi-wei  LI Hao-dong  SHEN Yong-sheng
Affiliation:WANG Shuo,HE Shi-wei,LI Hao-dong,SHEN Yong-sheng(School of Traffic and Transportation,Beijing JiaoTong University,Beijing 100044,China)
Abstract: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,an...
Keywords:Marshalling Station  Scheduling Problem of Shunting Locomotive  Sequence of Train Uncoupling  Tabu Search Algorithm  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号