关键词: 人工蜂群算法, Nelder-mead单纯形法, 协同搜索, 灵敏度分析, 全局搜索

Abstract: Considering that the existing Artificial Bee Colony（ABC） can not pay simultaneous attention to evolution speed and solution quality, a Nelder-Mead Simplex Method based Improved Artificial Bee Colony（NMSM-IABC） is proposed in this paper. In the process of iteration, the algorithm periodically gets the best individual vertex from NMSM operator and migrates to ABC, or obtains the optimal nectar source information from ABC and migrates to NMSM. ABC can improve its local exploiting capability applying NMSM, and NMSM can get away from local minimum by ABC. The algorithm proposed can achieve cooperative search of the ABC and NMSM. Furthermore, in order to enhance the ability or increase the convergence speed of NMSM-IABC, an improved search scheme of onlooker bee is proposed. And the sensitivity analysis of the key parameter is conducted. Finally, numerical experiments and comparisons on six benchmark functions indicate that the proposed algorithm can avoid the local minimum and enhance the global search ability and convergence speed, and is an effective cooperative search algorithm.

Key words: Artificial Bee Colony（ABC）, Nelder-Mead Simplex Method（NM-SM）, cooperative search, sensitivity analysis, global search