Cooperative Group Search Optimization

Group Search Optimizer (GSO) is a population-based optimization approach inspired by animal searching behaviour and group living theory. Although competition among population members may improve their performance, greater improvements could be achieved through cooperation. In this paper, a new algorithm is presented, called Cooperative Group Search Optimizer (CGSO), based on divide-and-conquer paradigm, employing cooperative behaviour among multiple GSO groups to improve the performance of standard GSO. Nine benchmark functions are used to evaluate the performance of the proposed technique. Experimental results show that the CGSO approach is able to achieve better results than standard GSO in most of the tested problems.