By Topic

A Genetic Algorithm Based on a New Fitness Function for 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

3 Author(s)
Dalian Liu ; Dept. of Basic Course Teaching, Beijing Union Univ., Beijing, China ; Jinling Du ; Xiaohua Chen

According to the characteristics of constrained optimization problem, a new approach based on a new fitness function is presented to handle constrained optimization problems. The primary features of the algorithm proposed are as follows. Inspired by the smooth function technique, a new fitness function is designed which can automatically search potential solutions. In order to make the fitness function work well, a special technique which keeps a certain number of feasible solutions is also used. In addition, new genetic operators are proposed to enhance the proposed algorithm, i.e., crossover operator and mutation operator are designed according to whether the parent solution is a feasible solution or not. Also, to accelerate the algorithm convergence speed, one dimensional search scheme is incorporated into the crossover operator. At last, the computer simulation demonstrates the effectiveness of the proposed algorithm.

Published in:

Computational Intelligence and Security (CIS), 2011 Seventh International Conference on

Date of Conference:

3-4 Dec. 2011