摘要
猴群算法(Monkey Algorithm,MA)是近几年提出的一种新颖的群体智能算法,依据它算法本身的"空翻"特点,使得它在算法收敛后期易跳出局部最优而区别于其他仿生群体智能算法。该文从生物背景、算法原理、算法改进及算法应用等各个方面理论讲述猴群算法,分析猴群算法的优缺点,并从就不足之处总结到目前为止学者们从算法的各方面(包括:混合算法、参数设置等)提出的相应的改进策略。最后,综合阐述了猴群算法现阶段仍存在的急待研究的一些问题。
The monkey algorithm is a new kind of group intelligence algorithm proposed in recent years. Based on its "somersault" feature, it is easy to jump out of the local optimal and different from other bionic group intelligence algorithms. This paper analyzes the advantages and disadvantages of the monkey algorithm from the aspects of biological background, algorithm principle, algorithm improvement and algorithm application, and summarizes the advantages and disadvantages of the monkey algorithm from the shortcomings. So far, scholars have learned from all aspects of the algorithm(including:Hybrid algorithm, parameter setting, etc.) proposed the corresponding improvement strategy. Finally, some problems of monkey group still exist are still discussed.
出处
《电脑知识与技术（过刊）》
2017年第11X期92-94,105,共4页
Computer Knowledge and Technology
基金
文化框架下的狼群算法混沌改进研究(项目编号:GJJ150597)
一种新的群体智能算法及其在水资源优化调度中的应用(项目编号:2016WICSIP008)
关键词
猴群算法
算法原理
算法改进
算法应用
monkey group algorithm
algorithm principle
algorithm improvement
algorithm application
