Modified Monarch Butterfly Optimization Algorithm for RFID Network Planning

This paper presents an implementation of the modified monarch butterfly optimization algorithm for solving the RFID network planning problem. This problem is one of the most studied challenges in the RFID domain, and was not tackled with the monarch butterfly optimization metaheuristic before. RFID system consists of tags and readers, where readers access from certain distance the information that is stored in tags. By testing basic monarch butterfly algorithm, we noticed that the algorithm can be improved by enhancing exploitation in the late iterations. We tested our approach on the standard RFID model and data set, and conducted comparative analysis with other approaches. According to the performed experiments, we concluded that the modified monarch butterfly optimization can be successfully applied to the RFID network planning problem.