TY - GEN
T1 - Preliminary Results for Subpopulation Algorithm Based on Novelty (SAN) Compared with the State of the Art
AU - Jiang, Yuzi
AU - Vargas, Danilo Vasconcellos
N1 - Funding Information:
ACKNOWLEDGMENTS This work was supported by JST, ACT-I Grant Number JP-50243 and JSPS KAKENHI Grant Number JP20241216.
Publisher Copyright:
© 2021 IEEE.
PY - 2021/6/8
Y1 - 2021/6/8
N2 - Subpopulation algorithm based on novelty (SAN) has been investigated for some time and proved that it can be used for multi-objective optimization problems. It outperforms subpopulation algorithm based on general differential evolution (SAGDE) under the same framework, which highlights its special intrinsic mechanism. This intrinsic mechanism has something in common with some state-of-the-art multi-objective optimization algorithms. However, SAN has not yet proved its ability to be better than these algorithms and has not proven its ability to optimize problems with more than 5 objectives. In this paper, the advantage of SAN over other subpopulation algorithms, i.e., novelty search, is presented in detail. The similarities and differences between the intrinsic mechanisms of SAN, nondominated sorting genetic algorithm series (NSGAs) and multi-objective evolutionary algorithm based on decomposition (MOEA/D) are also analyzed. Finally, these three algorithms are evaluated on several well-known benchmark problems with more than two objectives. The result shows SAN surpassed NSGA-III (latest version in NSGAs) in 20 out of the 32 problems, surpassed MOEA/D in 26 problems in 10 runs, which preliminary proved it surpasses the State-of-the-Art.
AB - Subpopulation algorithm based on novelty (SAN) has been investigated for some time and proved that it can be used for multi-objective optimization problems. It outperforms subpopulation algorithm based on general differential evolution (SAGDE) under the same framework, which highlights its special intrinsic mechanism. This intrinsic mechanism has something in common with some state-of-the-art multi-objective optimization algorithms. However, SAN has not yet proved its ability to be better than these algorithms and has not proven its ability to optimize problems with more than 5 objectives. In this paper, the advantage of SAN over other subpopulation algorithms, i.e., novelty search, is presented in detail. The similarities and differences between the intrinsic mechanisms of SAN, nondominated sorting genetic algorithm series (NSGAs) and multi-objective evolutionary algorithm based on decomposition (MOEA/D) are also analyzed. Finally, these three algorithms are evaluated on several well-known benchmark problems with more than two objectives. The result shows SAN surpassed NSGA-III (latest version in NSGAs) in 20 out of the 32 problems, surpassed MOEA/D in 26 problems in 10 runs, which preliminary proved it surpasses the State-of-the-Art.
UR - http://www.scopus.com/inward/record.url?scp=85113752074&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85113752074&partnerID=8YFLogxK
U2 - 10.1109/CYBCONF51991.2021.9464153
DO - 10.1109/CYBCONF51991.2021.9464153
M3 - Conference contribution
AN - SCOPUS:85113752074
T3 - 2021 5th IEEE International Conference on Cybernetics, CYBCONF 2021
SP - 67
EP - 72
BT - 2021 5th IEEE International Conference on Cybernetics, CYBCONF 2021
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 5th IEEE International Conference on Cybernetics, CYBCONF 2021
Y2 - 8 June 2021 through 10 June 2021
ER -