有约束的三维RFID读写器网络规划方法  

Constrained Network Planning Method for Three Dimensional RFID Reader

作　　者：郁诺[1] 

机构地区：[1]西安财经学院实验实训教学管理中心,西安710061

出　　处：《计算机工程》2017年第6期59-65,共7页Computer Engineering

基　　金：陕西省自然科学基础研究计划项目(2015JQ7277)

摘　　要：针对现有的读写器网络规划计算量大和优化困难的问题,基于微遗传算法,提出一种带有约束的网络规划方法,以优化无线射频识别读写器。运用空间交叉的方法解决种群数量较少导致的搜索能力退化问题,提高搜索能力。为降低迭代成本,校正方案包含了冗余读写器的消除操作,使得校正后的可行性染色体都是低成本染色体。实验结果表明,与典型遗传算法和粒子群优化算法相比,该方法的计算效率较高,在计算时间和标签覆盖率方面具有较大优势。In order to solve the problem of large amount of computation and difficulty in the optimization of the existing Reader Network Planning （RNP）, this paper proposes a new constrained method of Radio Frequency Identification （RFID） network planning based on micro Genetic Algorithm （ GA）, so as to optimize the RFID reader. The method of spatial intersection is used to solve the problem of searching ability degradation caused by a small number of population. In order to reduce the iteration cost, the correction scheme includes the elimination of redundant reader to make the feasibility of chromosome to be low-cost chromosome after correction. Experimental results show that compared with Canonical Genetic Algorithm （CGA） and Particle Swarm Optimization （PSO）methods, the proposed method has high computational efficiency, and has a great advantage in both computation time and label coverage.

关 键 词：网络规划 遗传算法 标签覆盖率 染色体 空间交叉 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]