摘要
针对蚁群算法在解决NP困难时所存在的极易陷入局部最优值和搜索时间过长的问题,在蚁群算法基础上重新设计状态转移规则和信息素更新规则。实验研究表明:改进后的算法可以有效解决最优冗余分配问题,同时可以在相对短的时间内找到问题的最优解。
Ant Colony Algorithm is easy to fall into partial optimizer and slow computing speed in the process of solving NP problem.On the basis of Ant Colony Algorithm,state transition rule and pheromone updating rule of the ant colony algorithm are re-designed.The experiment results show that the improved ant colony algorithm is an effective way to solve the redundancy allocation problem and could find optimum solution in a relatively short time at the same time.
出处
《重庆交通大学学报（自然科学版）》
CAS
北大核心
2013年第3期543-546,共4页
Journal of Chongqing Jiaotong University(Natural Science)
关键词
冗余分配
改进蚁群算法
可靠性优化
状态转移规则
信息素更新规则
redundancy allocation
improved ant colony algorithm
reliability optimization
state transition rule
pheromone update rule
