Orakanya Gateratanakul
Prabhas Chongstitvatana

submit to the 3rd International Conference on Computer and Communication Systems (ICCCS) Nagoya, Japan on April 27-30, 2018

In this study, we present three methods of sharing knowledge between cooperative compact genetic algorithms. The methods exploit the effect of the worse solutions of the two-cooperative compact genetic algorithms to the search space which can prevent premature convergence. The benefit also encourages exploring other areas in solution space which enhance the opportunity to discover the better solutions. The proposed algorithm has a simple structure requires much less execution time than the non-sharing compact genetic algorithm.