A modified binary differential evolution algorithm

Authors:
Ling Wang;Xiping Fu;Muhammad Ilyas Menhas;Minrui Fei
Affiliations:
Shanghai Key Laboratory of Power Station Automation Technology, School of Mechatronics and Automation, Shanghai University, Shanghai, China;Shanghai Key Laboratory of Power Station Automation Technology, School of Mechatronics and Automation, Shanghai University, Shanghai, China;Shanghai Key Laboratory of Power Station Automation Technology, School of Mechatronics and Automation, Shanghai University, Shanghai, China;Shanghai Key Laboratory of Power Station Automation Technology, School of Mechatronics and Automation, Shanghai University, Shanghai, China
Venue:
LSMS/ICSEE'10 Proceedings of the 2010 international conference on Life system modeling and simulation and intelligent computing, and 2010 international conference on Intelligent computing for sustainable energy and environment: Part II
Year:
2010

Citing 8
Cited 0

A Survey of Optimization by Building and Using Probabilistic Models

Computational Optimization and Applications
Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning

Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning
A Fuzzy Adaptive Differential Evolution Algorithm

Soft Computing - A Fusion of Foundations, Methodologies and Applications
Solving 0-1 Knapsack Problems by a Discrete Binary Version of Differential Evolution

IITA '08 Proceedings of the 2008 Second International Symposium on Intelligent Information Technology Application - Volume 02
Differential evolution algorithm with strategy adaptation for global numerical optimization

IEEE Transactions on Evolutionary Computation
Differential evolution using a neighborhood-based mutation operator

IEEE Transactions on Evolutionary Computation
Differential Evolution performances for the solution of mixed-integer constrained process engineering problems

Applied Soft Computing
A binary ant colony optimization for the unconstrained function optimization problem

CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Differential evolution (DE) is a simple, yet efficient global optimization algorithm. As the standard DE and most of its variants operate in the continuous space, this paper presents a modified binary differential evolution algorithm (MBDE) to tackle the binary-coded optimization problems. A novel probability estimation operator inspired by the concept of distribution of estimation algorithm is developed, which enables MBDE to manipulate binary-valued solutions directly and provides better tradeoff between exploration and exploitation cooperated with the other operators of DE. The effectiveness and efficiency of MBDE is verified in application to numerical optimization problems. The experimental results demonstrate that MBDE outperforms the discrete binary DE, the discrete binary particle swarm optimization and the binary ant system in terms of both accuracy and convergence speed on the suite of benchmark functions.