<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>On the exploration and exploitation capabilities of the artificial bee colony algorithm</dc:title><dc:creator>Jerebic,	Jernej	(Avtor)
	</dc:creator><dc:creator>Ravber,	Miha	(Avtor)
	</dc:creator><dc:creator>Mernik,	Luka	(Avtor)
	</dc:creator><dc:creator>Mernik,	Marjan	(Avtor)
	</dc:creator><dc:subject>exploration and exploitation</dc:subject><dc:subject>attraction basin</dc:subject><dc:subject>divertisity</dc:subject><dc:subject>metaheuristics</dc:subject><dc:subject>artificial bee colony</dc:subject><dc:description>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.</dc:description><dc:publisher>MDPI</dc:publisher><dc:date>2026</dc:date><dc:date>2026-04-24 13:38:58</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>97915</dc:identifier><dc:identifier>UDK: 004.8</dc:identifier><dc:identifier>COBISS_ID: 276323075</dc:identifier><dc:identifier>DOI: 10.3390/math14091406</dc:identifier><dc:identifier>ISSN pri članku: 2227-7390</dc:identifier><dc:language>sl</dc:language><dc:rights>© 2026 by the authors
</dc:rights></metadata>
