Hybrid differential evolution algorithm with chaos and generalized opposition-based learning

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

Abstract

This paper presents a hybrid differential evolution (DE) algorithm based on chaos and generalized opposition-based learning (GOBL). In this algorithm, GOBL strategy transforms current search space into a new search space with a random probability, which provides more opportunities for the algorithm to find the global optimum. When the GOBL strategy isn't executed, the chaotic operator, like a mutation operator, will be introduced to help the DE to jump out local optima and improve the global convergence rate. Simulation results show that this hybrid DE algorithm can electively enhance the searching efficiency and greatly improve the searching quality. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Wang, J., Wu, Z., & Wang, H. (2010). Hybrid differential evolution algorithm with chaos and generalized opposition-based learning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6382 LNCS, pp. 103–111). https://doi.org/10.1007/978-3-642-16493-4_11

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