节点文献

自适应进化的蚁群算法及其仿真研究

The research of an adaptive evolutional ant colony algorithm and its simulation

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 孙宏詹士昌金柏林

【Author】 SUN Hong\+1, ZHAN Shi\|chang\+2, JIN Bailin\+2(1. Department of Basic Course, Nanjing Institute of Engneering, Nanjing 211100, China; 2. Department of Physics, Hangzhou Teachers College, Hangzhou 310012, China) \;

【机构】 南京工程学院基础部杭州师范学院物理系杭州师范学院物理系 江苏南京211100浙江杭州310012浙江杭州310012

【摘要】 蚁群算法广泛应用于求解组合优化问题,但基本蚁群算法与其它模拟进化算法存在进化速度慢,并易于陷入局部最小等缺陷,在此提出一种采用自适应选择和动态调整的进化策略,通过TSP问题的仿真表明,算法的性能明显得到改善,该方法不仅能够加快收敛速度,节省搜索时间,而且能够克服停滞行为的过早出现,有利于发现更好的解.这对于求解大规模的优化问题是十分有利的.

【Abstract】 Ant colony algorithm is a kind of simulated evolutionary algorithm. It is proposed by Italian scholar Macro Dorigo. It has many good features and has been widely applied to solving complicated combinatorial optimization problems. But there is much deficiency. Specially, its searching speed is slow, and it is easy to fall in the local best. In this paper, the performance of ant colony algorithm is improved by the adaptive selection and the dymanic readjust evolutional strategy. The simulation for TSP problem shows that the improved algorithm can find better paths at higher convergence speed. It is beneficial to solve the wide scale optimization problems.

【基金】 杭州师范学院科研基金资助重点项目(项目编号2003XNZ05)
  • 【文献出处】 杭州师范学院学报(自然科学版) ,Journal of Hangzhou Teachers College , 编辑部邮箱 ,2003年05期
  • 【分类号】TP301.6
  • 【被引频次】13
  • 【下载频次】269
节点文献中: 

本文链接的文献网络图示:

本文的引文网络