摘要
依据数量调配和网络配流两个空车调整的核心问题,建立了空车调整协同优化模型,并设计了相应的蚁群算法。由于共同径路约束与模型是不协调的,且对流约束不会对模型的最优解产生影响,故而模型可以描述为线性整数规划模型。同时,研究表明蚁群算法对求解空车调整问题具有一定优势。
The quantity adjustment and network matching flow are two key issues of the empty wagon distribution. Empty wagons distribution coordinateoptimization model is established and correspondingly ant colony optimization （ACO） is designed. The essay points out that identical path constraint does not correspond with the model, and convection constraint will not affect the optimal solution of the model. Therefore, the model can be described as a linear integer programming model. At the same time, the research indicates that ACO has advantages in resolving the empty wagons distribution issues.
出处
《铁道运输与经济》
北大核心
2006年第8期31-34,共4页
Railway Transport and Economy
关键词
铁路
空车调整
优化模型
蚁群算法
railway
empty wagon distribution
optimizing model
Ant Colony Optimization （ACO）
