New Benchmark Functions for Single-Objective Optimization Based on a Zigzag Pattern

Abstract

Benchmarking plays a crucial role in both development of new optimization methods, and in conducting proper comparisons between already existing methods, particularly in the field of evolutionary computation. In this paper, we develop new benchmark functions for bound-constrained single-objective optimization that are based on a zigzag function. The proposed zigzag function has three parameters that control its behaviour and difficulty of the resulting problems. Utilizing the zigzag function, we introduce four new functions and conduct extensive computational experiments to evaluate their performance as benchmarks. The experiments comprise of using the newly proposed functions in 100 different parameter settings for the comparison of eight different optimization algorithms, which are a mix of canonical methods and best performing methods from the Congress on Evolutionary Computation competitions. Using the results from the computational comparison, we choose some of the parametrization of the newly proposed functions to devise an ambiguous benchmark set in which each of the problems introduces a statistically significant ranking among the algorithms, but the ranking for the entire set is ambiguous with no clear dominating relationship between the algorithms. We also conduct an exploratory landscape analysis of the newly proposed benchmark functions and compare the results with the benchmark functions used in the Black-Box-Optimization-Benchmarking suite. The results suggest that the new benchmark functions are well suited for algorithmic comparisons.

Chance-Constrained Optimization Formulation for Ship Conceptual Design: A Comparison of Metaheuristic Algorithms

“…The relatively poorer performance of some of the methods that were among the best-performing ones in the CEC Competitions (EA4Eig, AGSK, AGSKI, and, most notably, EBO) probably comes down to these methods being fine-tuned for the particular competition [82,83]. On the other hand, the excellent performance of LSHADE should not be as unexpected, as this method (and similar DE hybrids) was found to be among the best-performing ones on a variety of different problems [9,63,[84][85][86]. The surprising competence of the "old" DE method for various engineering problems was also found in [9,68,85] and should be a point of further investigation.…”

Evolutionary Computation Techniques for Path Planning Problems in Industrial Robotics: A State-of-the-Art Review

“…There should be more focus on the implementation of modern evolutionary algorithms, such as jSO [142], AGSK [139], LSHADE [137], and CMAES variants [136]. These methods were recently shown to have excellent performance on a range of various complex [43,[143][144][145] and applied problems [146][147][148]. In addition, the development of a common framework/platform with a range of standardized industrial robotics path planning problems for benchmarking different methods (from the various possible approaches) would be immensely valuable.…”

Hippopotamus Optimization Algorithm: A Novel Nature-Inspired Optimization Algorithm

“…Kudela and Matousek introduced eight novel challenging benchmark functions, presenting a formidable challenge for bound-constrained single-objective optimization. These functions are crafted on the foundation of a ZP characterized by their non-differentiable nature and remarkable multimodality, and introduced functions incorporate three adjustable parameters, allowing for alterations in their behavior and level of difficulty 127 . Table 5 presents the results for eight ZP (ZP-F1 to ZP-F8).…”