Adaptive weights generation for decomposition-based multi-objective optimization using Gaussian process regression
Authors:
Open Access
- 1 July 2017
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 641-648
Abstract
By transforming a multi-objective optimization problem into a number of single-objective optimization problems and optimizing them simultaneously, decomposition-based evolutionary multi-objective optimization algorithms have attracted much attention in the field of multi-objective optimization. In decomposition-based algorithms, the population diversity is maintained using a set of predefined weight vectors, which are often evenly sampled on a unit simplex. However, when the Pareto front of the problem is not a hyperplane but more complex, the distribution of the final solution set will not be that uniform. In this paper, we propose an adaptive method to periodically regenerate the weight vectors for decomposition-based multi-objective algorithms according to the geometry of the estimated Pareto front. In particular, the Pareto front is estimated via Gaussian process regression. Thereafter, the weight vectors are reconstructed by sampling a set of points evenly distributed on the estimated Pareto front. Experimental studies on a set of multi-objective optimization problems with different Pareto front geometries verify the effectiveness of the proposed adaptive weights generation method.Keywords
Funding Information
- Hong Kong RGC General Research Fund (9042038)
This publication has 21 references indexed in Scilit:
- Preference-inspired co-evolutionary algorithms using weight vectorsEuropean Journal of Operational Research, 2015
- An Evolutionary Many-Objective Optimization Algorithm Based on Dominance and DecompositionIEEE Transactions on Evolutionary Computation, 2014
- MOEA/D with Adaptive Weight AdjustmentEvolutionary Computation, 2014
- Active Learning of Pareto FrontsIEEE Transactions on Neural Networks and Learning Systems, 2013
- An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box ConstraintsIEEE Transactions on Evolutionary Computation, 2013
- SMS-EMOA: Multiobjective selection based on dominated hypervolumeEuropean Journal of Operational Research, 2007
- Indicator-Based Selection in Multiobjective Search2004
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approachIEEE Transactions on Evolutionary Computation, 1999
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization ProblemsSIAM Journal on Optimization, 1998