Improvements of real coded genetic algorithms based on differential operators preventing premature convergence
O. Hrstka, A. Kucerova

TL;DR
This paper compares various real-coded evolutionary algorithms, highlighting the effectiveness of differential operators and introducing CERAF technology to prevent premature convergence in multimodal optimization problems.
Contribution
It introduces an improved real-coded differential genetic algorithm with CERAF technology, demonstrating its robustness and superiority over binary and other real-coded methods.
Findings
Real-coded methods outperform binary algorithms on real domains.
Differential operators enhance self-adaptation and solution quality.
CERAF technology effectively prevents premature convergence.
Abstract
This paper presents several types of evolutionary algorithms (EAs) used for global optimization on real domains. The interest has been focused on multimodal problems, where the difficulties of a premature convergence usually occurs. First the standard genetic algorithm (SGA) using binary encoding of real values and its unsatisfactory behavior with multimodal problems is briefly reviewed together with some improvements of fighting premature convergence. Two types of real encoded methods based on differential operators are examined in detail: the differential evolution (DE), a very modern and effective method firstly published by R. Storn and K. Price, and the simplified real-coded differential genetic algorithm SADE proposed by the authors. In addition, an improvement of the SADE method, called CERAF technology, enabling the population of solutions to escape from local extremes, is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
