Performance Analysis of Evolutionary Search with a Dynamic Restart Policy

Michael Solano, Istvan Jonyer

In this work we explore how the complexity of a problem domain affects the performance of evolutionary search using a performance-based restart policy. Previous research indicates that using a restart policy to avoid premature convergence can improve the performance of an evolutionary algorithm. One method for determining when to restart the search is to track the fitness of the population and to restart when no measurable improvement has been observed over a number of generations. We investigate the correlation between a dynamic restart policy and problem complexity in the context of genetic programming. Our results indicate the emergence of a universal restart scheme as problems become increasingly complex.

Subjects: 15.7 Search; 1.9 Genetic Algorithms

Submitted: Feb 12, 2007

This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.