Application of the Artificial Bee Colony Algorithm for Solving the Set Covering Problem

Abstract EN

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 ofthe columns of minimal cost that covers every row.

Here, we present a novelapplication of the artificial bee colony algorithm to solve the non-unicost setcovering problem.

The artificial bee colony algorithm is a recent swarmmetaheuristic technique based on the intelligent foraging behavior of honeybees.

Experimental results show that our artificial bee colony algorithmis competitive in terms of solution quality with other recent metaheuristicapproaches for the set covering problem.