舰船电子工程2019，Vol.39Issue(9)：27-31,44,6.DOI:10.3969/j.issn.1672-9730.2019.09.007
一种记忆区间蚁群算法及其仿真分析∗
Memory Interval Ant Colony Optimization Algorithm and Its Simulation
摘要
Abstract
Aiming at the drawback of the traditional ACO,an interval probability ant colony algorithm inspired by the charac?teristic of human’s memory is proposed. The pheromone of the path in the ACO can be extend to the interval bound,and then the probability for the selection of the path can be set as the interval probability,which can expand the diversity of ACO in the path se?lection. The updating of pheromone can be performing according to the way of human＇s memory,and different path can be updated according to the long-term memory updating and short-term memory way within the sub-optimal path. The proposed algorithm can reach the satisfactory solution set through the convergence analysis. Lots of simulation results for path planning problem show that the proposed algorithm performs well than other algorithms.关键词
蚁群优化算法/区间概率/人工记忆/收敛Key words
ant colony optimization/interval probability/artificial memory/convergence分类
信息技术与安全科学引用本文复制引用
刘振,王亚蛟..一种记忆区间蚁群算法及其仿真分析∗[J].舰船电子工程,2019,39(9):27-31,44,6.基金项目
国家自然科学基金项目(编号:51605487,61174031)资助. （编号:51605487,61174031）
