518
Views
33
Downloads
2
Crossref
N/A
WoS
3
Scopus
N/A
CSCD
Some optimization problems in scientific research, such as the robustness optimization for the Internet of Things and the neural architecture search, are large-scale in decision space and expensive for objective evaluation. In order to get a good solution in a limited budget for the large-scale expensive optimization, a random grouping strategy is adopted to divide the problem into some low-dimensional sub-problems. A surrogate model is then trained for each sub-problem using different strategies to select training data adaptively. After that, a dynamic infill criterion is proposed corresponding to the models currently used in the surrogate-assisted sub-problem optimization. Furthermore, an escape mechanism is proposed to keep the diversity of the population. The performance of the method is evaluated on CEC’2013 benchmark functions. Experimental results show that the algorithm has better performance in solving expensive large-scale optimization problems.
Some optimization problems in scientific research, such as the robustness optimization for the Internet of Things and the neural architecture search, are large-scale in decision space and expensive for objective evaluation. In order to get a good solution in a limited budget for the large-scale expensive optimization, a random grouping strategy is adopted to divide the problem into some low-dimensional sub-problems. A surrogate model is then trained for each sub-problem using different strategies to select training data adaptively. After that, a dynamic infill criterion is proposed corresponding to the models currently used in the surrogate-assisted sub-problem optimization. Furthermore, an escape mechanism is proposed to keep the diversity of the population. The performance of the method is evaluated on CEC’2013 benchmark functions. Experimental results show that the algorithm has better performance in solving expensive large-scale optimization problems.
K. Deb, A. R. Reddy, and G. Singh, Optimal scheduling of casting sequence using genetic algorithms, Materials and Manufacturing Processes, vol. 18, no. 3, pp. 409–432, 2003.
Z. Yang, K. Tang, and X. Yao, Large scale evolutionary optimization using cooperative coevolution, Information Sciences, vol. 178, no. 15, pp. 2985–2999, 2008.
M. N. Omidvar, X. Li, Y. Mei, and X. Yao, Cooperative co-evolution with differential grouping for large scale optimization, IEEE Transactions on Evolutionary Computation, vol. 18, no. 3, pp. 378–393, 2013.
M. N. Omidvar, M. Yang, Y. Mei, X. Li, and X. Yao, DG2: A faster and more accurate differential grouping for large-scale black-box optimization, IEEE Transactions on Evolutionary Computation, vol. 21, no. 6, pp. 929–942, 2017.
R. Cheng and Y. Jin, A competitive swarm optimizer for large scale optimization, IEEE Transactions on Cybernetics, vol. 45, no. 2, pp. 191–204, 2014.
R. Cheng and Y. Jin, A social learning particle swarm optimization algorithm for scalable optimization, Information Sciences, vol. 291, pp. 43–60, 2015.
Z. Ren, A. Chen, M. Wang, Y. Yang, Y. Liang, and K. Shang, Bi-hierarchical cooperative coevolution for large scale global optimization, IEEE Access, vol. 8, pp. 41913–41928, 2020.
C. Sun, J. Ding, J. Zeng, and Y. Jin, A fitness approximation assisted competitive swarm optimizer for large scale expensive optimization problems, Memetic Computing, vol. 10, no. 2, pp. 123–134, 2018.
C. Sun, J. Zeng, J. Pan, S. Xue, and Y. Jin, A new fitness estimation strategy for particle swarm optimization, Information Sciences, vol. 221, pp. 355–370, 2013.
S. Chen, C. F. N. Cowan, and P. Grant, Orthogonal least squares learning algorithm for radial basis function networks, IEEE Transactions on Neural Networks, vol. 2, no. 2, pp. 302–309, 1991.
Y. Tang, J. Chen, and J. Wei, A surrogate-based particle swarm optimization algorithm for solving optimization problems with expensive black box functions, Engineering Optimization, vol. 45, no. 5, pp. 557–576, 2013.
Y. Jin, A comprehensive survey of fitness approximation in evolutionary computation, Soft Computing, vol. 9, no. 1, pp. 3–12, 2005.
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 Transactions on Evolutionary Computation, vol. 23, no. 3, pp. 459–472, 2018.
J. Zhang and A. C. Sanderson, JADE: Adaptive differential evolution with optional external archive, IEEE Transactions on Evolutionary Computation, vol. 13, no. 5, pp. 945–958, 2009.
K. Qiao, J. Liang, B. Qu, K. Yu, C. Yue, and H. Song, Differential evolution with level-based learning mechanism, Complex System Modeling and Simulation, vol. 2, no. 1, pp. 35–58, 2022.
W. Li, X. Ye, Y. Huang, and S. Mahmoodi, Adaptive dimensional learning with a tolerance framework for the differential evolution algorithm, Complex System Modeling and Simulation, vol. 2, no. 1, pp. 59–77, 2022.
Z. Liao and S. Li, Solving nonlinear equations systems with an enhanced reinforcement learning based differential evolution, Complex System Modeling and Simulation, vol. 2, no. 1, pp. 78–95, 2022.
I. D. Falco, A. D. Cioppa, and G. A. Trunfio, Investigating surrogate-assisted cooperative coevolution for large-scale global optimization, Information Sciences, vol. 482, pp. 1–26, 2019.
R. Storn and K. Price, Differential evolution – a simple and efficient heuristic for global optimization over continuous spaces, Journal of Global Optimization, vol. 11, no. 4, pp. 341–359, 1997.
Y. Yao and H. Zhou, The dynamic equilibrium and simulation of mobile internet platform innovation ecosystem: A symbiotic evolution model, Kybernetes, vol. 45, no. 9, pp. 1406–1420, 2016.
Z. Cai and Z. Peng, Cooperative coevolutionary adaptive genetic algorithm in path planning of cooperative multi-mobile robot systems, Journal of Intelligent and Robotic Systems, vol. 33, no. 1, pp. 61–71, 2002.
F. V. D. Bergh and A. P. Engelbrecht, A cooperative approach to particle swarm optimization, IEEE Transactions on Evolutionary Computation, vol. 8, no. 3, pp. 225–239, 2004.
X. Li and X. Yao, Cooperatively coevolving particle swarms for large scale optimization, IEEE Transactions on Evolutionary Computation, vol. 16, no. 2, pp. 210–224, 2011.
Z. -J. Wang, Z. -H. Zhan, S. Kwong, H. Jin, and J. Zhang, Adaptive granularity learning distributed particle swarm optimization for large-scale optimization, IEEE Transactions on Cybernetics, vol. 51, no. 3, pp. 1175–1188, 2020.
X. Ma, X. Li, Q. Zhang, K. Tang, Z. Liang, W. Xie, and Z. Zhu, A survey on cooperative co-evolutionary algorithms, IEEE Transactions on Evolutionary Computation, vol. 23, no. 3, pp. 421–441, 2018.
Y. Mei, M. N. Omidvar, X. Li, and X. Yao, A competitive divide-and-conquer algorithm for unconstrained large-scale black-box optimization, ACM Transactions on Mathematical Software, vol. 42, no. 2, pp. 1–24, 2016.
B. Liu, Q. Zhang, and G. G. E. Gielen, A Gaussian process surrogate model assisted evolutionary algorithm for medium scale expensive optimization problems, IEEE Transactions on Evolutionary Computation, vol. 18, no. 2, pp. 180–192, 2013.
H. Wang and Y. Jin, A random forest-assisted evolutionary algorithm for data-driven constrained multiobjective combinatorial optimization of trauma systems, IEEE Transactions on Cybernetics, vol. 50, no. 2, pp. 536–549, 2018.
H. Yu, Y. Tan, C. Sun, and J. Zeng, A generation-based optimal restart strategy for surrogate-assisted social learning particle swarm optimization, Knowledge-Based Systems, vol. 163, pp. 14–25, 2019.
C. Sun, Y. Jin, R. Cheng, J. Ding, and J. Zeng, Surrogate-assisted cooperative swarm optimization of high-dimensional expensive problems, IEEE Transactions on Evolutionary Computation, vol. 21, no. 4, pp. 644–660, 2017.
This work was supported in part by the National Natural Science Foundation of China (No. 61876123), Shanxi Key Research and Development Program (No. 202102020101002), and Natural Science Foundation of Shanxi Province (Nos. 201901D111264 and 201901D111262).
The articles published in this open access journal are distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/).