A XOR-based ABC algorithm for solving set covering problems
MetadataShow full item record
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. © Springer International Publishing Switzerland 2016.
Showing items related by title, author, creator and subject.
Solving pre-processed set covering problems via cuckoo search and lévy flights [Resolviendo Problemas Pre-Procesados de Cobertura de Conjuntos vía Cuckoo Search y Lévy Flight] (2020) Soto R.; Crawford B.; Barraza J.; Johnson F.; Paredes F. (Institute of Electrical and Electronics Engineers Inc., 2015)
The impact of a new formulation when solving the set covering problem using the ACO metaheuristic (2020) Crawford B.; Soto R.; Palma W.; Paredes F.; Johnson F.; Norero E. (Springer Verlag, 2015)
Modified binary firefly algorithms with different transfer functions for solving set covering problems (2020) Crawford B.; Soto R.; Riquelme-Leiva M.; Peña C.; Torres-Rojas C.; Johnson F.; Paredes F. (Springer Verlag, 2015)