Artificial Bee Colony Algorithm for Reader Collision Problem in Radio Frequency Identification Network

The operation of RFID systems often involves a situation in which multiple readers physically located near one another may interfere with one another's operation. Such reader collision must be minimized to avoid the faulty or miss reads. This paper, therefore, aims to use a successful swarm intelligence technique called artificial bee colony (ABC) algorithm to minimize both the reader-to-reader interference and total system transaction time in RFID reader networks. As the RFID network scheduling model formulated in this work is a discrete problem, a binary version of artificial bee colony (BABC) algorithm is proposed in this study. Unlike the original ABC algorithm, the proposed BABC represents a food source as a discrete binary variable and applies discrete operators to change the foraging trajectories of the employed bees, onlookers and scouts in the probability that a coordinate will take on a zero or one value. Numerical results for four test cases with different scales, which ranging from 10 to 200 readers, have been presented to demonstrate the performance of the proposed methodology