<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://dk.um.si/IzpisGradiva.php?id=95839"><dc:title>Improving mutation strategies in differential evolution with a new pbest selection mechanism</dc:title><dc:creator>Popič,	Jan	(Avtor)
	</dc:creator><dc:creator>Bošković,	Borko	(Avtor)
	</dc:creator><dc:creator>Brest,	Janez	(Avtor)
	</dc:creator><dc:subject>population-based algorithm</dc:subject><dc:subject>differential evolution</dc:subject><dc:subject>gobal optimization</dc:subject><dc:subject>mutation strategies</dc:subject><dc:subject>exploration–exploitation</dc:subject><dc:description>Differential evolution, which belongs to a group of population-based algorithms, has received a lot of research attention since its introduction in 1995. A population-based algorithm is required to guide individuals to visit potentially better basins of attraction in the search space when searching for a globally optimal solution. Additionally, individuals need to interact with each other during an evolutionary process to explore the search space effectively. In this paper, we propose a novel pbest selection mechanism for DE/current-to-pbest mutation strategy and its variants designed to enhance the potential for exploration of different attraction basins. The proposed mechanism enforces a minimal distance between the selected pbest individual and all other better individuals. This means that possible candidates for the pbest individual, used in mutation, are further spaced apart. As a result, the likelihood that the new trial vector will be generated in a different attraction basin of the search space is increased. The mechanism is incorporated into the L-SHADE, jSO, and L-SRTDE algorithms, and its effectiveness is evaluated using CEC’24 benchmark functions. Experimental results demonstrate improvements in the performance of the selected algorithms, particularly in higher-dimensional problem instances.</dc:description><dc:publisher>Elsevier B.V.</dc:publisher><dc:date>2025</dc:date><dc:date>2025-10-29 15:42:11</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>95839</dc:identifier><dc:language>sl</dc:language><dc:rights>© 2025 The Authors</dc:rights></rdf:Description></rdf:RDF>
