By Topic

The Pareto-Following Variation Operator as an alternative approximation model

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

3 Author(s)
Talukder, A.K.M.K.A. ; Dept. of Comput. Sci. & Software Eng., Univ. of Melbourne, Carlton, VIC ; Kirley, M. ; Buyya, R.

This paper presents a critical analysis of the Pareto-Following Variation Operator (PFVO) when used as an approximation method for Multiobjective Evolutionary Algorithms (MOEA). In previous work, we have described the development and implementation of the PFVO. The simulation results reported indicated that when the PFVO was integrated with NSGA-II there was a significant increase in the convergence speed of the algorithm. In this study, we extend this work. We claim that when the PFVO is combined with any MOEA that uses a non-dominated sorting routine before selection, it will lead to faster convergence and high quality solutions. Numerical results are presented for two base algorithms: SPEA-II and RM-MEDA to support are claim. We also describe enhancements to the approximation method that were introduced so that the enhanced algorithm was able to track the Pareto-optimal front in the right direction.

Published in:

Evolutionary Computation, 2009. CEC '09. IEEE Congress on

Date of Conference:

18-21 May 2009