Exploitation and Exploration Analysis of Elitist Evolutionary Algorithms: A Case Study

by   Yu Chen, et al.
Nottingham Trent University
Wuhan University of Technology

Known as two cornerstones of problem solving by search, exploitation and exploration are extensively discussed for implementation and application of evolutionary algorithms (EAs). However, only a few researches focus on evaluation and theoretical estimation of exploitation and exploration. Considering that exploitation and exploration are two issues regarding global search and local search, this paper proposes to evaluate them via the success probability and the one-step improvement rate computed in different domains of integration. Then, case studies are performed by analyzing performances of (1+1) random univariate search and (1+1) evolutionary programming on the sphere function and the cheating problem. By rigorous theoretical analysis, we demonstrate that both exploitation and exploration of the investigated elitist EAs degenerate exponentially with the problem dimension n. Meanwhile, it is also shown that maximization of exploitation and exploration can be achieved by setting an appropriate value for the standard deviation σ of Gaussian mutation, which is positively related to the distance from the present solution to the center of the promising region.


page 1

page 2

page 3

page 4


An Experimental Study of Adaptive Control for Evolutionary Algorithms

The balance of exploration versus exploitation (EvE) is a key issue on e...

A Cuckoo Quantum Evolutionary Algorithm for the Graph Coloring Problem

Based on the framework of the quantum-inspired evolutionary algorithm, a...

Influence of the Binomial Crossover on Performance of Evolutionary Algorithms

In differential Evolution (DE) algorithms, a crossover operation filteri...

A Distribution Evolutionary Algorithm for Graph Coloring

Graph Coloring Problem (GCP) is a classic combinatorial optimization pro...

A suite of diagnostic metrics for characterizing selection schemes

Evolutionary algorithms are effective general-purpose techniques for sol...

Memetic Artificial Bee Colony Algorithm for Large-Scale Global Optimization

Memetic computation (MC) has emerged recently as a new paradigm of effic...

Please sign up or login with your details

Forgot password? Click here to reset