An explorative and exploitative mutation scheme

Exploration and exploitation are the two cornerstones which characterize Evolutionary Algorithms (EAs) capabilities. Maintaining the reciprocal balance of the explorative and exploitative power is the key to the success of EA applications. Accordingly, in this work the canonical Genetic Algorithm is augmented by a new mutation scheme that is capable of exploring the unseen regions of the search space, and simultaneously exploiting the already-found promising elements. The proposed mutation operator specifies different mutation rates for different sites (loci) of the individuals. These site-specific rates are wisely derived based on the fitness and structure of the population individuals. In order to retain the balance of the required exploration and exploitation, the mutation rates are adapted during the evolution. To demonstrate the efficacy of the proposed algorithm, the method is evaluated using a set of benchmark problems and the outcome is compared with a series of well-known relevant algorithms. The results demonstrate that the newly suggested method significantly outperforms its rivals.

Paper

Full text

PDF

An explorative and exploitative mutation scheme

Semantic Scholar · Computer Science · 2010

Abstract

Exploration and exploitation are the two cornerstones which characterize Evolutionary Algorithms (EAs) capabilities. Maintaining the reciprocal balance of the explorative and exploitative power is the key to the success of EA applications. Accordingly, in this work the canonical Genetic Algorithm is augmented by a new mutation scheme that is capable of exploring the unseen regions of the search space, and simultaneously exploiting the already-found promising elements. The proposed mutation operator specifies different mutation rates for different sites (loci) of the individuals. These site-specific rates are wisely derived based on the fitness and structure of the population individuals. In order to retain the balance of the required exploration and exploitation, the mutation rates are adapted during the evolution. To demonstrate the efficacy of the proposed algorithm, the method is evaluated using a set of benchmark problems and the outcome is compared with a series of well-known relevant algorithms. The results demonstrate that the newly suggested method significantly outperforms its rivals.

References (29)

Scroll for more · 17 remaining

Similar papers

© 2026 NYSGPT2525 LLC