铁路空车调整优化模型及其蚁群算法

Model and Ant Colony Optimization Algorithms for Railway Empty Wagon Distribution

以理论研究为主,通过对空车调整问题的特点分析,明确了空车数量调配和网络配流是空车调整的两个核心问题;在分析已有模型及对问题进行抽象描述的基础上,建立了空车调整协同优化(EWDCO)模型,并设计了相应的蚁群算法。分析发现,共同径路约束与EWDCO模型是不协调的;通过对定理的证明得出,对流约束不会对EWDCO模型的最优解产生影响,模型可以描述为线性整数规划模型,其实质是带容量约束的最小费用流模型。同时,研究表明ACO对求解空车调整问题具有一定的优势,是一种较为有效的算法。

The paper focuses on theoretical research and makes certain the two core problems of the empty wagon distribution： quantity distribution and network matching flow. Based on the analysis of existing models and abstracting the problems, an empty wagons distribution coordinate optimzation （EWDCO） model and corresponding algorithm are devised.It is found that the identical path constraint doesn＇t correspond with the EWDCO model through analysis, and the convection constraints won＇ t affect the optimal solution by proving the theorem. Thus, EWDCO model can be described as a linear integer programming model which is essentially the minimum rate flow model subjected to capacity. The research indicates that ant colony optimization is superior to the empty wagons distribution.