TY - JOUR
T1 - A Scalable Test Suite for Continuous Dynamic Multiobjective Optimization
AU - Jiang, Shouyong
AU - Kaiser, Marcus
AU - Yang, Shengxiang
AU - Kollias, Stefanos
AU - Krasnogor, Natalio
N1 - Funding Information:
Manuscript received September 11, 2018; revised December 7, 2018; accepted January 16, 2019. Date of publication February 15, 2019; date of current version May 7, 2020. The work of S. Jiang, M. Kaiser, and N. Krasnogor was supported by Engineering and Physical Sciences Research Council (EPSRC) for funding project “Synthetic Portabolomics: Leading the Way at the Crossroads of the Digital and the Bio Economies,” under Grant EP/N031962/1. The work of S. Yang was supported by the Engineering and Physical Sciences Research Council under Grant EP/K001310/1. This paper was recommended by Associate Editor K.-C. Tan. (Corresponding author: Natalio Krasnogor.) S. Jiang, M. Kaiser, and N. Krasnogor are with the Interdisciplinary Computing and Complex Biosystems Research Group, School of Computing, Newcastle University, Newcastle upon Tyne NE4 5TG, U.K. (e-mail: math4neu@gmail.com; marcus.kaiser@ncl.ac.uk; natalio.krasnogor@ncl.ac.uk).
PY - 2020/6
Y1 - 2020/6
N2 - Dynamic multiobjective optimization (DMO) has gained increasing attention in recent years. Test problems are of great importance in order to facilitate the development of advanced algorithms that can handle dynamic environments well. However, many of the existing dynamic multiobjective test problems have not been rigorously constructed and analyzed, which may induce some unexpected bias when they are used for algorithmic analysis. In this paper, some of these biases are identified after a review of widely used test problems. These include poor scalability of objectives and, more important, problematic overemphasis of static properties rather than dynamics making it difficult to draw accurate conclusion about the strengths and weaknesses of the algorithms studied. A diverse set of dynamics and features is then highlighted that a good test suite should have. We further develop a scalable continuous test suite, which includes a number of dynamics or features that have been rarely considered in literature but frequently occur in real life. It is demonstrated with empirical studies that the proposed test suite is more challenging to the DMO algorithms found in the literature. The test suite can also test algorithms in ways that existing test suites cannot.
AB - Dynamic multiobjective optimization (DMO) has gained increasing attention in recent years. Test problems are of great importance in order to facilitate the development of advanced algorithms that can handle dynamic environments well. However, many of the existing dynamic multiobjective test problems have not been rigorously constructed and analyzed, which may induce some unexpected bias when they are used for algorithmic analysis. In this paper, some of these biases are identified after a review of widely used test problems. These include poor scalability of objectives and, more important, problematic overemphasis of static properties rather than dynamics making it difficult to draw accurate conclusion about the strengths and weaknesses of the algorithms studied. A diverse set of dynamics and features is then highlighted that a good test suite should have. We further develop a scalable continuous test suite, which includes a number of dynamics or features that have been rarely considered in literature but frequently occur in real life. It is demonstrated with empirical studies that the proposed test suite is more challenging to the DMO algorithms found in the literature. The test suite can also test algorithms in ways that existing test suites cannot.
KW - Adversarial examples
KW - dynamic multiobjective optimization (DMO)
KW - dynamics
KW - Pareto front
KW - scalable test problems
UR - http://www.scopus.com/inward/record.url?scp=85084547458&partnerID=8YFLogxK
U2 - 10.1109/TCYB.2019.2896021
DO - 10.1109/TCYB.2019.2896021
M3 - Article
C2 - 30794198
AN - SCOPUS:85084547458
VL - 50
SP - 2814
EP - 2826
JO - IEEE Transactions on Cybernetics
JF - IEEE Transactions on Cybernetics
SN - 2168-2267
IS - 6
ER -