基于G_NSGA-Ⅱ算法的RFID网络规划

RFID Network Planning Based on G_NSGA-Ⅱ Algorithm

针对RFID网络中阅读器冲突问题,在NSGA-Ⅱ算法的基础上提出G_NSGA-Ⅱ算法。对RFID网络规划问题进行数学建模,引入全局存档机制存储精英解,保留性能最佳个体;采用精英保留策略的锦标赛选择方法,确保选择出的个体具有较优秀的性能;同时,引入高斯变异算子,以增加种群多样性,从而避免算法陷入局部最优解。仿真结果表明,G_NSGA-Ⅱ算法所产生的解集质量较好,相较于NSGA-Ⅱ、AW_GA和MOEA/D等3种算法,其在解集的分布性和收敛性上具备明显优势,在解决RFID问题上具备有效性和可行性。

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.