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

DOI10.1016/J.COR.2012.10.019zbMATH Open1349.90872DBLPjournals/cor/VerwaerenSB13OpenAlexW1981148279WikidataQ60256388 ScholiaQ60256388MaRDI QIDQ340288FDOQ340288

Authors: Jan Verwaeren, Karolien Scheerlinck, B. 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

Recommendations

• Solution bias in ant colony optimisation: Lessons for selecting pheromone models
• Numerical Analysis and Its Applications
• scientific article; zbMATH DE number 2013451
• Ant colony pattern search algorithms for unconstrained and bound constrained optimization
• On the robustness of ant colony optimization

zbMATH Keywords

ant colony optimizationcombinatorial optimizationevolutionary computationssearch biassubset problems

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Cited In (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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340288)