An improved differential evolution scheme for noisy optimization problems

18Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Differential Evolution (DE) is a simple and surprisingly efficient algorithm for global optimization over continuous spaces. It has reportedly outperformed many versions of EA and other search heuristics when tested over both benchmark and real world problems. However the performance of DE deteriorates severely if the fitness function is noisy and continuously changing. In this paper we propose an improved DE scheme which can efficiently track the global optima of a noisy function. The scheme performs better than the classical DE, PSO, and an EA over a set of benchmark noisy problems. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Das, S., & Konar, A. (2005). An improved differential evolution scheme for noisy optimization problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3776 LNCS, pp. 417–421). Springer Verlag. https://doi.org/10.1007/11590316_64

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