@inproceedings{2eed5b3fda9546fdaed32414bac86ae4,
title = "A XOR-based ABC algorithm for solving set covering problems",
abstract = "The set covering problem is a classical problem in the subject of combinatorial optimization that consists in finding a set of solutions that cover a range of needs at the lowest possible cost. The literature reports various techniques to solve this problem, ranging from exact algorithms to approximate methods. In this paper, we present a new XOR-based artificial bee colony algorithm for solving set covering problems. We integrate a XOR operator to binarize the solution construction in order to cope with the binary nature of set covering problems. We also incorporate pre-processing phases and dynamic ABC parameters so as to improve solving time. We report interesting and competitive experimental results on a set of 65 benchmarks from the Beasley{\textquoteright}s OR-Library.",
keywords = "Artificial bee colony algorithm, Bio-inspired systems, Metaheuristics, Set covering problem",
author = "Ricardo Soto and Broderick Crawford and Sebasti{\'a}n Lizama and Franklin Johnson and Fernando Paredes",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016.; 1st International Conference on Advanced Intelligent System and Informatics, AISI 2015 ; Conference date: 28-11-2015 Through 30-11-2015",
year = "2016",
doi = "10.1007/978-3-319-26690-9_19",
language = "English",
isbn = "9783319266886",
series = "Advances in Intelligent Systems and Computing",
publisher = "Springer Verlag",
pages = "209--218",
editor = "Hassanien, {Aboul Ella} and Nashwa El-Bendary and Tarek Gaber and Nilanjan Dey",
booktitle = "The 1st International Conference on Advanced Intelligent System and Informatics, AISI 2015",
}