Journal of Global Optimization
A Schema-Guiding Evolutionary Algorithm for 0-1 Knapsack Problem
IACSIT-SC '09 Proceedings of the 2009 International Association of Computer Science and Information Technology - Spring Conference
Designing neural networks using hybrid particle swarm optimization
ISNN'05 Proceedings of the Second international conference on Advances in Neural Networks - Volume Part I
Hybrid differential evolution for knapsack problem
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I
Hi-index | 0.00 |
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.