By Topic

Evolutionary algorithms with dynamic population size and local exploration for multiobjective 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)
K. C. Tan ; Dept. of Electr. & Comput. Eng., Nat. Univ. of Singapore, Singapore ; T. H. Lee ; E. F. Khor

Evolutionary algorithms have been recognized to be well suited for multiobjective optimization. These methods, however, need to "guess" for an optimal constant population size in order to discover the usually sophisticated tradeoff surface. This paper addresses the issue by presenting a novel incrementing multiobjective evolutionary algorithm (IMOEA) with dynamic population size that is computed adaptively according to the online discovered tradeoff surface and its desired population distribution density. It incorporates the method of fuzzy boundary local perturbation with interactive local fine tuning for broader neighborhood exploration. This achieves better convergence as well as discovering any gaps or missing tradeoff regions at each generation. Other advanced features include a proposed preserved strategy to ensure better stability and diversity of the Pareto front and a convergence representation based on the concept of online population domination to provide useful information. Extensive simulations are performed on two benchmark and one practical engineering design problems

Published in:

IEEE Transactions on Evolutionary Computation  (Volume:5 ,  Issue: 6 )