A Computationally Efficient Evolutionary Algorithm for Real-Parameter Optimization (2002)
| Citations: | 37 - 4 self |
BibTeX
@MISC{Deb02acomputationally,
author = {Kalyanmoy Deb and Ashish Anand and Dhiraj Joshi},
title = {A Computationally Efficient Evolutionary Algorithm for Real-Parameter Optimization},
year = {2002}
}
Years of Citing Articles
OpenURL
Abstract
Due to an increasing interest in solving real-world optimization problems using evolutionary algorithms (EAs), researchers have developed a number of real-parameter genetic algorithms (GAs) in the recent past. In such studies, the main research effort is spent on developing an efficient recombination operator. Such recombination operators use probability distributions around the parent solutions to create an ospring. Some operators emphasize solutions at the center of mass of parents and some around the parents. In this paper, we propose a generic parent-centric recombination operator (PCX) and a steady-state, elite-preserving, scalable, and computationally fast population-alteration model (we called the G3 model). The performance of the G3 model with the PCX operator is investigated on three commonly-used test problems and is compared with a number of evolutionary and classical optimization algorithms including other real-parameter GAs with UNDX and SPX operators, the correlated self-adaptive evolution strategy, the dierential evolution technique and the quasi-Newton method. The proposed approach is found to be consistently and reliably performing better than all other methods used in the study. A scale-up study with problem sizes up to 500 variables shows a polynomial computational complexity of the proposed approach. This extensive study clearly demonstrates the power of the proposed technique in tackling real-parameter optimization problems.







