Cart (Loading....) | Create Account
Close category search window
 

An Improved Multi-Population Genetic Algorithm for Constrained Nonlinear 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.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Yanling Wu ; National Lab. of Ind. Control Technol., Zhejiang Univ., Hangzhou ; Jiangang Lu ; Youxian Sun

Penalty function is popular method for constrained optimization problems. Generally, a penalty parameter controls the degree of penalty for a constrained violation and an optimal parameter exists, but the value is difficult to define and its optimal value is different for different questions. Here, we propose an improved multi-population genetic algorithm to solve this problem. Each population uses different penalty strategy, then each subpopulation evolve independently for a certain number of generations, after that exchange individuals between different subpopulations. This method can perform multi-directional searches by manipulating several subpopulations of potential solutions for different penalty degree for constraints violation and obtain mixed information from these different directional searches, so it can make the selection of the penalty degree much easier and has more chance to find an optimal solution

Published in:

Intelligent Control and Automation, 2006. WCICA 2006. The Sixth World Congress on  (Volume:1 )

Date of Conference:

0-0 0

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 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.