Uniform sampling of local pareto-optimal solution curves by pareto path following and its applications in multi-objective GA

Authors:
Ken Harada;Jun Sakuma;Shigenobu Kobayashi;Isao Ono
Affiliations:
Tokyo Institute of Technology, Kanagawa, Japan;Tokyo Institute of Technology, Kanagawa, Japan;Tokyo Institute of Technology, Kanagawa, Japan;Tokyo Institute of Technology, Kanagawa, Japan
Venue:
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Year:
2007

Citing 4
Cited 4

Multi-Objective Optimization Using Evolutionary Algorithms

Multi-Objective Optimization Using Evolutionary Algorithms
Local search for multiobjective function optimization: pareto descent method

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Hybridization of genetic algorithm and local search in multiobjective function optimization: recommendation of GA then LS

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Constraint-handling method for multi-objective function optimization: Pareto descent repair operator

EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization

Using gradient-based information to deal with scalability in multi-objective evolutionary algorithms

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Computing gap free pareto front approximations with stochastic search algorithms

Evolutionary Computation
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Although multi-objective GA (MOGA) is an efficient multi-objective optimization (MOO) method, it has some limitations that need to be tackled, which include unguaranteed uniformity of solutions and uncertain finding of periphery of Pareto-optimal solutions. It has been shown that, on bi-objective problems, which are the subject of this paper, local Pareto-optimal solutions form curves. In this case, some of the limitations of MOGA can be resolved by sampling the curves uniformly in the variable space and in the objective space. This paper proposes Pareto Path Following (PPF) which does the sampling by extending the framework of Numerical Path Following, verifies that PPF exhibits the desired behaviors, and addresses the extension of PPF for problems with more than two objective functions.Application of PPF is not limited to refinement of solutions obtained with MOGA. PPF makes it natural to have a local Pareto-optimal solution curve as the unit of search, which leads to curve-based MOGA. PPF also enables examination of which Pareto-optimal solution curves are found by MOO methods, and performance metrics based on it can be defined. This paper proposes these applications of PPF in MOGA and compares standard MOGA and curve-based MOGA using the metrics to reveal their characteristics.