Reducing Negative Transfer Learning via Clustering for Dynamic Multiobjective Optimization
- 18 January 2022
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 26 (5) , 1102-1116
Abstract
Dynamic multiobjective optimization problems (DMOPs) aim to optimize multiple (often conflicting) objectives that are changing over time. Recently, there are a number of promising algorithms proposed based on transfer learning methods to solve DMOPs. However, it is very challenging to reduce the negative effect in transfer learning and find more effective transferred solutions. To fill this research gap, this article proposes a clustering-based transfer (CBT) learning method to solve DMOPs. When the environment changes, two novel operations (clustering-based selection (CBS) and CBT) are used to guide knowledge transfer. Specifically, CBS aims to find a population with nondominated solutions and dominated solutions as the training data for the new environment. Then, CBT further collects the previous Pareto-optimal solutions and some noise solutions as the training data for the previous environment. Two training data sets from different environments are, respectively, divided into multiple clusters and transfer learning is conducted on two similar clusters with high probability to reduce the negative effect, which can train an accurate prediction model to identify the promising solutions for the new environment. Empirical studies have been conducted on 14 benchmark DMOPs and one real-life path planning problem of unmanned air/ground vehicles, which validate the effectiveness of our proposed method. Especially, our method can significantly reduce negative transfer on 12 out of 14 cases when compared with direct transfer learning.Keywords
Funding Information
- National Key Research and Development Project, Ministry of Science and Technology, China (2018AAA0101301)
- Joint Funds of the National Natural Science Foundation of China (NSFC) under Key Program Grant (U1713212)
- NSFC (61876110, 61876162, 61836005)
- Research Grants Council of the Hong Kong SAR (PolyU11202418, PolyU11209219)
- Shenzhen Scientific Research and Development Funding Program (JCYJ20190808164211203)
This publication has 64 references indexed in Scilit:
- A Population Prediction Strategy for Evolutionary Dynamic Multiobjective OptimizationIEEE Transactions on Cybernetics, 2013
- Dynamic Multi-objective Optimization: A Survey of the State-of-the-Art2013
- LIBSVMACM Transactions on Intelligent Systems and Technology, 2011
- A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithmsSwarm and Evolutionary Computation, 2011
- Dynamic Multi-objective Optimization and Decision-Making Using Modified NSGA-II: A Case Study on Hydro-thermal Power Scheduling2007
- Evolutionary multi-objective optimization: a historical view of the fieldIEEE Computational Intelligence Magazine, 2006
- Dynamic Multiobjective Optimization Problems: Test Cases, Approximations, and ApplicationsIEEE Transactions on Evolutionary Computation, 2004
- Performance assessment of multiobjective optimizers: an analysis and reviewIEEE Transactions on Evolutionary Computation, 2003
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- A genetic algorithm tutorialStatistics and Computing, 1994