By Topic

Multi-objective immune genetic algorithm solving dynamic single-objective multimodal constrained optimization

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
$33 $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)
Zhuhong Zhang ; Inst. of Syst. Sci. & Inf. Technol., Guizhou Univ., Guiyang, China ; Min Liao ; Lei Wang

This work investigates one multi-objective immune genetic algorithm to solve dynamic constrained single-objective multimodal optimization problems in terms of the concept of constraint-dominance and biological immune inspirations. The algorithm assumes searching multiple global optimal solutions along diverse searching directions, by means of the environmental detection and two evolving subpopulations. It exploits various kinds of promising regions through executing the periodical suppression mechanism and periodically adjusting the mutation magnitude. The sufficient diversity of population can be maintained relying upon a dynamic suppression index, and meanwhile the high-quality solutions can be found rapidly during the process of solution search. Comparative experiments show that the proposed approach can not only outperform the compared algorithms, but also rapidly acquire the global optima in each environment for each test problem, and thus it is a competitive optimizer.

Published in:

Natural Computation (ICNC), 2012 Eighth International Conference on

Date of Conference:

29-31 May 2012