建立了弹药运输车辆调度问题的数学模型，针对传统遗传算法求解该问题具有收敛速度慢、易陷入局部极小的缺点，提出了一种改进的遗传算法予以求解。在改进算法中引入一种基于信息素的遗传交叉算子，该算子能利用以信息素形式保存的全局信息，从而提高收敛速度；算法中的变异算子采用 Relocation、Ex-change、2-opt*及2-opt 4种启发式搜索算法，尽可能扩大搜索范围。算例分析表明了所提改进遗传算法求解弹药运输车辆调度问题的有效性和可行性。%The mathematic model is built for scheduling problem of ammunition transport vehi-cles ,and an improved genetic algorithm is put forward to solve the problem considering the defects of the traditional genetic algorithm in solving the problem w hich include the slow convergent speed and easy convergence to a local minimum point .A genetic crossover operator based on pheromone is intro-duced in the improved algorithm ,and the operator can utilize the global information saved by the form of pheromone to improve the convergence speed .The mutation operator in the algorithm adopts four heuristic search algorithms to extend the search scope as much as possible which are Relocation ,Ex-change ,2-opt* and 2-opt .The example analysis shows that the proposed and improved genetic algo-rithm is effective and feasible in solving the scheduling problem of ammunition transport vehicles .
展开▼
