An Imanishism-based genetic algorithm for sampling various Pareto-optimal solutions: An application to the multiobjective resource division problem
✍ Scribed by Kiyoharu Tagawa; Noboru Wakabayashi; Hiromasa Haneda; Katsumi Inoue
- Publisher
- John Wiley and Sons
- Year
- 2002
- Tongue
- English
- Weight
- 338 KB
- Volume
- 139
- Category
- Article
- ISSN
- 0424-7760
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
For sampling various solutions from the entire Pareto front of the multiobjective resource division problem, a new Genetic Algorithm (GA) based on an evolutionary theory advocated by Kinji Imanishi is proposed. First, two types of distance between two individuals, namely, structural and functional distances, are introduced and used to define four types of relation between them, namely, homogeneous, heterogeneous, homologous, and analogous species. Then, for keeping a variety of species within a population as far as possible, a new generation alternation model with variable population size is presented. In order to find Pareto‐optimal solutions effectively, a new genetic operation that combines conventional harmonic crossover with a local optimization algorithm is also proposed. Finally, the advantage of the Imanishism‐based GA is demonstrated through computational experiments conducted on two‐ and three‐objective problem instances. © 2002 Scripta Technica, Electr Eng Jpn, 139(2): 23–35, 2002; DOI 10.1002/eej.10010