Shin-Yeu Lin, Da Jhou Kang



Genetic Algorithm for 3D RFID Reader Network Planning



In this paper, a genetic algorithm (GA) with a spatial crossover operation and a correction scheme is proposed to solve a 3D RFID reader network planning problem. The proposed algorithm aims to improve the performance of the previously developed micro GA (mGA) in getting a better solution. We have tested the proposed GA on several 3D RFID reader network planning problems with different size. We have also compared the obtained results with the results obtained by mGA. The comparison results show that the proposed GA outperforms the mGA in the quality of the obtained solution.


RFID, reader network, genetic algorithm, crossover, correction scheme


[1] E. Bottani and A. Rizzi, “Economical assessment of the impact of RFID technology and EPC system on the fastmoving consumer goods supply chain,” International Journal of Production Economics, vol. 112, no. 2, pp. 548-569, 2008.

[2] H. Feng and J. Qi, "Radio frequency identification networks planning using new hybrid evolutionary algorithm," ICACT Transaction Advanced Communication Technology, vol. 2, no. 1, pp. 179-188, 2013.

[3] L. Ma, H. Chen, K. Hu and Y. Zhu, "Hierarchical artificial bee colony algorithm for RFID network planning optimization," The Scientific World Journal, vol. 2014, p. 21, 2014.

[4] N. Bacanin, M. Tuba and I. Strumberger, “RFID network planning by ABC algorithm hybridized with heuristic for initial number and locations of readers,” in Proceeding of the 17th UKSIM-AMSS international Conference on Modeling and Simulation, pp. 39-44, 2015.

[5] S.-Y. Lin and H.-F. Tsai, "Micro genetic algorithm with spatial crossover and correction schemes for constrained threedimensional reader network planning," Expert Systems with Applications, vol. 4, no. 1, pp. 344-353, 2016.

Cite this paper

Shin-Yeu Lin, Da Jhou Kang. (2017) Genetic Algorithm for 3D RFID Reader Network Planning. International Journal of Computers, 2, 66-68


Copyright © 2017 Author(s) retain the copyright of this article.
This article is published under the terms of the Creative Commons Attribution License 4.0