Advertisement
Published in:
2014 | OriginalPaper | Chapter
Using the Bee Colony Optimization Method to Solve the Weighted Set Covering Problem
Authors : Broderick Crawford, Ricardo Soto, Rodrigo Cuesta, Fernando Paredes
Published in: HCI International 2014 - Posters’ Extended Abstracts
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
The Weighted Set Covering Problem is a formal model for many practical optimization problems. In this problem the goal is to choose a subset of columns of minimal cost covering every row. Here, we present a novel application of the Artificial Bee Colony algorithm to solve the Weighted 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.