首页 | 本学科首页   官方微博 | 高级检索  
   检索      

基于改进蚁群算法的战时不确定性路径规划模型求解
引用本文:王浩,汤再江,常广建.基于改进蚁群算法的战时不确定性路径规划模型求解[J].装甲兵工程学院学报,2009,23(2):22-25.
作者姓名:王浩  汤再江  常广建
作者单位:1. 装甲兵工程学院,装备指挥与管理系,北京,100072
2. 装甲兵工程学院,训练部,北京,100072
摘    要:战时路径规划的不确定性包括参数、约束条件和决策目标等的不确定性。以基本蚁群算法为基础,结合随机模拟和模糊模拟技术,提出了一种改进蚁群算法来求解战时不确定性路径规划问题,并通过仿真示例与其他算法进行了比较。结果表明:该算法求解效率更高,求解过程更为直观,能够满足战时不确定性路径规划问题的研究。

关 键 词:不确定性  路径规划  改进蚁群算法

Model Solution of the Uncertain Route Planning in Wartime Based on Modified Ant Colony Algorithm
WANG Hao,TANG Zai-jiang,CHANG Guang-jian.Model Solution of the Uncertain Route Planning in Wartime Based on Modified Ant Colony Algorithm[J].Journal of Armored Force Engineering Institute,2009,23(2):22-25.
Authors:WANG Hao  TANG Zai-jiang  CHANG Guang-jian
Institution:1. Department of Equipment Command and Administration, Academy of Armored Force Engineering, Beijing 100072, China; 2. Department of Training, Academy of Armored Force Engineering, Beijing 100072, China)
Abstract:Uncertainty of routing-planning includes uncertainty of parameters, restrictive conditions and decision-targets. Based on basic ant-colony algorithm and random and blur simulation technology, this paper puts forward a modified ant-colony algorithm to solve such a problem. Demonstrations show that the high performance and intuitional process can meet the demands for uncertain route-planning in wartimes.
Keywords:uncertainty  route-planning  modified ant-colony algorithm
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号