A simple but powerful multiobjective hybrid genetic algorithm

Authors:
Hisao Ishibuchi;Shiori Kaige
Affiliations:
Dept. of Industrial Engineering, Osaka Prefecture University, 1-1 Gakuen-cho, Sakai, Osaka 599-8531, JAPAN;Dept. of Industrial Engineering, Osaka Prefecture University, 1-1 Gakuen-cho, Sakai, Osaka 599-8531, JAPAN
Venue:
Design and application of hybrid intelligent systems
Year:
2003

Citing 10
Cited 0

Multi-Objective Optimization Using Evolutionary Algorithms

Multi-Objective Optimization Using Evolutionary Algorithms
Evolutionary Algorithms for Solving Multi-Objective Problems

Evolutionary Algorithms for Solving Multi-Objective Problems
Multiple Objective Optimization with Vector Evaluated Genetic Algorithms

Proceedings of the 1st International Conference on Genetic Algorithms
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results

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

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
A multi-objective genetic local search algorithm and itsapplication to flowshop scheduling

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach

IEEE Transactions on Evolutionary Computation
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation
On the performance of multiple-objective genetic local search onthe 0/1 knapsack problem - a comparative experiment

IEEE Transactions on Evolutionary Computation
Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new multiobjective hybrid genetic algorithm by combining local search with an EMO (evolutionary multiobjective optimization) algorithm. In the design of our algorithm, we try to make its algorithmic complexity as simple as possible so that it can be easily understood, easily implemented and easily executed within short CPU time. At the same time, we try to maximize its search ability. Our algorithm makes use of advantages of both EMO and local search for achieving high search ability without increasing its algorithmic complexity. For example, each solution is evaluated based on Pareto ranking and the concept of crowding as in many EMO algorithms. On the other hand, a weighted scalar fitness function is used for efficiently executing local search. A kind of elitism is also implemented using Pareto ranking in the process of generation update. The search ability of our algorithm is examined through computational experiments on multiobjective 0/1 knapsack problems. Our algorithm is compared with well-known EMO algorithms (i.e., SPEA of Zitzler & Thiele and NSGA-II of Deb et al.) and memetic EMO algorithms (i.e., M-PAES of Knowles & Corne and MOGLS of Jaszkiewicz).