蚁群算法在车辆巡回保障中的应用研究

Application of Routing Problem of Vehicle Itinerate Support Based on Ant Colony

应用蚁群算法（ACA）解决车辆巡回保障问题，建立了车辆巡回保障优化数学模型，对轨迹更新规则进行了重新设定，给出了算法的实现步骤。通过算例分析，将计算结果与遗传算法（GA）和粒子群算法（PSO）作了比较，对模型和算法的正确性、高效性和适用性进行了验证。实验结果表明，该算法可以快速、有效求得车辆巡回保障的优化解，得到车辆巡回保障过程中的较优方案。

Ant colony algorithm （ACA） is used to solve the routing problem of itinerate support. A vehicle itinerate support model is set up which improves the pheromone updating rule. The correctness, effect and applicability of the model is validated with an example.