Multi-objective optimization by genetic algorithms: a review
Authors:
- H. KitaHKH. Kita
- S. KobayashiSKS. Kobayashi
- 23 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 517-522
Abstract
The paper reviews several genetic algorithm (GA) approaches to multi objective optimization problems (MOPs). The keynote point of GAs to MOPs is designing efficient selection/reproduction operators so that a variety of Pareto optimal solutions are generated. From this viewpoint, the paper reviews several devices proposed for multi objective optimization by GAs such as the parallel selection method, the Pareto based ranking, and the fitness sharing. Characteristics of these approaches have been confirmed through computational experiments with a simple example. Moreover, two practical applications of the GA approaches to MOPs are introduced briefly.Keywords
This publication has 10 references indexed in Scilit:
- A niched Pareto genetic algorithm for multiobjective optimization2002
- A thermodynamical selection rule for the genetic algorithm2002
- A new method to solve generalized multicriteria optimization problems using the simple genetic algorithmStructural and Multidisciplinary Optimization, 1995
- An Overview of Evolutionary Algorithms in Multiobjective OptimizationEvolutionary Computation, 1995
- Generation of a Set of Pareto-Optimal Solutions by Genetic AlgorithmsTransactions of the Society of Instrument and Control Engineers, 1995
- Learning Boolean concepts in the presence of many irrelevant featuresArtificial Intelligence, 1994
- Muiltiobjective Optimization Using Nondominated Sorting in Genetic AlgorithmsEvolutionary Computation, 1994
- Trading accuracy for simplicity in decision treesMachine Learning, 1994
- Artificial evolution for computer graphicsACM SIGGRAPH Computer Graphics, 1991
- An Empirical Comparison of Pruning Methods for Decision Tree InductionMachine Learning, 1989