车种代用情况下的空车调配优化模型及其求解  

The Optimization of Substitution of Empty Car Allocation Based on Ant Colony Algorithm

作　　者：杨喜娟[1,2] 张治娟[2] 

机构地区：[1]兰州交通大学电子与信息工程学院 [2]甘肃省轨道交通装备系统动力学与可靠性重点实验室(兰州交通大学),甘肃兰州730070

出　　处：《长江大学学报（自科版）（上旬）》2013年第7期5-7,159,共3页JOURNAL OF YANGTZE UNIVERSITY (NATURAL SCIENCE EDITION) SCI ＆ ENG

基　　金：甘肃省自然科学基金资助项目(1112RJZA045)

摘　　要：针对空车产生总数和空车需求总数相等的平衡运输问题,建立以空车走行公里数最小为目标的空车调配数学模型,并用蚁群算法求解该模型。仿真结果表明,使用蚁群算法求解车种代用下的空车调配模型具有得到最优解的比率高、平均解相对误差低、最优解的收敛速度较快等优点,能很好地解决空车产生总数和空车需求总数相等的平衡运输问题。A Colony Algorithm(ACA) is proposed for substituting empty wagon distribution.Aiming at the problem of substitution of empty distribution types in rail transport tension,the mathematical model is established substitution of empty distribution types which aims at the minimization of consuming car-kilometer.The paper applies ACA to solve it.Some detailed numeral examples are given and different adjustment schemes are taken,which prove that ACA is adaptive to different adjustment requirements.Numerical simulation demonstrates that the optimum result using ACA to solve the problem has obvious advantage of fewer arguments,simple computation and high rate of convergence.ACA is an effective method to solve the problem of substitution of empty distribution types.

关 键 词：铁路 车种代用 空车调配 蚁群算法 

分 类 号：U292.4[交通运输工程—交通运输规划与管理]