A XOR-based ABC algorithm for solving set covering problems

RICARDO JAVIER SOTO DE GIORGIS, BRODERICK CRAWFORD LABRIN, Sebastián Lizama, Franklin Johnson, Fernando Paredes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

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’s OR-Library.

Original languageEnglish
Title of host publicationThe 1st International Conference on Advanced Intelligent System and Informatics, AISI 2015
EditorsAboul Ella Hassanien, Nashwa El-Bendary, Tarek Gaber, Nilanjan Dey
PublisherSpringer Verlag
Pages209-218
Number of pages10
ISBN (Print)9783319266886
DOIs
StatePublished - 1 Jan 2016
Event1st International Conference on Advanced Intelligent System and Informatics, AISI 2015 - Beni Suef, Egypt
Duration: 28 Nov 201530 Nov 2015

Publication series

NameAdvances in Intelligent Systems and Computing
Volume407
ISSN (Print)2194-5357

Conference

Conference1st International Conference on Advanced Intelligent System and Informatics, AISI 2015
CountryEgypt
CityBeni Suef
Period28/11/1530/11/15

Keywords

  • Artificial bee colony algorithm
  • Bio-inspired systems
  • Metaheuristics
  • Set covering problem

Fingerprint Dive into the research topics of 'A XOR-based ABC algorithm for solving set covering problems'. Together they form a unique fingerprint.

Cite this