人工蜂群算法在解决集合覆盖问题中的应用。
Application of the artificial bee colony algorithm for solving the set covering problem.
作者信息
Crawford Broderick, Soto Ricardo, Cuesta Rodrigo, Paredes Fernando
机构信息
Pontificia Universidad Católica de Valparaíso, 2362807 Valparaíso, Chile ; Universidad Finis Terrae, 7500000 Santiago, Chile.
Pontificia Universidad Católica de Valparaíso, 2362807 Valparaíso, Chile ; Universidad Autónoma de Chile, 7500000 Santiago, Chile.
出版信息
ScientificWorldJournal. 2014;2014:189164. doi: 10.1155/2014/189164. Epub 2014 Apr 16.
The set covering problem is a formal model for many practical optimization problems. In the set covering problem the goal is to choose a subset of the columns of minimal cost that covers every row. Here, we present a novel application of the artificial bee colony algorithm to solve the non-unicost set covering problem. The artificial bee colony algorithm is a recent swarm metaheuristic technique based on the intelligent foraging behavior of honey bees. Experimental results show that our artificial bee colony algorithm is competitive in terms of solution quality with other recent metaheuristic approaches for the set covering problem.
集合覆盖问题是许多实际优化问题的一种形式化模型。在集合覆盖问题中，目标是选择成本最小的列子集，使其覆盖每一行。在此，我们提出一种人工蜂群算法的新颖应用，以解决非统一成本集合覆盖问题。人工蜂群算法是一种基于蜜蜂智能觅食行为的新型群体智能优化技术。实验结果表明，我们的人工蜂群算法在求解质量方面与其他近期用于集合覆盖问题的群体智能优化方法相比具有竞争力。
Zotero 插件