Permutation Tests for Metaheuristic Algorithms
TLDR
This paper defines two statistic tests and then presents an algorithm that uses them to compute the p-value and shows that the proposed P-test is generally consistent with the classical tests, but more conservative in few cases.Abstract:
Many metaheuristic approaches are inherently stochastic. In order to compare such methods, statistical tests are needed. However, choosing an appropriate test is not trivial, given that each test has some assumptions about the distribution of the underlying data that must be true before it can be used. Permutation tests (P-Tests) are statistical tests with minimal number of assumptions. These tests are simple, intuitive and nonparametric. In this paper, we argue researchers in the field of metaheuristics to adopt P-Tests to compare their algorithms. We define two statistic tests and then present an algorithm that uses them to compute the p-value. The proposed process is used to compare 5 metaheuristic algorithms on 10 benchmark functions. The resulting p-values are compared with the p-values of two widely used statistical tests. The results show that the proposed P-test is generally consistent with the classical tests, but more conservative in few cases.read more
Citations
More filters
Journal ArticleDOI
Modified Quasi-Opposition-Based Grey Wolf Optimization for Mathematical and Electrical Benchmark Problems
TL;DR: In this article , a modified quasi-opposition-based grey wolf optimization (mQOGWO) method was proposed to solve complex constrained optimization problems and the effectiveness of the method was examined on 23 mathematical benchmark functions with different dimensions and four practical complex constrained electrical problems that include economic dispatch of 15, 40 and 140 power generating units and a microgrid problem with different energy sources.
Journal ArticleDOI
Probability and Certainty in the Performance of Evolutionary and Swarm Optimization Algorithms
TL;DR: In this article , the authors propose quantiles for measuring average, peak and bad-case performance of stochastic optimization algorithms, as well as the confidence intervals of the empirically obtained statistics.
References
More filters
Proceedings ArticleDOI
Particle swarm optimization
TL;DR: A concept for the optimization of nonlinear functions using particle swarm methodology is introduced, and the evolution of several paradigms is outlined, and an implementation of one of the paradigm is discussed.
Journal ArticleDOI
A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms
TL;DR: The basics are discussed and a survey of a complete set of nonparametric procedures developed to perform both pairwise and multiple comparisons, for multi-problem analysis are given.
Journal ArticleDOI
Harris hawks optimization: Algorithm and applications
Ali Asghar Heidari,Ali Asghar Heidari,Seyedali Mirjalili,Hossam Faris,Ibrahim Aljarah,Majdi Mafarja,Huiling Chen +6 more
TL;DR: The statistical results and comparisons show that the HHO algorithm provides very promising and occasionally competitive results compared to well-established metaheuristic techniques.
Journal ArticleDOI
Slime mould algorithm: A new method for stochastic optimization
Shimin Li,Huiling Chen,Mingjing Wang,Ali Asghar Heidari,Ali Asghar Heidari,Seyedali Mirjalili +5 more
TL;DR: The proposed slime mould algorithm has several new features with a unique mathematical model that uses adaptive weights to simulate the process of producing positive and negative feedback of the propagation wave of slime mould based on bio-oscillator to form the optimal path for connecting food with excellent exploratory ability and exploitation propensity.
Journal ArticleDOI
Adjusting for multiple testing when reporting research results: the Bonferroni vs Holm methods.
Mikel Aickin,Helen L. Gensler +1 more
TL;DR: An adjustment to P values based on Holm's method is presented in order to promote the method's use in public health research.