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

基于蚁群算法的动车组周转计划研究
引用本文:王文宪,柏伟.基于蚁群算法的动车组周转计划研究[J].交通运输工程与信息学报,2012(3):102-105.
作者姓名:王文宪  柏伟
作者单位:西南交通大学,交通运输与物流学院,成都 610031
摘    要:通过对高速铁路动车组运用现状进行分析,建立了高速铁路动车组在不固定区段使用条件下周转优化的指派模型,并提出了解决该组合优化问题的蚁群算法,以及动车组使用数量的公式.最后以武广客专为算例,计算出动车组优化运用方案,并铺画了一个车站相关的动车组周转图.通过验证,本文模型和算法具有可行性.

关 键 词:动车组  不固定区段  指派模型  蚁群算法

Research on Train Set Scheduling Based on Ant Colony Algorithm
WANG Wen-xian,BAI Wei.Research on Train Set Scheduling Based on Ant Colony Algorithm[J].Journal of Transportation Engineering and Information,2012(3):102-105.
Authors:WANG Wen-xian  BAI Wei
Institution:College of Transportation and logistics, Southwest Jiaotong University, Chengdu 610031, China
Abstract:Through analyzing the situation of train sets, an assignment model under the condition of uncertain railroad section was constructed and an ant colony algorithm to solve the combinatorial optimization problem and quantitative formulas of the high-speed passenger trains were proposed. Finally, taking Wuhan-Guangzhou high-speed railway for an example, an optimal program of using high-speed passenger trains was calculated and aworking diagram of the trainsets at a station was drawn. Through verification, this model and algorithm are feasible.
Keywords:Motor train sets  uncertain railroad region  assignment model  the ant colony algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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