Close category search window
 

Diversity enhanced Adaptive Evolutionary Programming for solving single objective constrained problems

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
$31 $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

3 Author(s)
Mallipeddi, R. ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore ; Suganthan, P.N. ; Qu, B.Y.

In Evolutionary Algorithms, the occurrence of premature convergence is due to lack of diversity in the population during the search process. The effect may be more predominant if the optimization problem includes constraints. In this paper we propose an explicit memory based diversity enhancement Adaptive Evolutionary Programming (DivEnh-AEP) method to solve constraint optimization problems of CEC 2006.

Published in:
Evolutionary Computation, 2009. CEC '09. IEEE Congress on

Date of Conference: 18-21 May 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.