A three-strategy based differential evolution algorithm for constrained optimization

13Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Constrained Optimization is one of the most active research areas in the computer science, operation research and optimization fields. The Differential Evolution (DE) algorithm is widely used for solving continuous optimization problems. However, no single DE algorithm performs consistently over a range of Constrained Optimization Problems (COPs). In this research, we propose a Self-Adaptive Operator Mix Differential Evolution algorithm, indicated as SAOMDE, for solving a variety of COPs. SAOMDE utilizes the strengths of three well-known DE variants through an adaptive learning process. SAOMDE is tested by solving 13 test problems. The results showed that SAOMDE is not only superior to three single mutation based DE, but also better than the stateof- the-art algorithms. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Elsayed, S. M., Sarker, R. A., & Essam, D. L. (2010). A three-strategy based differential evolution algorithm for constrained optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6443 LNCS, pp. 585–592). https://doi.org/10.1007/978-3-642-17537-4_71

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free