4.8 Article

A critical problem in benchmarking and analysis of evolutionary computation methods

Related references

Note: Only part of the references are listed.
Article Computer Science, Artificial Intelligence

Komodo Mlipir Algorithm

Suyanto Suyanto et al.

Summary: The KMA algorithm is inspired by Komodo dragons and the Javanese gait, splitting candidate solutions into three groups for balancing exploitation and exploration, outperforming recent metaheuristic algorithms in benchmark function tests.

APPLIED SOFT COMPUTING (2022)

Article Computer Science, Artificial Intelligence

Metaphor-based metaheuristics, a call for action: the elephant in the room

Claus Aranha et al.

SWARM INTELLIGENCE (2022)

Article Computer Science, Information Systems

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

Jakub Kudela et al.

Summary: Benchmarking plays a crucial role in the development and comparison of optimization methods in the field of evolutionary computation. This paper proposes new benchmark functions based on a zigzag function for single-objective optimization with constraints. Extensive computational experiments are conducted to evaluate the performance of the proposed benchmarks, and a benchmark set with statistically significant ranking among algorithms is devised.

IEEE ACCESS (2022)

Review Computer Science, Artificial Intelligence

Salp Swarm Optimization: A critical review

Mauro Castelli et al.

Summary: The Salp Swarm Optimization (SSO) algorithm gained momentum in the bio-inspired population-based metaheuristics field, but was criticized for conceptual and mathematical flaws. A corrected version, named Amended Salp Swarm Optimizer (ASSO), outperformed the original SSO in tailored experiments. Experimental results suggest that SSO and its variants do not offer significant advantages over other metaheuristics.

EXPERT SYSTEMS WITH APPLICATIONS (2022)

Article Automation & Control Systems

Commentary on: STOA: A bio-inspired based optimization algorithm for industrial engineering problems'' [EAAI, 82 (2019), 148-174] and Tunicate Swarm Algorithm: A new bio-inspired based metaheuristic paradigm for global optimization'' [EAAI, 90 (2020), no. 103541]

Jakub Kudela

Summary: This commentary discusses the issues with two recently developed metaheuristic algorithms, the Sooty Tern Optimization Algorithm and the Tunicate Swarm Algorithm. Both algorithms claim computational superiority over other methods based on experimental results, but this claim is invalid. The algorithms use a zero-bias operator, and many benchmark functions where they excel have optimal solutions located in the zero vector. Furthermore, the provided codes for these methods do not achieve the reported results.

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE (2022)

Article Computer Science, Artificial Intelligence

Nature inspired optimization algorithms or simply variations of metaheuristics?

Alexandros Tzanetos et al.

Summary: In the last decade, there has been a rise in nature-inspired optimization algorithms, but some of them lack true inspiration from nature or practical application, leading to potential drawbacks. This study highlights findings from existing nature-inspired algorithms and suggests guidelines for developing new algorithms.

ARTIFICIAL INTELLIGENCE REVIEW (2021)

Article Computer Science, Artificial Intelligence

Enhanced Marine Predators Algorithm with Local Escaping Operator for Global Optimization

Mariusz Oszust

Summary: The paper presents an improved MPA variant using a Local Escaping Operator (LEO) to address the premature convergence issue. Experimental results demonstrate the superiority of LEO-MPA over MPA and recent algorithms, showing the effectiveness of hybridizing meta-heuristics with LEO for optimization problems.

KNOWLEDGE-BASED SYSTEMS (2021)

Article Computer Science, Artificial Intelligence

A Tutorial On the design, experimentation and application of metaheuristic algorithms to real-World optimization problems

Eneko Osaba et al.

Summary: This paper aims to provide a set of good practice recommendations for conducting studies on metaheuristics methods used for optimization, in order to ensure scientific rigor, value, and transparency. The authors introduce a step-by-step methodology covering every research phase, discussing often overlooked yet crucial aspects and useful recommendations.

SWARM AND EVOLUTIONARY COMPUTATION (2021)

Proceedings Paper Computer Science, Artificial Intelligence

More is not Always Better: Insights from a Massive Comparison of Meta-heuristic Algorithms over Real-Parameter Optimization Problems

Javier Del Ser et al.

Summary: This work presents an attempt to provide empirical evidence over the debate surrounding the design and performance of modern bio-inspired optimization methods. Results of a benchmark with unprecedented scales are reported, leading to conclusions about the potential biases and illusory conclusions that can arise in comparisons between different algorithms.

2021 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (IEEE SSCI 2021) (2021)

Proceedings Paper Computer Science, Artificial Intelligence

