An improved differential evolution algorithm for optimization problems

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

Abstract

There are many optimization problems in the intelligent material and adaptive material fields. Differential evolution (DE) is simple and effective and has been successfully applied to solve optimization problems. And it can be applied to intelligent material field. It is easy to understand and realized and has a strong spatial search capability compared to other evolutionary algorithms. In order to avoid the original versions of DE to remain trapped into local minima and accelerate the optimization process, several approaches have been proposed. The mutation of the classical DE is improved in this paper. It effectively guarantees the convergence of the algorithm and avoids the local minima. Testing and comparing results showed the effectiveness of the algorithm. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Zhang, L., Xu, X., Zhou, C., Ma, M., & Yu, Z. (2011). An improved differential evolution algorithm for optimization problems. Advances in Intelligent and Soft Computing, 104, 233–238. https://doi.org/10.1007/978-3-642-23777-5_39

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