Aiming at solving the problem of the RFID reader collision problems in the defined area,the G_NSGA-Ⅱ algorithm is proposed on the basis of the NSGA-Ⅱ algorithm.A mathematical optimization model is established with the RFID network planning problem,this paper adds a global archiving to perserve elite individuals,replaces the original tournament selection with the tournament selection method with elite preservation,and replaces the polynomial variants with Gaussian variants,to solve the RFID network planning problem.Simulation results show that the G_NSGA-Ⅱ algorithm produces a better quality solution set,and compared with the three algorithms NSGA-Ⅱ,AW_GA and MOEA/D,it has an obvious advantage in the distribution and convergence of the solution set.It is effective and feasible in solving RFID prob-lems.
万方数据
维普
