A Genetic Algorithm with Local Competing

On the whole, the simple GAs with just one population set is effective in finding one optimal solution. However, many real world problems have a lot of optimal solutions, and often it is important to find all of them. In this paper, we propose a GA that has a population set containing multiple optimal solutions. In the proposed GA, each of the individuals in population set has its own geological neighbors, and they exchange their genes globally as well as compete with others locally. The paper then evaluates the proposed GA along with many multimodal problems including a 30bit, order-six bipolar-deceptive function. Finally, we present some improvement directions of the proposed GA.