Engineering Commons^™

Many optimization problems are multi-modal. In certain cases, we are interested in finding multiple locally optimal solutions rather than just a single optimum as is computed by traditional genetic algorithms (GAs). Several niching techniques have been developed that seek to find multiple such local optima. These techniques, which include sharing and crowding, are clearly powerful and useful. But they do not explicitly let the user control the number of local optima being computed, which we believe to be an important capability.

In this paper, we develop a method that provides, as an input parameter to niching, the desired number of …

Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offspring with a similar individual in the current population (pairing phase) and deciding which of the two will remain in the population (replacement phase). The present work focuses on the replacement phase of crowding, which usually has been carried out by one of the following three approaches: Deterministic, Probabilistic, and Simulated Annealing. These approaches present some limitations regarding the way replacement is conducted. On the one hand, the first two apply the same …