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

基于蚁群算法的铁路空车调整优化模型设计
引用本文:张王彬.基于蚁群算法的铁路空车调整优化模型设计[J].交通科技与经济,2009,11(3):26-29.
作者姓名:张王彬
作者单位:兰州交通大学,交通运输学院,甘肃,兰州,730070
摘    要:针对铁路空车调整问题,采用蚁群算法解决此问题,建立以空车走行公里数最小为目标的优化模型,并给出求解算法。算例分析表明模型的正确性和算法的合理性,将蚁群算法的时间复杂度与其他一些解决空车调整问题的算法的时间复杂度进行比较,充分体现蚁群算法解决大规模路网空车调整问题的优越性。

关 键 词:空车调整  蚁群算法  时间复杂度

Research on Railway Empty Cars Adjustment Optimization Model Based on the Ant Colony Algorithm
ZHANG Wang-bin.Research on Railway Empty Cars Adjustment Optimization Model Based on the Ant Colony Algorithm[J].Technology & Economy in Areas of Communications,2009,11(3):26-29.
Authors:ZHANG Wang-bin
Institution:School of Traffic and Transportation;Lanzhou Jiaotong University;Lanzhou 730070;China
Abstract:Aiming at the problem of railway empty cars adjustment ,the paper applies ant colony algorithm to solve the problem,the optimization model of empty car s adjustment on railway network which aims at the minimization of consuming car-kilometer is established. and algorithm is given . The feasibility of the proposed model and algorithm was verified with an example. At last, the paper compares the time complexity of the ant colony algorithm with a number of other algorithm which solve the problem of e the probl...
Keywords:empty cars adjustment  ant colony algorithm  time complexity  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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