Adaptive sizing of populations and number of islands in distributed genetic algorithms

Deciding the appropriate population size and number of islands for distributed island-model genetic algorithms is often critical to the algorithm’s success. This paper outlines a method that automatically searches for good combinations of island population sizes and the number of islands. The method is based on a race between competing parameter sets, and collaborative seeding of new parameter sets. This method is applicable to any problem, and makes distributed genetic algorithms easier to use by reducing the number of user-set parameters. The experimental results show that the proposed method robustly and reliably finds population and islands settings that are comparable to those found with traditional trial-and-error approaches. Categories and Subject Descriptors: D.2 Software Engineering: Miscellaneous General Terms: Performance Reliability Algorithms

• Type: Conference
• Year: 2005
• Where: GECCO
• Authors: Johan Berntsson, Maolin Tang
• Keywords: GECCO 2005, Genetic Algorithms, Parameter Sets, Population Sizes