Commonly Used Static and Dynamic Single-Objective Optimization Benchmark Problems

Comparing and quantifying the efficiency of optimization algorithms is an inescapable aspect of research in the field of optimization. It is essential to use a set of benchmark problems with different characteristics in order to evaluate the performance of algorithms designed for optimization problems. This allows researchers to examine how algorithms perform in different situations and what their strengths and weaknesses are. This chapter reviews and analyzes several benchmark problems in both dynamic and static environments. In particular, 12 static benchmark functions, including four unimodal and eight multimodal ones, and several dynamic benchmark generators have been reviewed. Covering both categories can help researchers understand the differences between dynamic and static benchmark problems.