| Title: | Maximum number of generations as a stopping criterion considered harmful |
|---|
| Authors: | ID Ravber, Miha (Author)
ID Liu, Shih-Hsi (Author)
ID Mernik, Marjan (Author)
ID Črepinšek, Matej (Author) |
|---|
| Files: |  1-s2.0-S1568494622005804-main.pdf (1,40 MB)
MD5: 36D980C1623DEB4064BCAD68629C4EB3
 https://www.sciencedirect.com/science/article/pii/S1568494622005804?via%3Dihub
|
|---|
| Language: | English |
|---|
| Work type: | Article |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | FERI - Faculty of Electrical Engineering and Computer Science
|
|---|
| Abstract: | Evolutionary algorithms have been shown to be very effective in solving complex optimization problems. This has driven the research community in the development of novel, even more efficient evolutionary algorithms. The newly proposed algorithms need to be evaluated and compared with existing state-of-the-art algorithms, usually by employing benchmarks. However, comparing evolutionary algorithms is a complicated task, which involves many factors that must be considered to ensure a fair and unbiased comparison. In this paper, we focus on the impact of stopping criteria in the comparison process. Their job is to stop the algorithms in such a way that each algorithm has a fair opportunity to solve the problem. Although they are not given much attention, they play a vital role in the comparison process. In the paper, we compared different stopping criteria with different settings, to show their impact on the comparison results. The results show that stopping criteria play a vital role in the comparison, as they can produce statistically significant differences in the rankings of evolutionary algorithms. The experiments have shown that in one case an algorithm consumed 50 times more evaluations in a single generation, giving it a considerable advantage when max gen was used as the stopping criterion, which puts the validity of most published work in question. |
|---|
| Keywords: | evolutionary algorithms, stopping criteria, benchmarking, algorithm termination, algorithm comparison |
|---|
| Publication status: | Published |
|---|
| Publication version: | Version of Record |
|---|
| Submitted for review: | 20.12.2021 |
|---|
| Article acceptance date: | 04.08.2022 |
|---|
| Publication date: | 11.08.2022 |
|---|
| Publisher: | Elsevier |
|---|
| Year of publishing: | 2022 |
|---|
| Number of pages: | 20 str. |
|---|
| Numbering: | Vol. 128 |
|---|
| PID: | 20.500.12556/DKUM-92303  |
|---|
| UDC: | 004.43 |
|---|
| ISSN on article: | 1568-4946 |
|---|
| COBISS.SI-ID: | 118318595 |
|---|
| DOI: | 10.1016/j.asoc.2022.109478 |
|---|
| Copyright: | ©2022TheAuthor(s). |
|---|
| Publication date in DKUM: | 28.03.2025 |
|---|
| Views: | 178 |
|---|
| Downloads: | 12 |
|---|
| Metadata: |    |
|---|
| Categories: | Misc.
|
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
