Modified differential evolution: a greedy random strategy for genetic recombination

Paul K. Bergey, C. Ragsdale

Research output: Contribution to journalArticlepeer-review

77 Citations (Scopus)


Over the past three decades Evolutionary Algorithms have emerged as a powerful mechanism for finding solutions to large and complex problems. A promising new evolutionary algorithm known as Differential Evolution (DE) was recently introduced and has garnered significant attention in the research literature. This paper introduces a modification to DE that enhances its rate of convergence without compromising solution quality. DE was recently shown to outperform several well-known stochastic optimization methods on an extensive set of test problems. Our Modified Differential Evolution (MDE) algorithm utilizes selection pressure to develop offspring that are more fit to survive than those generated from purely random operators. We demonstrate that MDE requires less computational effort to locate global optimal solutions to well-known test problems in the continuous domain. © 2004 Elsevier Ltd. All rights reserved.
Original languageEnglish
Pages (from-to)255-265
Number of pages11
Issue number3
Publication statusPublished - 2005


Dive into the research topics of 'Modified differential evolution: a greedy random strategy for genetic recombination'. Together they form a unique fingerprint.

Cite this