• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.652-658
• /
• 1998

We introduce the concept of a bi-population scheme for real-coded GAs consisting of an explorer sub-Ga and an exploiter sub-GA. The explorer sub-GA mainly performs global exploration of the search space, and incorporates a restart mechanism to help avoid being trapped at local optima. The exploiter sub-GA performs exploitation of fit local areas of the search space around the neighborhood of the best-so-far solution. Thus the search function of the algorithm is divided. the proposed technique exhibits performance significantly superior to standard GAs on two complex highly multimodal problems.