Mechanism of multi-objective genetic algorithm for maintaining the solution diversity using neural network

Authors:
Kenji Kobayashi;Tomoyuki Hiroyasu;Mitsunori Miki
Affiliations:
Department of Knowledge Engineering and Computer Sciences, Doshisha University, Kyoto, Japan;Department of Knowledge Engineering and Computer Sciences, Doshisha University, Kyoto, Japan;Department of Knowledge Engineering and Computer Sciences, Doshisha University, Kyoto, Japan
Venue:
EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
Year:
2007

Citing 3
Cited 2

Multiple Objective Optimization with Vector Evaluated Genetic Algorithms

Proceedings of the 1st International Conference on Genetic Algorithms
Back Propagation

Artificial Neural Networks: An Introduction to ANN Theory and Practice
Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy

Evolutionary Computation

Diversity Maintenance Mechanism for Multi-Objective Genetic Algorithms Using Clustering and Network Inversion

Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Estimating the difficulty level of the challenges proposed in a competitive e-learning environment

IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

When multi-objective genetic algorithms are applied to real-world problems for deriving Pareto-optimal solutions, the high calculation cost becomes a problem. One solution to this problem is to use a small population size. However, this often results in loss of diversity of the solutions, and therefore solutions with sufficient precision cannot be derived. To overcome this difficulty, the solutions should be replaced when they have converged on a certain point. To perform this replacement, inverse analysis is required to derive the design variables from objects as the solutions are located in the objective space. For this purpose, an Artificial Neural Network (ANN) is applied. Using ANN, the solutions concentrating on certain points are replaced and the diversity of the solutions is maintained. In this paper, a new mechanism using ANN to maintain the diversity of the solutions is proposed. The proposed mechanism was introduced into NSGA-II and applied to test functions. In some functions, the proposed mechanism was useful compared to the conventional method. In other numerical experiments, the results of the proposed algorithm with large populations are discussed and the effectiveness of the proposed mechanism is also described.