By Topic

A novel memetic algorithm for constrained optimization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jianyong Sun ; Centre for Plant Integrative Biology, School of Biosciences, The University of Nottingham, Sutton Bonington, LE12 5RD, United Kingdom ; Jonathan M. Garibaldi

In this paper, we present a memetic algorithm with novel local optimizer hybridization strategy for constrained optimization. The developed MA consists of multiple cycles. In each cycle, an estimation of distribution algorithm (EDA) with an adaptive univariate probability model is applied to search for promising search regions. A classical local optimizer, called DONLP2, is applied to improve the best solution found by the EDA to a high quality solution. New cycles are employed when the computational budget has not been reached. The new cycles are expected to learn from the search history to make the further search efficient and to enable escape from local optima. The developed algorithm is experimentally compared with ε-DE, which was the winner of the 2006 IEEE Congress on Evolutionary Computation (CEC'06) competition on constrained optimization. The results favour our algorithm against the best-known algorithm in terms of the number of fitness evaluations used to reach the global optimum.

Published in:

IEEE Congress on Evolutionary Computation

Date of Conference:

18-23 July 2010