References#

Cross-layer
[1]

Efrén Mezura-Montes and Carlos A. Coello Coello. Constraint-handling in nature-inspired numerical optimization: past, present and future. Swarm and Evolutionary Computation, 1(4):173–194, 2011. doi:10.1016/j.swevo.2011.10.001.

[2]

Piya Chootinan and Anthony Chen. Constraint handling in genetic algorithms using a gradient-based repair method. Computers & Operations Research, 33(8):2263–2281, 2006. doi:10.1016/j.cor.2005.02.002.

[3]

Kalyanmoy Deb, Amrit Pratap, Sameer Agarwal, and T. Meyarivan. A fast and elitist multiobjective genetic algorithm: nsga-ii. IEEE Transactions on Evolutionary Computation, 6(2):182–197, 2002. doi:10.1109/4235.996017.

[4]

Eckart Zitzler, Marco Laumanns, and Lothar Thiele. Spea2: improving the strength pareto evolutionary algorithm. Technical Report 103, Computer Engineering and Networks Laboratory (TIK), ETH Zurich, 2001.

[5]

Nicola Beume, Boris Naujoks, and Michael Emmerich. Sms-emoa: multiobjective selection based on dominated hypervolume. European Journal of Operational Research, 181(3):1653–1669, 2007. doi:10.1016/j.ejor.2006.08.008.

[6]

Marco Laumanns, Lothar Thiele, Kalyanmoy Deb, and Eckart Zitzler. Combining convergence and diversity in evolutionary multiobjective optimization. Evolutionary Computation, 10(3):263–282, 2002. doi:10.1162/106365602760234108.

[7]

Kalyanmoy Deb and Himanshu Jain. An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part i: solving problems with box constraints. IEEE Transactions on Evolutionary Computation, 18(4):577–601, 2014. doi:10.1109/TEVC.2013.2281535.

[8]

Kalyanmoy Deb and J. Sundar. Reference point based multi-objective optimization using evolutionary algorithms. In Proceedings of GECCO 2006, 635–642. 2006. doi:10.1145/1143997.1144112.

[9]

Qingfu Zhang and Hui Li. Moea/d: a multiobjective evolutionary algorithm based on decomposition. IEEE Transactions on Evolutionary Computation, 11(6):712–731, 2007. doi:10.1109/TEVC.2007.892759.

[10]

Kalyanmoy Deb. An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering, 186(2–4):311–338, 2000. doi:10.1016/S0045-7825(99)00389-8.

[11]

Kalyanmoy Deb and Ram Bhushan Agrawal. Simulated binary crossover for continuous search space. Complex Systems, 9(2):115–148, 1995.

[12]

Ingo Rechenberg. Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Frommann-Holzboog, 1973.

[13]

Kalyanmoy Deb. Multi-Objective Optimization Using Evolutionary Algorithms. John Wiley & Sons, 2001.

[14]

Brad L. Miller and David E. Goldberg. Genetic algorithms, tournament selection, and the effects of noise. Complex Systems, 9(3):193–212, 1995.

[15]

Tobias Blickle and Lothar Thiele. A comparison of selection schemes used in evolutionary algorithms. Evolutionary Computation, 4(4):361–394, 1996. doi:10.1162/evco.1996.4.4.361.

[16]

Hans-Martin Gutmann. A radial basis function method for global optimization. Journal of Global Optimization, 19(3):201–227, 2001. doi:10.1023/A:1011255519438.

[17]

Rommel G. Regis and Christine A. Shoemaker. Constrained global optimization of expensive black box functions using radial basis functions. Journal of Global Optimization, 31(1):153–171, 2005. doi:10.1007/s10898-004-0570-0.

[18]

Carl Edward Rasmussen and Christopher K. I. Williams. Gaussian Processes for Machine Learning. MIT Press, 2006.

[19]

Jerome Sacks, William J. Welch, Toby J. Mitchell, and Henry P. Wynn. Design and analysis of computer experiments. Statistical Science, 4(4):409–423, 1989. doi:10.1214/ss/1177012413.

[20]

Feng-Feng Wei, Wei-Neng Chen, Qiang Yang, Jeremiah D. Deng, Xiao-Nan Luo, Hu Jin, and Jun Zhang. A classifier-assisted level-based learning swarm optimizer for expensive optimization. IEEE Transactions on Evolutionary Computation, 25(2):219–233, 2021. doi:10.1109/TEVC.2020.3017865.

[21]

Jinyuan Zhang, Aimin Zhou, Ke Tang, and Guixu Zhang. Preselection via classification: a case study on evolutionary multiobjective optimization. Information Sciences, 465:388–403, 2018. doi:10.1016/j.ins.2018.06.073.

[22]

Hao Hao, Xiaoqun Zhang, and Aimin Zhou. Enhancing saeas with unevaluated solutions: a case study of relation model for expensive optimization. Science China Information Sciences, 67(2):120103, 2024. doi:10.1007/s11432-023-3909-x.

[23]

