基于蚁群算法的货车调度问题

ACO-Based Truck Dispatch Problem

研究货车调度优化问题,本文根据编组站到达场到达货车的情况,做出合理的解体计划,为出发列车及时安排足够多的车辆,建立配流模型。本文将货车调度问题描述成适合蚁群算法的形式,并进行初始化,考虑迭代过程中信息素对未来决策的影响程度,定义与问题相适应的转移概率,进而确定选择策略,同时在蚂蚁经过的路径上进行信息素的更新,实现对该问题的有效求解。实验结果验证了合理安排调度机制的有效性。

This paper studies the dispatch of trucks and the optimization problems, makes reasonable disassembly plans according to the condition that trucks arrive at the destination yard, and establishes an allocation flow model for arranging sufficient vehicles for departing trains. The paper depicts the problem of truck dispatch as a form suitable for ACO, and makes initialization, considering the information＇s influence on future decisions in the changing process as well as the shift probability whose definition is fit for the problem, and then the chosen strategy will be made. Meanwhile, the information elen,ent is updated on the way of ants to solve the problem efficiently. Based on concrete examples and according to the steps of ACO,the xalidity of lhe dispatch mechanism that is arranged reasonably can be tested by the obtained results.