Journal of Frontiers of Computer Science and Technology ›› 2022, Vol. 16 ›› Issue (11): 2628-2641.DOI: 10.3778/j.issn.1673-9418.2104105

• Theory and Algorithm • Previous Articles     Next Articles

Extreme Individual Guided Artificial Bee Colony Algorithm

CHEN Lan1, WANG Lianguo2,+()   

  1. 1. College of Mechanical and Electrical Engineering, Gansu Agricultural University, Lanzhou 730070, China
    2. College of Information Science and Technology, Gansu Agricultural University, Lanzhou 730070, China
  • Received:2021-04-29 Revised:2021-07-02 Online:2022-11-01 Published:2021-07-15
  • About author:CHEN Lan, born in 1995, M.S. candidate. Her re-search interest is intelligent information processing.
    WANG Lianguo, born in 1968, Ph.D., professor. His research interests include computational in-telligence, intelligent information processing and agricultural information technology.
  • Supported by:
    National Natural Science Foundation of China(61751313);Special Task Project of Education Informationization Construction in Gansu Province(2011-02);Key Research and Development Program of Gansu Province(21YF5GA088)

极值个体引导的人工蜂群算法

陈兰1, 王联国2,+()   

  1. 1.甘肃农业大学 机电工程学院,兰州 730070
    2.甘肃农业大学 信息科学技术学院,兰州 730070
  • 通讯作者: + E-mail: wanglg@gsau.edu.cn
  • 作者简介:陈兰(1995—),女,甘肃临洮人,硕士研究生,主要研究方向为智能信息处理。
    王联国(1968—),男,甘肃临夏人,博士,教授,主要研究方向为计算智能、智能信息处理、农业信息技术。
  • 基金资助:
    国家自然科学基金(61751313);甘肃省教育信息化建设专项任务项目(2011-02);甘肃省重点研发计划项目(21YF5GA088)

Abstract:

To overcome the drawbacks of poor development ability, easy to fall into local optimum, slow conver-gence speed of artificial bee colony (ABC) algorithm in solving function optimization problems, an extreme indi-vidual guided artificial bee colony (EABC) algorithm is proposed. Firstly, global extremum and neighborhood ex-tremum individuals are used to guide search for employed bees and following bees. The global extremum individual guided search is good for the retention and development of excellent individuals in the population, so that the algorithm jumps out of local extremum and avoids premature convergence. The neighborhood extremum individual guided search is good for enhancing the search accuracy and improving the convergence speed of the algorithm, and the random number ris used to balance two search mechanisms. Secondly, the small probability mutation operator is introduced into search process, and each dimension of bee individual is mutated with a small probability to overcome local extremum and premature convergence of the algorithm. Finally, the greedy selection strategy based on the value of objective function is adopted to improve the optimization performance of the algorithm. Simulation experiments are carried out with 28 test functions and the algorithm proposed in this paper is compared with other algorithms. Experimental results show that the improved algorithm has higher optimization performance and faster convergence speed.

Key words: artificial bee colony (ABC) algorithm, extreme individual guidance, small probability mutation, ob-jective function value

摘要:

针对目前人工蜂群算法(ABC)在求解函数优化问题时存在开发能力差、易陷入局部最优、收敛速度慢等问题,提出了一种极值个体引导的人工蜂群算法(EABC)。首先,该算法在雇佣蜂和跟随蜂的搜索中利用全局极值个体和邻域极值个体引导搜索,全局极值个体引导搜索有利于种群中优良个体的保留和发展,使算法跳出局部极值,避免早熟收敛。邻域极值个体引导搜索有利于增强搜索精度,提高算法的收敛速度,并通过随机数 r平衡两种搜索机制。其次,在搜索过程中引入小概率变异算子,对蜜蜂个体的各维度以较小的概率进行变异,克服算法陷入局部极值并出现早熟收敛的现象。最后,采用基于目标函数值的贪婪选择策略,提高算法的优化性能;采用28个测试函数进行仿真实验,并与其他几种算法进行比较,实验结果表明改进算法具有较高的优化性能和较快的收敛速度。

关键词: 人工蜂群算法(ABC), 极值个体引导, 小概率变异, 目标函数值

CLC Number: