战时备件配送的MDVRPTW问题研究

Research on the Multi-depot Vehicle Routing Problem with Time Windows for the Wartime Spare Parts

战时备件配送的车辆调度是提高装备保障效率的关键因素.以装备效能损失最小化为车辆调度的目标,建立了问题的M DVRPTW模型,并应用蚁群算法对问题进行了求解.算法中,根据问题特征改进了状态转移规则,设计了串行和并行两种路线构造方法,并应用局部搜索模块对蚂蚁构造的路线进行改进.对算例的计算实验表明,串行路线构造方法在精度和速度两方面均优于并行路线构造方法.

The vehicle scheduling problem of the wartime spare parts is vital to the efficiency of equipment support. In this paper, the efficiency loss of equipment was used as the objective of the vehicle scheduling. The model of multi-depot vehicle routing problem was formulated, and the ant colony optimization algorithm was utilized to solve it. In our algorithm, the state transition rule was improved, and the serial and parallel route construction methods were designed. In addition, a local search modular was used to optimize the routes constructed by ants. The computational results showed that the serial route construction method outperformed the other route construction method in both accuracy and speed.