基于蚁群算法的装备保障路径规划模型  

Equipment Support Route-planning Model Based on Ant Colony Algorithm

作　　者：张星[1,2] 杜晓明[1] 蔡纪伟[1] 张志学 

机构地区：[1]军械工程学院 [2]解放军66010部队

出　　处：《火力与指挥控制》2015年第9期26-30,共5页Fire Control & Command Control

基　　金：国家自然科学基金资助项目(60904071)

摘　　要：现代战争中装备保障路径规划中路径网络节点多和要优化的制约因素等问题成为装备保障仿真的难点,传统的蚁群算法寻找最优解,往往找不到满意的解。为了提高寻优效率,尽量减少装备保障中待保障装备战斗力恢复等待总时间,对基本蚁群算法进行改进。首先建立装备保障路径规划模型,然后基于基本蚁群算法,重新设计了启发信息的计算方法和信息素的更新函数,对路径节点的选择方法进行改进,最后通过一个具体的装备保障路径规划问题对传统的和改进的算法进行算例分析。计算结果表明,所采用的改进的蚁群算法可以更好地解决装备保障路径规划问题,有效减少待保障装备恢复战斗力之前等待的时间和保障分队经过的总路程。The problem of the network node and the complex constraint in the route-planning of the equipment support during modern wartime becomes the difficulty in the equipment support simulation. The traditional ant colony algorithm will not introduce satisfied explain. In order to improve the optimizing efficiency,the traditional ant colony algorithm is improved. Firstly,the model of the route-planning in equipment support is built,devises the computing method and the updating function, and the choice of the path node is improved,at last,the improved algorithm is tested and verified by using a route-planning problem in some equipment support scenario,proves that the improved ant colony algorithm can solve the problem of the route-planning in equipment support,reduces the waiting time before the waiting equipment recovering fighting ability and the total distance the support elements passes.

关 键 词：蚁群算法 装备抢修 路径规划 模型 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]