A Customized Differential Evolutionary Algorithm for Bounded Constrained Optimization Problems

Complexity 2021:1-24 (2021)
  Copy   BIBTEX

Abstract

Bound-constrained optimization has wide applications in science and engineering. In the last two decades, various evolutionary algorithms were developed under the umbrella of evolutionary computation for solving various bound-constrained benchmark functions and various real-world problems. In general, the developed evolutionary algorithms belong to nature-inspired algorithms and swarm intelligence paradigms. Differential evolutionary algorithm is one of the most popular and well-known EAs and has secured top ranks in most of the EA competitions in the special session of the IEEE Congress on Evolutionary Computation. In this paper, a customized differential evolutionary algorithm is suggested and applied on twenty-nine large-scale bound-constrained benchmark functions. The suggested C-DE algorithm has obtained promising numerical results in its 51 independent runs of simulations. Most of the 2013 IEEE-CEC benchmark functions are tackled efficiently in terms of proximity and diversity.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,601

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

No Free Lunch Theorems for Optimization.D. H. Wolpert & W. G. Macready - 1997 - IEEE Transactions on Evolutionary Computation 1 (1):67–82.
分布推定アルゴリズムによる Memetic Algorithms を用いた制約充足問題解決.Handa Hisashi - 2004 - Transactions of the Japanese Society for Artificial Intelligence 19:405-412.

Analytics

Added to PP
2021-03-11

Downloads
31 (#785,580)

6 months
8 (#469,300)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references