路网节点间铁路冷藏车空车调整的蚁群算法  

Ant Colony Algorithm for the Adjustment of Empty Refrigerated Wagons between Railway Network Nodes

作　　者：王都[1] 闫海峰[2] 谭云江[3] 

机构地区：[1]北京交通大学经济管理学院 [2]西南交通大学交通运输学院,四川成都610031 [3]西南交通大学图书馆,四川成都610031

出　　处：《中国铁道科学》2008年第2期131-135,共5页China Railway Science

摘　　要：数量调配和网络配流是铁路冷藏车空车调整的2个核心问题。在对问题进行抽象描述的基础上,建立了铁路冷藏车空车调整协同优化模型,将空车调整径路与数量两者统一到同一个模型中,实现两者整体上的优化。通过约束条件分析,在不改变铁路冷藏车空车调整问题协同优化性质的前提下对模型进行简化,将非线性模型转化为线性模型,设计相应的蚁群算法(ACO),并对算法复杂度进行分析。通过理论分析和实际算例分析表明,ACO算法易于利用计算机实现,对求解铁路冷藏车空车调整问题具有优势。The amount distribution and flow distribution in network are the most important problems in railway empty refrigerated wagons adjustment. Based on the abstract description to these problems, this paper constructs an optimization model for refrigerated wagons adjustment and cooperation. Both the route and amount of empty wagons adjustment are integrated into a single model to realize the optimization as a whole. Through the analysis of the constraint conditions, the model is simplified under the precondition without changing the optimization nature of railway empty refrigerated wagons adjustment problem. The original nonlinear model is converted into a linear one. And then the corresponding ant colony optimization （ACO） algorithm is designed and the complexity of the algorithm is analyzed. Theoretical analysis and practical examples shows that ACO algorithm, as a more effective algorithm, has advantages to solve the problem of railway empty refrigerated wagons adjustment through computer.

关 键 词：铁路冷藏运输 空车调整 优化模型 蚁群算法 

分 类 号：U295.1[交通运输工程—交通运输规划与管理] U292.45[交通运输工程—道路与铁道工程]