Generalization of dominance relation-based replacement rules for memetic EMO algorithms

Authors:
Tadahiko Murata;Shiori Kaige;Hisao Ishibuchi
Affiliations:
Department of Informatics, Kansai University, Takatsuki, Osaka, Japan;Department of Industrial Engineering, Osaka Prefecture University, Sakai, Osaka, Japan;Department of Industrial Engineering, Osaka Prefecture University, Sakai, Osaka, Japan
Venue:
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Year:
2003

Citing 9
Cited 5

Memetic algorithms: a short introduction

New ideas in optimization
Combining convergence and diversity in evolutionary multiobjective optimization

Evolutionary Computation
Multiple Objective Optimization with Vector Evaluated Genetic Algorithms

Proceedings of the 1st International Conference on Genetic Algorithms
On the Performance Assessment and Comparison of Stochastic Multiobjective Optimizers

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Fuzzy Partition and Input Selection by Genetic Algorithms for Designing Fuzzy Rule-Based Classification Systems

EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results

Evolutionary Computation
Modification of local search directions for non-dominated solutions in cellular multiobjective genetic algorithms for pattern classification problems

EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
A multi-objective genetic local search algorithm and itsapplication to flowshop scheduling

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation

A simple but powerful multiobjective hybrid genetic algorithm

Design and application of hybrid intelligent systems
Implementation of Simple Multiobjective Memetic Algorithms and Its Application to Knapsack Problems

International Journal of Hybrid Intelligent Systems
HCS: a new local search strategy for memetic multiobjective evolutionary algorithms

IEEE Transactions on Evolutionary Computation
New challenges for memetic algorithms on continuous multi-objective problems

Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Comprehensive Survey of the Hybrid Evolutionary Algorithms

International Journal of Applied Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we generalize the replacement rules based on the dominance relation in multiobjective optimization. Ordinary two replacement rules based on the dominance relation are usually employed in a local search (LS) for multiobjective optimization. One is to replace a current solution with a solution which dominates it. The other is to replace the solution with a solution which is not dominated by it. The movable area in the LS with the first rule is very small when the number of objectives is large. On the other hand, it is too huge to move efficiently with the latter. We generalize these extreme rules by counting the number of improved objectives in a candidate solution for LS. We propose a LS with the generalized replacement rule for existing EMO algorithms. Its effectiveness is shown on knapsack problems with two, three, and four objectives.