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

A new genetic algorithm to handle the constrained optimization problem

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

5 Author(s)
Shengjing Mu ; Inst. of Adv. Process Control, Zhejiang Univ., Hangzhou, China ; Hongye Su ; Weijie Mao ; Zhenyi Chen
more authors

A genetic algorithm to handle the constrained optimization problem without penalty function term is proposed. The infeasibility degree of a solution (IFD) is defined as the sum of the square value of all the constraints violation to identify the constraints violation of the solutions quantitative. At the end of general GAs operation, an infeasibility degree selection of the current population is designed by checking whether the IFD of a solution is less than or equal to a threshold or not to decide the candidate solution is accepted or rejected. The initial results of solving two typical constrained optimization problems show the promising performance of the proposed method.

Published in:

Decision and Control, 2002, Proceedings of the 41st IEEE Conference on  (Volume:1 )

Date of Conference:

10-13 Dec. 2002

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.