This paper proposes a modified quasi-opposition-based grey wolf optimization (mQOGWO) method to solve complex constrained optimization problems. The effectiveness of mQOGWO is examined on (i) 23 mathematical benchmark functions with different dimensions and (ii) 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. The obtained results are compared with the reported results using other methods available in the literature. Considering the solution quality of all test cases, the proposed technique seems to be a promising alternative for solving complex constrained optimization problems.

/pdf/modified-quasi-opposition-based-grey-wolf-optimization-for-3o0i38fs.pdf

Modified Quasi-Opposition-Based Grey Wolf Optimization for Mathematical and Electrical Benchmark Problems

Reporting the empirical results of swarm and evolutionary computation algorithms is a challenging task with many possible difficulties. These difficulties stem from the stochastic nature of such algorithms, as well as their inability to guarantee an optimal solution in polynomial time. This research deals with measuring the performance of stochastic optimization algorithms, as well as the confidence intervals of the empirically obtained statistics. Traditionally, the arithmetic mean is used for measuring average performance, but we propose quantiles for measuring average, peak and bad-case performance, and give their interpretations in a relevant context for measuring the performance of the metaheuristics. In order to investigate the differences between arithmetic mean and quantiles, and to confirm possible benefits, we conducted experiments with 7 stochastic algorithms and 20 unconstrained continuous variable optimization problems. The experiments showed that median was a better measure of average performance than arithmetic mean, based on the observed solution quality. Out of 20 problem instances, a discrepancy between the arithmetic mean and median happened in 6 instances, out of which 5 were resolved in favor of median and 1 instance remained unresolved as a near tie. The arithmetic mean was completely inadequate for measuring average performance based on the observed number of function evaluations, while the 0.5 quantile (median) was suitable for that task. The quantiles also showed to be adequate for assessing peak performance and bad-case performance. In this paper, we also proposed a bootstrap method to calculate the confidence intervals of the probability of the empirically obtained quantiles. Considering the many advantages of using quantiles, including the ability to calculate probabilities of success in the case of multiple executions of the algorithm and the practically useful method of calculating confidence intervals, we recommend quantiles as the standard measure of peak, average and bad-case performance of stochastic optimization algorithms.

Probability and Certainty in the Performance of Evolutionary and Swarm Optimization Algorithms

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.

https://www.mdpi.com/2227-7390/10/13/2219/pdf?version=1656582896

O. Tawfik

Papers

Permutation Tests for Metaheuristic Algorithms