By Topic

Enhanced distribution and exploration for multiobjective evolutionary algorithms

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

4 Author(s)
Tan, K.C. ; Dept. of Electr. & Comput. Eng., Nat. Univ. of Singapore, Singapore ; Yang, Y.J. ; Goh, C.K. ; Lee, T.H.

The main objectives of multiobjective evolutionary algorithms are to minimize the distance between the solution set and true Pareto front, to distribute the solutions evenly and to maximize the spread of solution set. This paper addresses these issues by presenting two features that enhance the ability of multiobjective evolutionary algorithms. The first feature is a variant of the mutation operator that adapts the mutation rate along the evolution process to maintain a balance between the introduction of diversity and local fine-tuning. In addition, this adaptive mutation operator adopts a new approach to strike a compromise between the preservation and disruption of genetic information. The second feature is a novel enhanced exploration strategy that encourages the exploration towards less populated areas and hence achieves better discovery of gaps in the generated front. This strategy also preserves nondominated solutions in the evolving population and hence gives good convergence. Comparative studies show that the proposed features are effective.

Published in:

Evolutionary Computation, 2003. CEC '03. The 2003 Congress on  (Volume:4 )

Date of Conference:

8-12 Dec. 2003