A comprehensive survey: artificial bee colony (ABC) algorithm and applications

D Karaboga, B Gorkemli, C Ozturk… - Artificial intelligence …, 2014 - Springer
Swarm intelligence (SI) is briefly defined as the collective behaviour of decentralized and
self-organized swarms. The well known examples for these swarms are bird flocks, fish …

Computing with the collective intelligence of honey bees–a survey

A Rajasekhar, N Lynn, S Das, PN Suganthan - Swarm and Evolutionary …, 2017 - Elsevier
Over past few decades, families of algorithms based on the intelligent group behaviors of
social creatures like ants, birds, fishes, and bacteria have been extensively studied and …

Multi-strategy ensemble artificial bee colony algorithm

H Wang, Z Wu, S Rahnamayan, H Sun, Y Liu, J Pan - Information Sciences, 2014 - Elsevier
Artificial bee colony (ABC) is a recently proposed optimization technique which has shown
to be competitive to other population-based stochastic algorithms. However, ABC is good at …

Improved artificial bee colony algorithm for global optimization

W Gao, S Liu - Information Processing Letters, 2011 - Elsevier
The artificial bee colony algorithm is a relatively new optimization technique. This paper
presents an improved artificial bee colony (IABC) algorithm for global optimization. Inspired …

On the optimal placement of cameras for surveillance and the underlying set cover problem

J Kritter, M Brévilliers, J Lepagnot, L Idoumghar - Applied Soft Computing, 2019 - Elsevier
Given a delimited surveillance area, represented in either 2D or 3D, and a set of feasible
camera locations and orientations, the optimal camera placement problem (OCP) is that of …

Analyzing the effects of binarization techniques when solving the set covering problem through swarm optimization

JM Lanza-Gutierrez, B Crawford, R Soto… - Expert Systems with …, 2017 - Elsevier
Abstract The Set Covering Problem (SCP) is one of the classical Karp's 21 NP-complete
problems. Although this is a traditional optimization problem, we find many papers assuming …

NuSC: an effective local search algorithm for solving the set covering problem

C Luo, W Xing, S Cai, C Hu - IEEE transactions on cybernetics, 2022 - ieeexplore.ieee.org
The set covering problem (SCP) is a fundamental NP-hard problem in computer science and
has a broad range of important real-world applications. In practice, SCP instances …

A Binary Cat Swarm Optimization Algorithm for the Non‐Unicost Set Covering Problem

B Crawford, R Soto, N Berríos… - Mathematical …, 2015 - Wiley Online Library
The Set Covering Problem consists in finding a subset of columns in a zero‐one matrix such
that they cover all the rows of the matrix at a minimum cost. To solve the Set Covering …

A novel local search for unicost set covering problem using hyperedge configuration checking and weight diversity

Y Wang, D Ouyang, L Zhang… - Science China …, 2017 - search.proquest.com
The unicost version of well-known set covering problem (SCP) is central to a wide variety of
practical applications for which finding an optimal solution quickly is crucial. In this paper, we …

[PDF][PDF] Optimal selection of movable shelves under cargo-to-person picking mode

ZP Li, JL Zhang, HJ Zhang, GW Hua - International Journal of …, 2017 - ijsimm.com
In recent years, some e-commerce companies such as Amazon have adopted the cargo-to-
person picking mode to improve their pickup efficiency. Under this mode, a shelf can store …