By Topic

Performance evaluation of memetic EMO algorithms using dominance relation-based replacement rules on MOO test problems

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)
Kaige, S. ; Dept. of Ind. Eng., Osaka Prefecture Univ., Sakai, Japan ; Murata, T. ; Ishibuchi, H.

In this paper, we apply EMO (Evolutionary Multiobjective Optimization) algorithms with a generalized dominance relation-based local search (GDR-LS) procedure to MOO (Multi-Objective Optimization) test problems. In the GDR-LS procedure, we generalize the Pareto dominance relation, which is usually used to determine Pareto optimal solutions for MOO problems, for accepting candidate solutions in the local search. We have already applied EMO algorithms with the GDR-LS procedure to well-known multi-objective knapsack problems. In this paper, we examine the effectiveness of the GDR-LS procedure in EMO algorithms through computational experiments on function optimization problems.

Published in:

Systems, Man and Cybernetics, 2003. IEEE International Conference on  (Volume:1 )

Date of Conference:

5-8 Oct. 2003