摘要
针对猴群算法求解全局优化问题精度不高和花费大量的计算时间等问题,结合传统的单纯法的搜索思想,设计出一种基于猴群算法和单纯法的混合算法。该混合算法较大程度上提高了猴群算法求解精度,且加快了猴群算法的收敛速度。通过18个标准测试函数进行了测试,结果表明,与PSO、GA与MA比较,文中提出的猴群-单纯形混合算法在函数优化方面有较强的优势,其测试函数最优解更接近理论最优解。
In view of the problem that Monkey algorithm cannot acquire solutions exactly in solving global optimization and spend a lot of time in computation, this paper designed a hybrid algorithm based on monkey algorithm and simple method which combine with the searching idea of traditional simple method. The algorithm improves the calculation ac- curacy and speeds up monkey algorithm converge speed in a certain degree. The simulation results show that the im- proved monkey-simple hybrid algorithm has strong advantage in function testing. The results are more close to the theo- ry optimal solution.
出处
《计算机科学》
CSCD
北大核心
2013年第11期248-254,共7页
Computer Science
基金
国家自然科学基金(61165015)
广西自然科学基金(2012GXNSFDA053028)
广西高等学校重大科研项目(201201ZD008)资助
关键词
猴群算法
伪梯度
反向学习
单纯法
测试函数
Monkey algorithm, Pseudo-gradient, Opposition-based, Simple method, Testing functions
