计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (10): 56-58.DOI: 10.3778/j.issn.1002-8331.2009.10.017

• 研究、探讨 • 上一篇    下一篇

基于局部禁忌搜索策略的连续空间蚁群算法

李桂成,赵海英   

  1. 山西大学 计算机与信息技术学院,太原 030006
  • 收稿日期:2008-06-16 修回日期:2008-09-22 出版日期:2009-04-01 发布日期:2009-04-01
  • 通讯作者: 李桂成

Ant colony algorithm based on tabu search to continuous space optimization

LI Gui-cheng,ZHAO Hai-ying   

  1. School of Computer & Information,Shanxi University,Taiyuan 030006,China
  • Received:2008-06-16 Revised:2008-09-22 Online:2009-04-01 Published:2009-04-01
  • Contact: LI Gui-cheng

摘要: 针对蚁群算法容易陷入局部最优解及搜索时间长等不足,引入一种基于连续空间的禁忌搜索算法,并将其与蚁群算法相结合,提出了一种引入禁忌搜索策略的蚁群算法,以求解连续对象优化问题。经测试验证了该算法不仅跳出局部最优解的能力更强,而且能较快地收敛到全局最优解,表明算法的有效性。

Abstract: In order to get over the disadvantages of the slow convergence speed and stagnation behavior,a tabu search algorithm is inducted.Then an improved ant colony optimization with tabu search is put forward.It is tested by a set of benchmark continuous funcions optimization problems.And the results of the examples show that it can not easily run into the local optimum and can converge at the global optimum.