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

基于混合算法的阶段计划解编作业的研究
引用本文:崔莉,常琦,彭娟娟,解兴申.基于混合算法的阶段计划解编作业的研究[J].铁路计算机应用,2009,18(8):9-12.
作者姓名:崔莉  常琦  彭娟娟  解兴申
作者单位:兰州交通大学,交通运输学院,兰州,730070
摘    要:根据编组站阶段计划实际作业流程,通过在车组配流完成后,以晚点列车总数量最少为目标,确定列车的解体/编组次序建立的解体,编组计划模型.经实例验算证明算法的可靠性、有效性.为鳊组站阶段计划的自动编制提供了一个良好的决策参考.

关 键 词:编组站    阶段计划    解编作业    混合算法
收稿时间:2009-08-15

Study on stage plan disintegration and marshalling croder based on hybrid algorithm
CUI Li,CHANG Qi,PENG Juan-juan,XIE Xing-shen.Study on stage plan disintegration and marshalling croder based on hybrid algorithm[J].Railway Computer Application,2009,18(8):9-12.
Authors:CUI Li  CHANG Qi  PENG Juan-juan  XIE Xing-shen
Institution:( School of Traffic and Transportation, Lanzhou Jiaotong University, Lanzhou 730070, China )
Abstract:According to the processes of the stage plan in actual production in marshalling yard, the disintegration/marshalling order could be defined through the completion of the assignment units. The target was the fewest of the total number of the train which was delayed. After checking with instance, the calculation could be proved effectively and reliably. Thus, it could provide a good reference for the decision-making of the automatic establishment in the stage plan in marshalling yard.
Keywords:marshalling yard  stage plan  breaking-up and sorting job  hybrid algorithms
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《铁路计算机应用》浏览原始摘要信息
点击此处可从《铁路计算机应用》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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