说明：  猴群算法（MA）是由Zhao和Tang提出的一种新的用于求解大规模、多峰优化问题的智能优化算法.其思想在于通过模拟自然界中猴群爬山过程中爬、望和跳的几个动作，设计了三个搜索过程：爬过程主要用来搜索当前所在位置的局部最优解；望过程主要通过眺望来搜索邻近领域比当前位置更优的解，以便加速最优解的搜寻过程；跳过程的目的在于由当前搜索区域转移到其它区域,以避免搜索过程陷入局部最优
(Monkey swarm algorithm (MA) is a new intelligent optimization algorithm proposed by Zhao and Tang for solving large-scale and multi-peak optimization problems. Its idea is to design three search processes by simulating several movements of climbing, looking and jumping of monkeys in nature. The climbing process is mainly used to search the local part of the current location. Optimal solution; Looking process mainly searches for solutions in adjacent areas that are better than the current location by looking over, so as to speed up the search process of the optimal solution; The purpose of jumping process is to shift from the current search area to other areas, so as to avoid the search process falling into local optimum.)