<?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>Performance comparison of single-objective evolutionary algorithms implemented in different frameworks</dc:title><dc:creator>Ravber,	Miha	(Avtor)
	</dc:creator><dc:creator>Šmid,	Marko	(Avtor)
	</dc:creator><dc:creator>Moravec,	Matej	(Avtor)
	</dc:creator><dc:creator>Mernik,	Marjan	(Avtor)
	</dc:creator><dc:creator>Črepinšek,	Matej	(Avtor)
	</dc:creator><dc:subject>metaheuristics</dc:subject><dc:subject/><dc:subject>evolutionary algorithm</dc:subject><dc:subject>metaheuristic optimization framework</dc:subject><dc:subject>algorithm comparison</dc:subject><dc:subject>benchmarking</dc:subject><dc:description>Fair comparison with state-of-the-art evolutionary algorithms is crucial, but is obstructed by differences in problems, parameters, and stopping criteria across studies. Metaheuristic frameworks can help, but often lack clarity on algorithm versions, improvements, or deviations. Some also restrict parameter configuration. We analysed source codes and identified inconsistencies between implementations. Performance comparisons across frameworks, even with identical settings, revealed significant differences, sometimes even with the authors’ own code. This questions the validity of comparisons using such frameworks. We provide guidelines to improve open-source metaheuristics, aiming to support more credible and reliable comparative studies.</dc:description><dc:publisher>Informatica</dc:publisher><dc:date>2025</dc:date><dc:date>2025-10-02 14:15:02</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>95631</dc:identifier><dc:identifier>UDK: 004.45</dc:identifier><dc:identifier>COBISS_ID: 250119171</dc:identifier><dc:identifier>DOI: 10.15388/25-INFOR603</dc:identifier><dc:identifier>ISSN pri članku: 1822-8844</dc:identifier><dc:language>sl</dc:language></metadata>
