Please use this identifier to cite or link to this item:
Title: An adaptive differential evolution with unsymmetrical mutation
Authors: Shi, EC
Leung, FHF 
Lai, JCY
Keywords: Evolutionary computation
Issue Date: 2011
Publisher: IEEE
Source: 2011 IEEE Congress on Evolutionary Computation (CEC), 5-8 June 2011, New Orleans, LA, p. 1879-1886 How to cite?
Abstract: Differential Evolution (DE) is one of the evolutionary algorithms under active research. It has been successfully applied to many real world problems. In this paper, an improved DE with a novel mutation scheme is proposed. The improved DE assigns a distinct scale factor for each individual mutation based on the fitness associated with each base vector involved in the mutation. With the adoption of different scale factors for mutation, DE is capable of searching more locally around superior points and explore more broadly around inferior points. Consequently, a good balance between exploration and exploitation can be achieved. Also, an adaptive base vector selection scheme is introduced to DE. This scheme is capable of estimating the complexity of objective functions based on the population variance. When the problem is simple, it will tend to select good vectors as base vector which will lead to quick convergence. When the objective function is complex, it will select base vector randomly so that the population maintains a high exploration capability and will not be trapped into local minima so easily. A suite of 12 benchmark functions are used to evaluate the performance of the proposed method. The simulation result shows that the proposed method is promising in terms of convergence speed, solution quality and stability.
ISBN: 978-1-4244-7834-7
DOI: 10.1109/CEC.2011.5949844
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Aug 17, 2018

Page view(s)

Last Week
Last month
Citations as of Aug 13, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.