Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
