计算机工程与应用 ›› 2010, Vol. 46 ›› Issue (19): 25-26.DOI: 10.3778/j.issn.1002-8331.2010.19.007

• 博士论坛 • 上一篇    下一篇

改进自组织迁移算法及其在Bump 问题中的应用

林志毅1,王玲玲2   

  1. 1.广东工业大学计算机学院,广州510006
    2.武汉大学软件工程国家重点实验室,武汉430072
  • 收稿日期:2010-04-01 修回日期:2010-05-14 出版日期:2010-07-01 发布日期:2010-07-01
  • 通讯作者: 林志毅

Improved self-organizing migrating algorithm and its application in Bump problem

LIN Zhi-yi1,WANG Ling-ling2   

  1. 1.Faculty of Computer,Guangdong University of Technology,Guangzhou 510006,China
    2.State Key Lab of Software Engineering,Wuhan University,Wuhan 430072,China
  • Received:2010-04-01 Revised:2010-05-14 Online:2010-07-01 Published:2010-07-01
  • Contact: LIN Zhi-yi

摘要: 提出了改进自组织迁移算法(Improved Self-Organizing Migrating Algorithm,ISOMA)。该算法通过在迁移过程中引入差分迁移方式来增加种群的多样性,将迁移的方向由原来的正方向扩展到正负两方向以提高算法的搜索能力,对步长进行自适应调整进一步平衡算法的勘探和开采能力。利用该算法来求解高维约束问题——BUMP 问题,计算结果表明新算法的有效性。

Abstract: An improved Self-Organizing Migrating Algorithm(ISOMA) is proposed in this paper.The key points of it lie in: 1.employ the differential migrating in the individual migration procedure to increase the population diversity.2.extend the migrating
direction from the positive to both positive and negative in order to enhance the search capability of the algorithm.3.
adaptively adjust the step to further balance the algorithm exploration and exploitation capacity.Then,ISOMA is used to solve high-dimensional constraint problem,BUMP problem.Numerical results show the effectiveness of ISOMA.

中图分类号: