Offline Data Driven Evolutionary Optimization Based on Pruning Stacked Generalization

被引:0
作者
Liang Z.-P. [1 ]
Huang X.-J. [1 ]
Li S.-T. [1 ]
Wang X.-Y. [2 ]
Zhu Z.-X. [1 ]
机构
[1] College of Computer Science and Software Engineering, Shenzhen University, Shenzhen
[2] ZTE Corporation, Shenzhen
来源
Zidonghua Xuebao/Acta Automatica Sinica | 2023年 / 49卷 / 06期
关键词
evolutionary computation; offline data driven optimization; Stacked generalization (SG); surrogate model;
D O I
10.16383/j.aas.c220387
中图分类号
学科分类号
摘要
In the real world, there are many complex optimization problems in which the objective function is time-consuming or even unavailable. Traditional optimization methods are either unable to start or inefficient in solving such problems. Offline data driven evolutionary optimization method is no need to evaluate the real objective function in the process of evolutionary, which greatly promotes the solution of expensive optimization problems and unmodeled optimization problems. However, the effectiveness of offline data driven evolutionary optimization depends heavily on surrogate model. In order to improve the quality of surrogate model, this paper proposes a surrogate model construction method based on pruning stack generalization (SG). Specifically, on the one hand, the primary model pool is established based on heterogeneous base learners, and then the primary models are conducted by learning methods to improve the generality and accuracy of surrogate model. On the other hand, the primary models are pruned based on the ranking preservation indicator, which can not only improve the ensemble efficiency of the primary models, but also further improve the accuracy of the final surrogate model, and better guide the evolutionary search. In order to verify the effectiveness of the proposed method, it is compared with 7 state-of-the-arts offline data driven evolutionary optimization algorithms on 12 benchmark problems. The experimental results demonstrate the superior performance of proposed method over compared algorithms. © 2023 Science Press. All rights reserved.
引用
收藏
页码:1306 / 1325
页数:19
相关论文
共 57 条
[1]  
Eiben A E, Smith J., From evolutionary computation to the evolution of things, Nature, 521, 7553, (2015)
[2]  
Zhan Z H, Shi L, Tan K C, Zhang J., A survey on evolutionary computation for complex continuous optimization, Artificial Intelligence Review, 55, pp. 59-110, (2022)
[3]  
Feng Wen-Qing, Gong Dun-Wei, Multi-objective evolutionary optimization with objective space partition based on online perception of pareto front, Acta Electronica Sinica, 46, 8, pp. 1628-1643, (2020)
[4]  
Liang J, Yue C T, Qu B Y., Multimodal multi-objective optimization: A preliminary study, Proceedings of the 18th IEEE Congress on Evolutionary Computation (CEC), pp. 2454-2461, (2016)
[5]  
Tian Y, Si L C, Zhang X Y, Cheng R., Evolutionary large-scale multi-objective optimization: A survey, ACM Computing Surveys, 54, 8, (2022)
[6]  
Wang Feng, Zhang Heng, Han Meng-Chen, Xing Li-Ning, Co-evolution based mixed-variable multi-objective particle swarm optimization for UAV cooperative multi-task allocation problem, Chinese Journal of Computers, 44, 10, pp. 1967-1983, (2021)
[7]  
Li J Y, Zhan Z H, Zhang J., Evolutionary computation for expensive optimization: A survey, Machine Intelligence Research, 19, pp. 3-23, (2022)
[8]  
He C, Tian Y, Wang H D, Jin Y C., A repository of real-world datasets for data-driven evolutionary multiobjective optimization, Complex & Intelligent Systems, 6, 1, pp. 189-197, (2020)
[9]  
Cheng R, He C, Jin Y C, Model-based evolutionary algorithms: A short survey, Complex & Intelligent Systems, 4, pp. 283-292, (2018)
[10]  
Sun C L, Li Z, Jin Y C., Surrogate-assisted expensive evolutionary many-objective optimization, Acta Automatica Sinica, 48, 4, pp. 1119-1128, (2022)