Novel binary encoding differential evolution algorithm

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

Abstract

Differential Evolution (DE) algorithm is a successful optimization method in continuous space and has been successfully applied in many different areas. The operators used in DE are simple, however, the mechanism in which the operators are defined, makes it impossible to apply the standard DE directly to the problems in binary space. A novel binary encoding DE (BDE) was proposed to extend DE for solving the optimization problems in binary space. A mixed expression, which constitutes of an arithmetical expression and a logical expression, was used to construct a new mutation operator. And then with a predefined probability, the result of the mutation operator was flipped. Initial experiment results indicate the novel BDE is useful and effective. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Deng, C., Zhao, B., Yang, Y., Peng, H., & Wei, Q. (2011). Novel binary encoding differential evolution algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6728 LNCS, pp. 416–423). https://doi.org/10.1007/978-3-642-21515-5_49

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