GNBG-Generated Test Suite for Box-Constrained Numerical Global Optimization (2312.07034v1)
Abstract: This document introduces a set of 24 box-constrained numerical global optimization problem instances, systematically constructed using the Generalized Numerical Benchmark Generator (GNBG). These instances cover a broad spectrum of problem features, including varying degrees of modality, ruggedness, symmetry, conditioning, variable interaction structures, basin linearity, and deceptiveness. Purposefully designed, this test suite offers varying difficulty levels and problem characteristics, facilitating rigorous evaluation and comparative analysis of optimization algorithms. By presenting these problems, we aim to provide researchers with a structured platform to assess the strengths and weaknesses of their algorithms against challenges with known, controlled characteristics. For reproducibility, the MATLAB source code for this test suite is publicly available.
- V. Beiranvand, W. Hare, and Y. Lucet, “Best practices for comparing optimization algorithms,” Optimization and Engineering, vol. 18, pp. 815–848, 2017.
- N. Hansen, A. Auger, R. Ros, O. Mersmann, T. Tušar, and D. Brockhoff, “COCO: A platform for comparing continuous optimizers in a black-box setting,” Optimization Methods and Software, vol. 36, no. 1, pp. 114–144, 2021.
- L. Mei and Q. Wang, “Structural optimization in civil engineering: a literature review,” Buildings, vol. 11, no. 2, p. 66, 2021.
- D. Yazdani, R. Cheng, D. Yazdani, J. Branke, Y. Jin, and X. Yao, “A survey of evolutionary continuous dynamic optimization over two decades – part A,” IEEE Transactions on Evolutionary Computation, vol. 25, no. 4, pp. 609–629, 2021.
- ——, “A survey of evolutionary continuous dynamic optimization over two decades – part B,” IEEE Transactions on Evolutionary Computation, vol. 25, no. 4, pp. 630–650, 2021.
- A. O. Kusakci and M. Can, “Constrained optimization with evolutionary algorithms: a comprehensive review,” Southeast Europe journal of soft computing, vol. 1, no. 2, 2012.
- M. N. Omidvar, X. Li, and X. Yao, “A review of population-based metaheuristics for large-scale black-box global optimization—Part I,” IEEE Transactions on Evolutionary Computation, vol. 26, no. 5, pp. 802–822, 2021.
- ——, “A review of population-based metaheuristics for large-scale black-box global optimization—Part II,” IEEE Transactions on Evolutionary Computation, vol. 26, no. 5, pp. 823–843, 2021.
- X. Li, M. G. Epitropakis, K. Deb, and A. Engelbrecht, “Seeking multiple solutions: An updated survey on niching methods and their applications,” IEEE Transactions on Evolutionary Computation, vol. 21, no. 4, pp. 518–538, 2016.
- N. Saini and S. Saha, “Multi-objective optimization techniques: a survey of the state-of-the-art and applications: Multi-objective optimization techniques,” The European Physical Journal Special Topics, vol. 230, no. 10, pp. 2319–2335, 2021.
- N. Hansen, S. Finck, R. Ros, and A. Auger, “Real-parameter black-box optimization benchmarking 2009: Noiseless functions definitions,” Tech. Rep., 2009.
- D. Yazdani, “Particle swarm optimization for dynamically changing environments with particular focus on scalability and switching cost,” Ph.D. dissertation, Liverpool John Moores University, Liverpool, UK, 2018.
- D. Yazdani, M. N. Omidvar, J. Branke, T. T. Nguyen, and X. Yao, “Scaling up dynamic optimization problems: A divide-and-conquer approach,” IEEE Transactions on Evolutionary Computation, vol. 24, no. 1, pp. 1–15, 2020.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
