基于蚁群算法的铁路空车调整优化模型设计

Research on Railway Empty Cars Adjustment Optimization Model Based on the Ant Colony Algorithm

针对铁路空车调整问题,采用蚁群算法解决此问题,建立以空车走行公里数最小为目标的优化模型,并给出求解算法。算例分析表明模型的正确性和算法的合理性,将蚁群算法的时间复杂度与其他一些解决空车调整问题的算法的时间复杂度进行比较,充分体现蚁群算法解决大规模路网空车调整问题的优越性。

Aiming at the problem of railway empty cars adjustment , the paper applies ant colony algorithm to solve the problem,the optimization model of empty car s adjustment on railway network which aims at the minimization of consuming car-kilometer is established, and algorithm is given. The feasibility of the proposed model and algorithm was verified with an example. At last, the paper compares the time complexity of the ant colony algorithm with a number of other algorithm which solve the problem of e the problem of railway empty cars adjustment, it fully reflects the superiority of the ant colony algorithm that empty car adjustment in large scale railway network.