Surrogate-assisted evolutionary algorithm for expensive constrained multi-objective discrete optimization problems

被引:45
作者
Gu, Qinghua [1 ,2 ]
Wang, Qian [1 ,2 ]
Xiong, Neal N. [3 ]
Jiang, Song [2 ,4 ]
Chen, Lu [1 ,2 ]
机构
[1] Xian Univ Architecture & Technol, Sch Management, Xian 710055, Shaanxi, Peoples R China
[2] Xian Univ Architecture & Technol, Xian Key Lab Intelligent Ind Percept Calculat & D, Xian 710055, Peoples R China
[3] Northeastern State Univ, Dept Math & Comp Sci, Tahlequah, OK USA
[4] Xian Univ Architecture & Technol, Sch Resources Engn, Xian 710055, Shaanxi, Peoples R China
基金
中国国家自然科学基金; 中国博士后科学基金;
关键词
Data-driven optimization; Constrained multi-objective discrete optimization problems; Surrogate model; Random forest; Strength pareto evolutionary algorithm; Stochastic ranking strategy; REDUNDANCY ALLOCATION PROBLEM; STOCHASTIC RANKING; GENETIC ALGORITHM; DESIGN; REGRESSION;
D O I
10.1007/s40747-020-00249-x
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Surrogate-assisted optimization has attracted much attention due to its superiority in solving expensive optimization problems. However, relatively little work has been dedicated to addressing expensive constrained multi-objective discrete optimization problems although there are many such problems in the real world. Hence, a surrogate-assisted evolutionary algorithm is proposed in this paper for this kind of problem. Specifically, random forest models are embedded in the framework of the evolutionary algorithm as surrogates to improve approximate accuracy for discrete optimization problems. To enhance the optimization efficiency, an improved stochastic ranking strategy based on the fitness mechanism and adaptive probability operator is presented, which also takes into account both convergence and diversity to advance the quality of candidate solutions. To validate the proposed algorithm, it is comprehensively compared with several well-known optimization algorithms on several benchmark problems. Numerical experiments are demonstrated that the proposed algorithm is very promising for the expensive constrained multi-objective discrete optimization problems.
引用
收藏
页码:2699 / 2718
页数:20
相关论文
共 61 条
[1]   Particle swarm optimisation with stochastic ranking for constrained numerical and engineering benchmark problems [J].
Ali, Layak ;
Sabat, Samrat L. ;
Udgata, Siba K. .
INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2012, 4 (03) :155-166
[2]  
[Anonymous], 2006, 2006 IEEE C EV COMP
[3]   Multi-objective optimization of reliability-redundancy allocation problem with cold-standby strategy using NSGA-II [J].
Ardakan, Mostafa Abouei ;
Rezvan, Mohammad Taghi .
RELIABILITY ENGINEERING & SYSTEM SAFETY, 2018, 172 :225-238
[4]   Reliability-redundancy allocation problem with cold-standby redundancy strategy [J].
Ardakan, Mostafa Abouei ;
Hamadani, Ali Zeinal .
SIMULATION MODELLING PRACTICE AND THEORY, 2014, 42 :107-118
[5]  
Bajer L, 2013, LECT NOTES COMPUT SC, V7741, P481
[6]   SRIFA: Stochastic Ranking with Improved-Firefly-Algorithm for Constrained Optimization Engineering Design Problems [J].
Balande, Umesh ;
Shrimankar, Deepti .
MATHEMATICS, 2019, 7 (03)
[7]   Logistic regression when binary predictor variables are highly correlated [J].
Barker, L ;
Brown, C .
STATISTICS IN MEDICINE, 2001, 20 (9-10) :1431-1442
[8]   Model-based methods for continuous and discrete global optimization [J].
Bartz-Beielstein, Thomas ;
Zaefferer, Martin .
APPLIED SOFT COMPUTING, 2017, 55 :154-167
[9]   A hybrid multi-objective evolutionary optimization approach for the robust vehicle routing problem [J].
Bederina, Hiba ;
Hifi, Mhand .
APPLIED SOFT COMPUTING, 2018, 71 :980-993
[10]   Random forests [J].
Breiman, L .
MACHINE LEARNING, 2001, 45 (01) :5-32