Countering the negative search bias of ant colony optimization in subset selection problems

DOI10.1016/j.cor.2012.10.019zbMath1349.90872DBLPjournals/cor/VerwaerenSB13OpenAlexW1981148279WikidataQ60256388 ScholiaQ60256388MaRDI QIDQ340288

Karolien Scheerlinck, Jan Verwaeren, Bernard De Baets

Publication date: 14 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.10.019

zbMATH Keywords

combinatorial optimizationant colony optimizationevolutionary computationssearch biassubset problems

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

A new approach for maintenance scheduling of generating units in electrical power systems based on their operational hours

This page was built for publication: Countering the negative search bias of ant colony optimization in subset selection problems