Benjamin Letham, Brian Karrer, Guilherme Ottoni, and Eytan Bakshy. Constrained bayesian optimization with noisy experiments. Bayesian Analysis, 14(2):495–519, 2019. doi:10.1214/18-BA1110.

[24]

Donald R. Jones, Matthias Schonlau, and William J. Welch. Efficient global optimization of expensive black-box functions. Journal of Global Optimization, 13(4):455–492, 1998. doi:10.1023/A:1008306431147.

[25]

Niranjan Srinivas, Andreas Krause, Sham M. Kakade, and Matthias W. Seeger. Information-theoretic regret bounds for gaussian process optimization in the bandit setting. IEEE Transactions on Information Theory, 58(5):3250–3265, 2012. doi:10.1109/TIT.2011.2182033.

[26]

Michael T. M. Emmerich, Kyriakos C. Giannakoglou, and Boris Naujoks. Single- and multiobjective evolutionary optimization assisted by gaussian random field metamodels. IEEE Transactions on Evolutionary Computation, 10(4):421–439, 2006. doi:10.1109/TEVC.2005.859463.

[27]

Iris Hupkens, Andre H. Deutz, Kaifeng Yang, and Michael Emmerich. Faster exact algorithms for computing expected hypervolume improvement. In Evolutionary Multi-Criterion Optimization (EMO 2015), volume 9018 of LNCS, 65–79. 2015. doi:10.1007/978-3-319-15892-1_5.

[28]

Samuel Daulton, Maximilian Balandat, and Eytan Bakshy. Differentiable expected hypervolume improvement for parallel multi-objective bayesian optimization. Advances in Neural Information Processing Systems, 33:9851–9864, 2020.

[29]

Joshua Knowles. Parego: a hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problems. IEEE Transactions on Evolutionary Computation, 10(1):50–66, 2006. doi:10.1109/TEVC.2005.851274.

[30]

Tinkle Chugh. Scalarizing functions in bayesian multiobjective optimization. In 2020 IEEE Congress on Evolutionary Computation (CEC), 1–8. 2020. doi:10.1109/CEC48606.2020.9185706.

[31]

Matthias Schonlau. Computer Experiments and Global Optimization. PhD thesis, University of Waterloo, 1997.

[32]

Michael A. Gelbart, Jasper Snoek, and Ryan P. Adams. Bayesian optimization with unknown constraints. In Proceedings of the 30th Conference on Uncertainty in Artificial Intelligence (UAI). 2014.

[33]

Haibo Yu, Ying Tan, Chaoli Sun, and Jianchao Zeng. A comparison of quality measures for model selection in surrogate-assisted evolutionary algorithm. Soft Computing, 23(23):12417–12436, 2019. doi:10.1007/s00500-019-03783-0.

[34]

Yuki Hanawa, Tomohiro Harada, and Yukiya Miura. Impact of surrogate model accuracy on performance and model management strategy in surrogate-assisted evolutionary algorithms. Array, 27:100461, 2025. doi:10.1016/j.array.2025.100461.

[35]

Jiří Repický, Lukas Bajer, Zbyněk Pitra, and Martin Holeňa. Adaptive generation-based evolution control for gaussian process surrogate models. In Proceedings of the 17th Conference on Information Technologies – Applications and Theory (ITAT 2017), volume 1885 of CEUR Workshop Proceedings, 136–143. 2017.

[36]

Eric Brochu, Vlad M. Cora, and Nando de Freitas. A tutorial on Bayesian optimization of expensive cost functions, with application to active user modeling and hierarchical reinforcement learning. 2010. arXiv:1012.2599.

[37]

Dirk Büche, Nicol N. Schraudolph, and Petros Koumoutsakos. Accelerating evolutionary algorithms with gaussian process fitness function models. IEEE Transactions on Systems, Man, and Cybernetics—Part C, 35(2):183–194, 2005. doi:10.1109/TSMCC.2004.841917.

[38]

James Kennedy and Russell Eberhart. Particle swarm optimization. In Proceedings of the IEEE International Conference on Neural Networks (ICNN), volume 4, 1942–1948. 1995. doi:10.1109/ICNN.1995.488968.

[39]

Yuhui Shi and Russell Eberhart. A modified particle swarm optimizer. In Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC), 69–73. 1998. doi:10.1109/ICEC.1998.699146.

[40]

F. Herrera, M. Lozano, and J. L. Verdegay. Tackling real-coded genetic algorithms: operators and tools for behavioural analysis. Artificial Intelligence Review, 12:265–319, 1998. doi:10.1023/A:1006504901164.

[41]

Hans-Georg Beyer and Hans-Paul Schwefel. Evolution strategies – a comprehensive introduction. Natural Computing, 1:3–52, 2002. doi:10.1023/A:1015059928466.

[42]

David D. Lewis and William A. Gale. A sequential algorithm for training text classifiers. In SIGIR '94: Proceedings of the 17th Annual International ACM-SIGIR Conference on Research and Development in Information Retrieval, 3–12. Springer, 1994. doi:10.1007/978-1-4471-2099-5_1.

[43]

Burr Settles. Active learning literature survey. Technical Report 1648, University of Wisconsin-Madison, 2009.