一种改进的猴群算法.pdfVIP

2017 年 第 26 卷 第 6 期 计 算 机 系 统 应 用 ① 一种改进的猴群算法 徐小平, 张东洁 (西安理工大学 理学院, 西安 710049) 摘 要: 猴群算法是一种新的群体智能优化算法, 该算法可以有效地求解线性、非线性、非凸和复杂高维函数的 优化问题, 目前已得到了许多学者的研究和关注. 为了进一步提高猴群算法的求解精度, 给出了一种改进的猴群 算法. 首先, 采用均匀分布的 Kent 混沌映射产生猴群算法的初始可行解. 然后, 在该算法的爬过程中采用递减的 因子作为爬步长. 最后, 在仿真实验中, 与已有方法进行比较, 结果显示了所给改进猴群算法的求解精度明显得 到改善, 即所提算法是可行的. 关键词: 智能算法; 猴群算法; Kent 混沌映射; 递减的因子 Improved Monkey Algorithm XU Xiao-Ping, ZHANG Dong-Jie (School of Sciences, Xi’an University of Technology, Xi’an 710049, China) Abstract: Monkey algorithm is a new optimization algorithm of swarm intelligent. The algorithm can effectively solve the optimization problems of functions such as linear, nonlinear, nonconvex and complex high dimensional function, etc. Currently, it has been widely studied and concerned by many scholars. In order to further improve the solution accuracy of monkey algorithm, this paper puts forward an improved monkey algorithm. Firstly, uniformly distributed Kent chaotic map is adopted as the initial feasible solution of the algorithm. Then, the descending factor is used as the step size in the climb process of the algorithm. Finally, in the simulation experiment, compared with the existing methods, the results show that the solution accuracy of the proposed monkey algorithm is significantly improved, namely, the proposed algorithm is feasible. Key words: intelligent algorithm; monkey algorithm; Kent chaotic map; descending factor 随着科学技术和信息时代的发展, 优化理论不断 体中个体间的联系与区别, 设计出类似生物界各种生 得到完善, 同时也面临实际生活中, 所需解决的问题 物的智能优化算法. 复杂度的无限增高、空间维数的不断增大[1]. 解决这些 猴群算法(Monkey Algorithm, MA)是近来被公认 问题要求的目标是: 在最短时间内、更加准确、更加 的一种群智能优化算法, 它是 2008 年由 Ruiqing Zhao