Pregled bibliografske jedinice broj: 1232284
Probability and Certainty in the Performance of Evolutionary and Swarm Optimization Algorithms
Probability and Certainty in the Performance of Evolutionary and Swarm Optimization Algorithms // Mathematics, 10 (2022), 22; 4364, 25 doi:10.3390/math10224364 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 1232284 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Probability and Certainty in the Performance of
Evolutionary and Swarm Optimization Algorithms
Autori
Ivković, Nikola ; Kudelić, Robert ; Črepinšek, Matej
Izvornik
Mathematics (2227-7390) 10
(2022), 22;
4364, 25
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
algorithmic performance ; experimental evaluation ; metaheuristics ; quantile ; confidence interval ; stochastic algorithms ; evolutionary computation ; swarm intelligence ; experimental methodology
Sažetak
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.
Izvorni jezik
Engleski
Znanstvena područja
Računarstvo, Informacijske i komunikacijske znanosti
POVEZANOST RADA
Ustanove:
Fakultet organizacije i informatike, Varaždin
Citiraj ovu publikaciju:
Časopis indeksira:
- Current Contents Connect (CCC)
- Web of Science Core Collection (WoSCC)
- Science Citation Index Expanded (SCI-EXP)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus
Uključenost u ostale bibliografske baze podataka::
- EBSCO
- ProQuest