Back to Search
Start Over
Dynamic Multiobjectives Optimization With a Changing Number of Objectives.
- Source :
- IEEE Transactions on Evolutionary Computation; Feb2018, Vol. 22 Issue 1, p157-171, 15p
- Publication Year :
- 2018
-
Abstract
- Existing studies on dynamic multiobjective optimization (DMO) focus on problems with time-dependent objective functions, while the ones with a changing number of objectives have rarely been considered in the literature. Instead of changing the shape or position of the Pareto-optimal front/set (PF/PS) when having time-dependent objective functions, increasing or decreasing the number of objectives usually leads to the expansion or contraction of the dimension of the PF/PS manifold. Unfortunately, most existing dynamic handling techniques can hardly be adapted to this type of dynamics. In this paper, we report our attempt toward tackling the DMO problems with a changing number of objectives. We implement a dynamic two-archive evolutionary algorithm which maintains two co-evolving populations simultaneously. In particular, these two populations are complementary to each other: one concerns more about the convergence while the other concerns more about the diversity. The compositions of these two populations are adaptively reconstructed once the environment changes. In addition, these two populations interact with each other via a mating selection mechanism. Comprehensive experiments are conducted on various benchmark problems with a time-dependent number of objectives. Empirical results fully demonstrate the effectiveness of our proposed algorithm. [ABSTRACT FROM PUBLISHER]
Details
- Language :
- English
- ISSN :
- 1089778X
- Volume :
- 22
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Evolutionary Computation
- Publication Type :
- Academic Journal
- Accession number :
- 127632760
- Full Text :
- https://doi.org/10.1109/TEVC.2017.2669638