基于遗传算法的战时备件配送车辆调度

Genetic algorithm for the vehicle scheduling problem of the wartime spare parts

战时备件配送的车辆调度是提高装备保障效率的关键因素。本文以装备战斗效能损失最小化为车辆调度的目标,建立了问题的数学模型,并应用遗传算法对问题进行了求解。算法中,设计了两种交叉算子,并应用了局部搜索模块作为变异算子。对算例的计算实验表明,所设计的启发式交叉算子在精度和速度两方面均优于顺序交叉算子。

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 problem, the mathematical model of the problem was formulated, and the genetic algorithm was utilized to solve it. In our algorithm, two crossover operators were designed, and a local search modular substituted for the simple mutation operator. The computational results showed that the heuristic crossover operator outperformed the order crossover in both accuracy and speed.