| Title: | On the exploration and exploitation capabilities of the artificial bee colony algorithm |
|---|
| Authors: | ID Jerebic, Jernej (Author)
ID Ravber, Miha (Author)
ID Mernik, Luka (Author)
ID Mernik, Marjan (Author) |
|---|
| Files: |  mathematics-14-01406.pdf (4,47 MB)
MD5: 5699B99D2D5CB46F4E1AA4D5CA1E7759
|
|---|
| Language: | English |
|---|
| Work type: | Article |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | FERI - Faculty of Electrical Engineering and Computer Science
|
|---|
| Abstract: | In this paper, we investigate the exploration and exploitation capabilities of the Artificial Bee Colony (ABC) algorithm using novel attraction basin-based measures. Previous claims about the ABC’s weak exploitation and exploration capabilities have been scrutinized. These claims are not based on exploration and exploitation measurements and, as such, are questionable. Direct measurements are needed to get real insights into the exploration and exploitation capabilities of any search algorithm. The results show that indirect measurements based on diversity are not appropriate. Our newly developed attraction basin-based measurements allow us to differentiate between exploration types (successful, failed, deceptive, successful rejection) and exploitation types (successful, unsuccessful). Namely, it is not only important that an algorithm is in the exploration phase, but also that promising regions with better solutions are not abandoned and that regions with worse solutions are visited less frequently. Similarly, during the exploitation phase, it is important to discover better solutions in the neighborhood and not exploit in an unsuccessful direction. It has been shown that ABC’s exploration and exploitation capabilities are versatile, and can adapt to different fitness landscapes successfully. |
|---|
| Keywords: | exploration and exploitation, attraction basin, divertisity, metaheuristics, artificial bee colony |
|---|
| Publication status: | Published |
|---|
| Publication version: | Version of Record |
|---|
| Submitted for review: | 14.03.2026 |
|---|
| Article acceptance date: | 17.04.2026 |
|---|
| Publication date: | 22.04.2026 |
|---|
| Publisher: | MDPI |
|---|
| Year of publishing: | 2026 |
|---|
| Number of pages: | 39 str. |
|---|
| Numbering: | Vol. 14, no. 9, [article no.] 1406 |
|---|
| PID: | 20.500.12556/DKUM-97915  |
|---|
| UDC: | 004.8 |
|---|
| ISSN on article: | 2227-7390 |
|---|
| COBISS.SI-ID: | 276323075 |
|---|
| DOI: | 10.3390/math14091406 |
|---|
| Copyright: | © 2026 by the authors
|
|---|
| Publication date in DKUM: | 24.04.2026 |
|---|
| Views: | 487 |
|---|
| Downloads: | 15 |
|---|
| 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. |
