Surrogate-Assisted Evolutionary Algorithm With Model and Infill Criterion Auto-Configuration
Pages 1114 - 1126
Abstract
Surrogate-assisted evolutionary algorithms (SAEAs) have proven to be effective in solving computationally expensive optimization problems (EOPs). However, the performance of SAEAs heavily relies on the surrogate model and infill criterion used. To improve the generalization of SAEAs and enable them to solve a wide range of EOPs, this article proposes an SAEA called AutoSAEA, which features model and infill criterion auto-configuration. Specifically, AutoSAEA formulates model and infill criterion selection as a two-level multiarmed bandit problem (TL-MAB). The first and second levels cooperate in selecting the surrogate model and infill criterion, respectively. A two-level reward (TL-R) measures the value of the surrogate model and infill criterion, while a two-level upper confidence bound (TL-UCB) selects the model and infill criterion in an online manner. Numerous experiments validate the superiority of AutoSAEA over some state-of-the-art SAEAs on complex benchmark problems and a real-world oil reservoir production optimization problem.
References
[1]
Y. Lian, A. Oyama, and M.-S. Liou, “Progress in design optimization using evolutionary algorithms for aerodynamic problems,” Progr. Aerosp. Sci., vol. 46, nos. 5–6, pp. 199–223, 2010.
[2]
T. W. Simpson, A. J. Booker, D. Ghosh, A. A. Giunta, P. N. Koch, and R.-J. Yang, “Approximation methods in multidisciplinary analysis and optimization: A panel discussion,” Struct. Multidiscipl. Optim., vol. 27, no. 5, pp. 302–313, 2004.
[3]
Q. Chen, G. Li, Q. Zhang, Q. Tang, and G. Zhang, “Optimal design of passive control of space tethered-net capture system,” IEEE Access, vol. 7, pp. 131383–131394, 2019.
[4]
Z. Wang, Y.-S. Ong, J. Sun, A. Gupta, and Q. Zhang, “A generator for multiobjective test problems with difficult-to-approximate Pareto front boundaries,” IEEE Trans. Evol. Comput., vol. 23, no. 4, pp. 556–571, Aug. 2019.
[5]
W. Gao, Z. Wei, M. Gong, and G. G. Yen, “Solving expensive multimodal optimization problem by a decomposition differential evolution algorithm,” IEEE Trans. Cybern., vol. 53, no. 4, pp. 2236–2246, Apr. 2023.
[6]
G. Li and Q. Zhang, “Multiple penalties and multiple local surrogates for expensive constrained optimization,” IEEE Trans. Evol. Comput., vol. 25, no. 4, pp. 769–778, Aug. 2021.
[7]
G. Li, L. Xie, Z. Wang, H. Wang, and M. Gong, “Evolutionary algorithm with individual-distribution search strategy and regression-classification surrogates for expensive optimization,” Inf. Sci., vol. 634, pp. 423–442, Jul. 2023.
[8]
H. Wang, H. Xu, and Z. Zhang, “High-dimensional multi-objective Bayesian optimization with block coordinate updates: Case studies in intelligent transportation system,” IEEE Trans. Intell. Transp. Syst., early access, Feb. 7, 2023. 10.1109/TITS.2023.3241069.
[9]
T. Goel, R. T. Hafkta, and W. Shyy, “Comparing error estimation measures for polynomial and kriging approximation of noise-free functions,” Struct. Multidiscip. Optim., vol. 38, no. 5, pp. 429–442, 2009.
[10]
L. M. Zouhal and T. Denoeux, “An evidence-theoretic k-NN rule with parameter optimization,” IEEE Trans. Syst., Man, Cybern. C, Appl. Rev., vol. 28, no. 2, pp. 263–271, Mar. 1998.
[11]
S. M. Clarke, J. H. Griebsch, and T. W. Simpson, “Analysis of support vector regression for approximation of complex engineering analyses,” J. Mech. Design, vol. 127, no. 6, pp. 1077–1087, 2005.
[12]
Y. Jin, M. Olhofer, and B. Sendhoff, “A framework for evolutionary optimization with approximate fitness functions,” IEEE Trans. Evol. Comput., vol. 6, no. 5, pp. 481–494, Oct. 2002.
[13]
B. Liu, Q. Zhang, and G. G. E. Gielen, “A Gaussian process surrogate model assisted evolutionary algorithm for medium scale expensive optimization problems,” IEEE Trans. Evol. Comput., vol. 18, no. 2, pp. 180–192, Apr. 2014.
[14]
J. Tian, Y. Tan, J. Zeng, C. Sun, and Y. Jin, “Multiobjective infill criterion driven Gaussian process-assisted particle swarm optimization of high-dimensional expensive problems,” IEEE Trans. Evol. Comput., vol. 23, no. 3, pp. 459–472, Jul. 2019.
[15]
F. Li, X. Cai, L. Gao, and W. Shen, “A surrogate-assisted multiswarm optimization algorithm for high-dimensional computationally expensive problems,” IEEE Trans. Cybern., vol. 51, no. 3, pp. 1390–1402, Mar. 2021.
[16]
Y. Liu, J. Liu, and Y. Jin, “Surrogate-assisted multipopulation particle swarm optimizer for high-dimensional expensive optimization,” IEEE Trans. Syst., Man, Cybern., Syst., vol. 52, no. 7, pp. 4671–4684, Jul. 2022.
[17]
J. Liu, Y. Wang, G. Sun, and T. Pang, “Multisurrogate-assisted ant colony optimization for expensive optimization problems with continuous and categorical variables,” IEEE Trans. Cybern., vol. 52, no. 11, pp. 11348–11361, Nov. 2022.
[18]
W. Wang, H.-L. Liu, and K. C. Tan, “A surrogate-assisted differential evolution algorithm for high-dimensional expensive optimization problems,” IEEE Trans. Cybern., vol. 53, no. 4, pp. 2685–2697, Apr. 2023.
[19]
H. Wang, Y. Jin, and J. Doherty, “Committee-based active learning for surrogate-assisted particle swarm optimization of expensive problems,” IEEE Trans. Cybern., vol. 47, no. 9, pp. 2664–2677, Sep. 2017.
[20]
T. Sonoda and M. Nakata, “Multiple classifiers-assisted evolutionary algorithm based on decomposition for high-dimensional multi-objective problems,” IEEE Trans. Evol. Comput., vol. 26, no. 6, pp. 1581–1595, Dec. 2022.
[21]
X. Wu, Q. Lin, J. Li, K. C. Tan, and V. C. Leung, “An ensemble surrogate-based coevolutionary algorithm for solving large-scale expensive optimization problems,” IEEE Trans. Cybern., early access, Sep. 16, 2022. 10.1109/TCYB.2022.3200517.
[22]
M. W. Hoffman, E. Brochu, and N. De Freitas, “Portfolio allocation for Bayesian optimization,” in Proc. UAI, 2011, pp. 327–336.
[23]
Z. Song, H. Wang, C. He, and Y. Jin, “A Kriging-assisted two-archive evolutionary algorithm for expensive many-objective optimization,” IEEE Trans. Evol. Comput., vol. 25, no. 6, pp. 1013–1027, Dec. 2021.
[24]
Z. Liu, H. Wang, and Y. Jin, “Performance indicator-based adaptive model selection for offline data-driven multiobjective evolutionary optimization,” IEEE Trans. Cybern., early access, May 13, 2022. 10.1109/TCYB.2022.3170344.
[25]
H. Zhen, W. Gong, and L. Wang, “Evolutionary sampling agent for expensive problems,” IEEE Trans. Evol. Comput., vol. 27, no. 3, pp. 716–727, Jun. 2023.
[26]
Q. Zhang, W. Liu, E. Tsang, and B. Virginas, “Expensive multiobjective optimization by MOEA/D with Gaussian process model,” IEEE Trans. Evol. Comput., vol. 14, no. 3, pp. 456–474, Jun. 2010.
[27]
J. E. Dennis and V. Torczon, “Managing approximation models in optimization,” Multidiscip. Design Optim. State-Art, vol. 5, pp. 330–347, Nov. 1998.
[28]
G. Li, Q. Zhang, Q. Lin, and W. Gao, “A three-level radial basis function method for expensive optimization,” IEEE Trans. Cybern., vol. 52, no. 7, pp. 5720–5731, Jul. 2022.
[29]
J. Zhang, A. Zhou, and G. Zhang, “A multiobjective evolutionary algorithm based on decomposition and preselection,” in Bio-Inspired Computing—Theories and Applications. Heidelberg, Germany: Springer, 2015, pp. 631–642.
[30]
M. Yu, X. Li, and J. Liang, “A dynamic surrogate-assisted evolutionary algorithm framework for expensive structural optimization,” Struct. Multidiscip. Optim., vol. 61, no. 2, pp. 711–729, 2020.
[31]
H. Zhen, W. Gong, L. Wang, F. Ming, and Z. Liao, “Two-stage data-driven evolutionary optimization for high-dimensional expensive problems,” IEEE Trans. Cybern., vol. 53, no. 4, pp. 2368–2379, Apr. 2023.
[32]
X. Wang, G. G. Wang, B. Song, P. Wang, and Y. Wang, “A novel evolutionary sampling assisted optimization method for high-dimensional expensive problems,” IEEE Trans. Evol. Comput., vol. 23, no. 5, pp. 815–827, Oct. 2019.
[33]
X. Cai, L. Gao, and X. Li, “Efficient generalized surrogate-assisted evolutionary algorithm for high-dimensional expensive problems,” IEEE Trans. Evol. Comput., vol. 24, no. 2, pp. 365–379, Apr. 2020.
[34]
Z. Wanget al., “Multiobjective optimization-aided decision-making system for large-scale manufacturing planning,” IEEE Trans. Cybern., vol. 52, no. 8, pp. 8326–8339, Aug. 2022.
[35]
D. Guo, Y. Jin, J. Ding, and T. Chai, “Heterogeneous ensemble-based infill criterion for evolutionary multiobjective optimization of expensive problems,” IEEE Trans. Cybern., vol. 49, no. 3, pp. 1012–1025, Mar. 2019.
[36]
J.-Y. Li, Z.-H. Zhan, H. Wang, and J. Zhang, “Data-driven evolutionary algorithm with perturbation-based ensemble surrogates,” IEEE Trans. Cybern., vol. 51, no. 8, pp. 3925–3937, Aug. 2021.
[37]
L. Kocsis and C. Szepesvári, “Bandit based Monte-Carlo planning,” in Proc. Eur. Conf. Mach. Learn., 2006, pp. 282–293.
[38]
S. Pandey, D. Chakrabarti, and D. Agarwal, “Multi-armed bandit problems with dependent arms,” in Proc. 24th Int. Conf. Mach. Learn., 2007, pp. 721–728.
[39]
E. Carlsson, D. Dubhashi, and F. D. Johansson, “Thompson sampling for bandits with clustered arms,” 2021, arXiv:2109.01656.
[40]
D. R. Jones, M. Schonlau, and W. J. Welch, “Efficient global optimization of expensive black-box functions,” J. Global Optim., vol. 13, no. 4, p. 455, 1998.
[41]
P. I. Frazier, “A tutorial on Bayesian optimization,” 2018, arXiv:1807.02811.
[42]
D. Zhan and H. Xing, “A fast Kriging-assisted evolutionary algorithm based on incremental learning,” IEEE Trans. Evol. Comput., vol. 25, no. 5, pp. 941–955, Oct. 2021.
[43]
D. D. Cox and S. John, “A statistical method for global optimization,” in Proc. IEEE Int. Conf. Syst., Man, Cybern., 1992, pp. 1241–1246.
[44]
J. Zhang, A. Zhou, and G. Zhang, “A classification and Pareto domination based multiobjective evolutionary algorithm,” in Proc. IEEE Congr. Evol. Comput. (CEC), 2015, pp. 2883–2890.
[45]
C. Sun, Y. Jin, R. Cheng, J. Ding, and J. Zeng, “Surrogate-assisted cooperative swarm optimization of high-dimensional expensive problems,” IEEE Trans. Evol. Comput., vol. 21, no. 4, pp. 644–660, Aug. 2017.
[46]
Y. Haibo, T. Ying, Z. Jianchao, S. Chaoli, and J. Yaochu, “Surrogate-assisted hierarchical particle swarm optimization,” Inf. Sci., vols. 454–455, pp. 59–72, Jul. 2018.
[47]
F.-F. Weiet al., “A classifier-assisted level-based learning swarm optimizer for expensive optimization,” IEEE Trans. Evol. Comput., vol. 25, no. 2, pp. 219–233, Apr. 2020.
[48]
Q. Liu, R. Cheng, Y. Jin, M. Heiderich, and T. Rodemann, “Reference vector-assisted adaptive model management for surrogate-assisted many-objective optimization,” IEEE Trans. Syst., Man, Cybern., Syst., vol. 52, no. 12, pp. 7760–7773, Dec. 2022.
[49]
G. Li, Q. Zhang, J. Sun, and Z. Han, “Radial basis function assisted optimization method with batch infill sampling criterion for expensive optimization,” in Proc. IEEE Congr. Evol. Comput. (CEC), 2019, pp. 1664–1671.
[50]
A. I. Khuri and S. Mukhopadhyay, “Response surface methodology,” Wiley Interdiscipl. Rev. Comput. Stat., vol. 2, no. 2, pp. 128–149, 2010.
[51]
W. Gao, G. Li, Q. Zhang, Y. Luo, and Z. Wang, “Solving nonlinear equation systems by a two-phase evolutionary algorithm,” IEEE Trans. Syst., Man, Cybern., Syst., vol. 51, no. 9, pp. 5652–5663, Sep. 2021.
[52]
L. Pan, C. He, Y. Tian, H. Wang, X. Zhang, and Y. Jin, “A classification-based surrogate-assisted evolutionary algorithm for expensive many-objective optimization,” IEEE Trans. Evol. Comput., vol. 23, no. 1, pp. 74–88, Feb. 2019.
[53]
T. Zhao, M. Li, and M. Poloczek, “Fast reconfigurable antenna state selection with hierarchical Thompson sampling,” in Proc. IEEE Int. Conf. Commun. (ICC), 2019, pp. 1–6.
[54]
R. Singh, F. Liu, Y. Sun, and N. Shroff, “Multi-armed bandits with dependent arms,” 2020, arXiv:2010.09478.
[55]
J. Hong, B. Kveton, M. Zaheer, and M. Ghavamzadeh, “Hierarchical Bayesian bandits,” in Proc. Int. Conf. Artif. Intell. Stat., 2022, pp. 7724–7741.
[56]
P. N. Suganthanet al., “Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization,” Nanyang Technol. Univ., Singapore, IIT, Kanpur, India, KanGAL Rep. #2005005, 2005.
[57]
J. Liang, B. Qu, P. Suganthan, and Q. Chen, “Problem definitions and evaluation criteria for the CEC 2015 competition on learning-based real-parameter single objective optimization,” Comput. Intell. Lab., Nanyang Technol. Univ., Singapore, Rep. 201411A, 2014.
[58]
G. Li, Z. Wang, and M. Gong, “Expensive optimization via surrogate-assisted and model-free evolutionary optimization,” IEEE Trans. Syst., Man, Cybern., Syst., vol. 53, no. 5, pp. 2758–2769, May 2023.
[59]
Z. Wang, Y.-S. Ong, and H. Ishibuchi, “On scalable multiobjective test problems with hardly dominated boundaries,” IEEE Trans. Evol. Comput., vol. 23, no. 2, pp. 217–231, Apr. 2019.
[60]
G. Chen, X. Luo, J. J. Jiao, and X. Xue, “Data-driven evolutionary algorithm for oil reservoir well-placement and control optimization,” Fuel, vol. 326, Oct. 2022, Art. no.
[61]
J.-D. Jansen, R.-M. Fonseca, S. Kahrobaei, M. Siraj, G. Van Essen, and P. Van den Hof, “The egg model—A geological ensemble for reservoir simulation,” Geosci. Data J., vol. 1, no. 2, pp. 192–195, 2014.
[62]
K.-A. Lie, An Introduction to Reservoir Simulation Using MATLAB/GNU Octave: User Guide for the MATLAB Reservoir Simulation Toolbox (MRST). Cambridge, U.K.: Cambridge Univ. Press, 2019.
Index Terms
- Surrogate-Assisted Evolutionary Algorithm With Model and Infill Criterion Auto-Configuration
Index terms have been assigned to the content through auto-classification.
Recommendations
Surrogate-assisted evolutionary algorithm with hierarchical surrogate technique and adaptive infill strategy
AbstractFitness functions of real-world optimization problems often need to be analyzed by expensive experiments or numerical simulations. Integrating these expensive simulations or experiments directly into optimization algorithms would result in ...
Highlights- Propose a novel hierarchical surrogate technique.
- Propose an adaptive infill strategy for enhancing the evolutionary search.
- Develop an efficient surrogate-assisted evolutionary algorithm.
A twofold infill criterion-driven heterogeneous ensemble surrogate-assisted evolutionary algorithm for computationally expensive problems
AbstractOver the past decade, surrogate-assisted evolutionary algorithms (SAEAs) have received considerable attention in solving expensive optimization problems from both academia and industry. In SAEAs, model management plays a key role in ...
Highlights- An exploration-based and exploitation-based infill criterion is proposed to select individuals for exact fitness evaluations.
A surrogate assisted evolutionary multitasking optimization algorithm▪
AbstractEvolutionary algorithms (EAs) have been applied with strong abilities to solve a wide range of applications, but it can solve one problem at a time. To improve efficiency, an emerging research paradigm in the field of evolutionary ...
Highlights- The surrogate model is used to solve multitasking optimization problems.
- The ...
Comments
Information & Contributors
Information
Published In
1089-778X © 2023 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See https://www.ieee.org/publications/rights/index.html for more information.
Publisher
IEEE Press
Publication History
Published: 03 July 2023
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 06 Jan 2025