A Novel Binary Differential Evolution for Discrete Optimization

Abstract:

Article Preview

Differential evolution (DE) is an evolutionary algorithm that is based on the individual differential reconstruction idea. It is proposed by Stom and Price in 1997, and is very suitable to solve optimization problem over continuous spaces. First of all, with the introduction of concepts of differential operator (DO), etc., the concise description of DE is given and the analysis of its main features is advanced. For solving discrete optimization problem using DE, a new operator, mapping operator, in the new algorithm was used to ensure the original mutation operator still effective. Then a new S operator, with sigmoid function, was used to keep the result of the mutation operator falls in the interval [0, 1]. The algorithm not only has the advantages of DE, but also is very suitable to solve discrete optimization problems. Calculations of 0/1 knapsack problem show that algorithm has better convergence capability and stability.

Info:

Periodical:

Key Engineering Materials (Volumes 439-440)

Edited by:

Yanwen Wu

Pages:

1493-1498

DOI:

10.4028/www.scientific.net/KEM.439-440.1493

Citation:

G. P. Hou and X. Ma, "A Novel Binary Differential Evolution for Discrete Optimization", Key Engineering Materials, Vols. 439-440, pp. 1493-1498, 2010

Online since:

June 2010

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.