中文摘要：

针对群搜索优化（GSO）算法存在的不足,提出一种新的GSO实现算法（NRGSO）.采用5个300维和7个30维的测试函数对NRGSO算法进行数值实验,并将其与GSO算法、微粒群优化（PSO）算法、遗传算法（GA）、进化规划（EP）、进化策略（ES）进行比较.结果表明,NRGSO算法的性能优于GSO算法;而在解决高维和多模态函数的优化问题方面,其性能优于PSO、GA、EP和ES等算法.NRGSO算法改进了群搜索优化原实现方法的不足,提高了算法的搜索性能,不仅在高维函数的优化中表现卓越,还能有效地避免陷入局部次优,并且在实际的优化问题中应用方便.

英文摘要：

A novel realization algorithm of group search optimizer （NRGSO） is proposed, aiming at overcoming the deficiency of GSO. And it is easier to be applied in practical problems. Five test functions of 300 dimensions and seven test functions of 30 dimensions are used to conduct the numerical experiments and the results of the novel algo-rithm are compared with those of GSO, particle swarm optimization （PSO）, genetic algorithm （GA）, evolutionary programming （EP） and evolutionary strategy （ES）. The algorithm proposed in this paper is better than GSO and its performance in solving the problems of high dimensions and multimodal functions is better than PSO, GA, EP and ES. NRGSO improves the original algorithm. It enhances its search ability and achieves better results. This novel algorithm performs excellently in functions of high dimensions, can effectively avoid being trapped in the local minima and is applicable in practical optimizer.