By Topic

Improved evolutionary algorithms for solving constrained optimization problems with tiny feasible space

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)
Ullah, A.S.S.M.B. ; Sch. of Inf. Technol. & Electr. Eng., Univ. of New South Wales at Australian Defence Force Acad., Canberra, ACT ; Elfeky, E.Z. ; Cornforth, D. ; Essam, D.L.
more authors

The quality of individuals in the initial population influences the performance of evolutionary algorithms, especially when the feasible region of the constrained optimization problems is very tiny in comparison to the entire search space. Too much diversity of the population may cost huge processing time; on the other hand the algorithms may trap into local optima for lack of diversity. This paper proposes a simple method to improve the quality of randomly generated initial solutions by sacrificing very little in diversity of the population. We introduce the method of search space reduction technique (SSRT) which is tested using four different existing EAs by solving a number of state-of-the-art test problems and a real world case problem. The experimental results show SSRT improves the solution qualities as well as speeding up the performance of the algorithm.

Published in:

Systems, Man and Cybernetics, 2008. SMC 2008. IEEE International Conference on

Date of Conference:

12-15 Oct. 2008