Adjusted Bare Bones Fireworks Algorithm to Guard Orthogonal Polygons

With the growing demand for public security and intelligent life as well as the expansion of the Internet of Things (IoT), it is indispensable to make a plan how to place the minimum number of cameras or guards to achieve secure surveillance. The optimal cameras placement is a hard combinatorial problem, and it can be formulated as seeking the smallest number of guards to cover every point in a complex setting. In this article, we propose an adjusted version of the bare bone fireworks algorithm and one deterministic technique for tackling cameras placement problem. Both versions of novel algorithms have been implemented and tested over two hundreds of randomly generated orthogonal polygons. According to the outcomes presented in the experimental analysis, it can be noticed that the first approach based on metaheuristics beats the deterministic method for practically all instances.