By Topic

Solving constrained optimization problem by a specific-design multiobjective genetic algorithm

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

2 Author(s)
Hai-Lin Liu ; Dept. of Appl. Math., Guangdong Univ. of Technol., Guang Zhou, China ; Yu-Ping Wang

By transforming the constrained optimization problem into a multiobjective optimization problem, a specific-designed multiobjective genetic algorithm is proposed. For this multiobjective optimization problem, the objectives transformed by constraints depend on the number of generations such that the algorithm initially makes the search in a region that can contain infeasible solutions and gradually concentrate the search in the feasible region. Therefore, the proposed algorithm is not sensitive to active constraints and can handle the constraints efficiently. In addition, a new kind of multiple fitness functions, defined by the maximum value of the normalized objective multiplied by weights, can aid the proposed algorithm to explore the search space uniformly, keep the diversity of the population, and distinguish the quality between the feasible solutions and infeasible solutions. The numerical simulations indicate the proposed algorithm is efficient.

Published in:

Computational Intelligence and Multimedia Applications, 2003. ICCIMA 2003. Proceedings. Fifth International Conference on

Date of Conference:

27-30 Sept. 2003