An Opposition-Based Group Search Optimizer with Diversity Guidance

Algorithm 1

Procedure of the GSO algorithm.

Line# Procedure of GSO algorithm

(1)  Begin

(2) Initialization

(3)  Evaluate the fitness of the current member;

(4)  Find a producer;

(5) Producing

(6)  Randomly choose three points based on (1);

(7)  Search the best resource, otherwise stay the current position based on (2);

(8)  If the producer can’t search a better area, then change the angle by using (3);

(9) Scrounging

(10)   Randomly choose some group members as the scrounger

(11)  Dispersion

(12)   Generate a head angle using (2)

(13)   Obtain a random distance based on (4) and then move to a new point using (5)

(14)   Search a better solution, report the final optimal solution

(15) End