Novel Zigzag-based Benchmark Functions for Bound Constrained Single Objective Optimization

Jakub Kudela

Summary: This paper introduces novel zigzag-based benchmark functions for bound constrained single objective optimization, which are non-differentiable, highly multimodal, and have a built-in parameter for controlling complexity. Computational study results show that these new benchmark functions are highly suitable for algorithmic comparison.

2021 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC 2021) (2021)

Article Computer Science, Information Systems

Social Network Search for Global Optimization

Siamak Talatahari et al.

Summary: A novel metaheuristic algorithm called Social Network Search (SNS) is proposed in this paper, which simulates the moods of users in social networks to solve optimization problems. Experimental results show that the SNS method outperforms other algorithms in most cases.

IEEE ACCESS (2021)

Article Computer Science, Information Systems

On Selection of a Benchmark by Determining the Algorithms' Qualities

Iztok Fister et al.

Summary: This article discusses how to fairly evaluate the quality of nature-inspired algorithms by selecting test benchmarks and the correlation between algorithm rankings and different benchmarks. The study shows that the selected benchmark can affect the ranking of a particular algorithm, leading to deviations in the order of best-performing algorithms on different benchmarks.

IEEE ACCESS (2021)

Article Computer Science, Software Engineering

MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library

Ambros Gleixner et al.

Summary: The sixth version of the MIPLIB, known as MIPLIB 2017, was compiled from an initial pool of 5721 instances, resulting in a collection of 1065 instances with a subset of 240 instances selected for solver performance benchmarking. This selection process utilized a data-driven approach supported by solving a series of mixed integer optimization problems to ensure diversity and balancedness in instance features and performance data.

MATHEMATICAL PROGRAMMING COMPUTATION (2021)

Article Computer Science, Theory & Methods

Slime mould algorithm: A new method for stochastic optimization

Shimin Li et al.

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE (2020)

Article Computer Science, Information Systems

Gradient-based optimizer: A new metaheuristic optimization algorithm

Iman Ahmadianfar et al.

INFORMATION SCIENCES (2020)

Article Computer Science, Artificial Intelligence

Butterfly optimization algorithm: a novel approach for global optimization

Sankalap Arora et al.

SOFT COMPUTING (2019)

Review Computer Science, Artificial Intelligence

Benchmarking evolutionary algorithms for single objective real-valued constrained optimization - A critical review

Michael Hellwig et al.

SWARM AND EVOLUTIONARY COMPUTATION (2019)

Article Computer Science, Artificial Intelligence

The defect of the Grey Wolf optimization algorithm and its verification method

Peifeng Niu et al.

KNOWLEDGE-BASED SYSTEMS (2019)

Article Computer Science, Artificial Intelligence

The intelligent water drops algorithm: why it cannot be considered a novel algorithm A brief discussion on the use of metaphors in optimization

Christian Leonardo Camacho-Villalon et al.

SWARM INTELLIGENCE (2019)

Article Automation & Control Systems

STOA: A bio-inspired based optimization algorithm for industrial engineering problems

Gaurav Dhiman et al.

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE (2019)

Article Computer Science, Theory & Methods

Harris hawks optimization: Algorithm and applications

Ali Asghar Heidari et al.

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE (2019)

Proceedings Paper Computer Science, Artificial Intelligence

Hybrid Sampling Evolution Strategy for Solving Single Objective Bound Constrained Problems

Geng Zhang et al.

2018 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC) (2018)

Article Computer Science, Artificial Intelligence

Since CEC 2005 competition on real-parameter optimisation: a decade of research, progress and comparative analysis's weakness

Carlos Garcia-Martinez et al.

SOFT COMPUTING (2017)

Article Computer Science, Artificial Intelligence

On the influence of the number of algorithms, problems, and independent runs in the comparison of evolutionary algorithms

Niki Vecek et al.

APPLIED SOFT COMPUTING (2017)

Article Computer Science, Information Systems

Regarding the rankings of optimization heuristics based on artificially-constructed benchmark functions

Adam P. Piotrowski

INFORMATION SCIENCES (2015)

Article Computer Science, Information Systems

How novel is the novel black hole optimization approach?

Adam P. Piotrowski et al.

INFORMATION SCIENCES (2014)

Article Computer Science, Artificial Intelligence

A Rigorous Analysis of the Harmony Search Algorithm: How the Research Community can be Misled by a Novel Methodology

Dennis Weyland

INTERNATIONAL JOURNAL OF APPLIED METAHEURISTIC COMPUTING (2010)