Application of Improved Parallel Ant Colony Algorithm in Railway Empty Cars Adjustment Problem

摘要

Railway empty cars distribution problem is a complex multivariate constrained nonlinear integer optimization problems.In order to overcome the problems such as long computing time and easy to fall into local optimal solution for ant colony algorithm,a new parallel ant colony algorithm is proposed to solve railway empty cars distribution problem.In this paper,the mathematic mode which minimizes total distance of empty cars is established and the solution algorithm is developed.Numerical simulation results of railway empty cars distribution problem demonstrate that the optimum result and searching performance of improved parallel ant colony algorithm with particle swarm features are better than that of ACO and parallel ant colony algorithm.