Bare Bones Fireworks Algorithm for the RFID Network Planning Problem
In this paper we present bare bones fireworks algorithm implemented and adjusted for solving radio frequency identification (RFID) network planning problem. Bare bones fireworks algorithm is new and simplified version of the fireworks metaheuristic. This approach for the RFID network planning problem was not implemented before according to the literature survey. RFID network planning problem is a well known hard optimization problem and it poses one of the most fundamental challenges in the process of deployment of the RFID network. We tested bare bones fireworks algorithm on one problem model found in the literature and performed comparative analysis with approaches tested on the same problem formulation. We also performed additional set of experiments where the number of readers is considered as the algorithm's parameter. Results obtained from empirical tests prove the robustness and efficiency of the bare bones fireworks metaheuristic for tackling the RFID network planning problem and categorize this new version of the fireworks algorithm as state-of-the-art method for dealing with NP-hard tasks.