A refined differential evolution algorithm for improving the performance of optimization process

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

Abstract

Various Artificial Intelligent (AI) algorithms can be applied in solving optimization problems. Among the latest Evaluation Algorithm (EA) have been developed is Differential Evolution (DE). DE is developed based on an improved Genetic Algorithm and come with different strategies for faster optimization. However, the population trapped in local optimality and premature convergence to cause in DE algorithm have cause poor performance during optimization process. To overcome the drawbacks, mixed population update and bounce back strategy were introduced to modify and improve current DE algorithm. A Himmelblau function and real case from engineering problem were used to show the performance improvements of refined DE in optimization process. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Razlan Yusoff, A., & Mat Yayha, N. (2011). A refined differential evolution algorithm for improving the performance of optimization process. In Communications in Computer and Information Science (Vol. 252 CCIS, pp. 184–194). https://doi.org/10.1007/978-3-642-25453-6_17

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