By Topic

A genetic algorithm for solving multi-constrained function optimization problems based on KS function

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)
Jianhua Xiao ; Huazhong Univ. of Sci. & Technol., Wuhan ; Jin Xu ; Zehui Shao ; Congfeng Jiang
more authors

In this paper, a new genetic algorithm for solving multi-constrained optimization problems based on KS function is proposed. Firstly, utilizing the agglomeration features of KS function, all constraints of optimization problems are agglomerated to only one constraint. Then, we use genetic algorithm to solve the optimization problem after the compression of constraints. Finally, the simulation results on benchmark functions show the efficiency of our algorithm.

Published in:

Evolutionary Computation, 2007. CEC 2007. IEEE Congress on

Date of Conference:

25-28 Sept. 2007