检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:吴立辉 李元生 胡文博 代争争 孟亚 张中伟 Wu Lihui;Li Yuansheng;Hu Wenbo;Dai Zhengzheng;Meng Ya;Zhang Zhongwei(School of Mechanical Engineering,Shanghai Institute of Technology,Shanghai 201418,China;School of Electromechanical Enginee-ring,Henan University of Technology,Zhengzhou 450001,China)
机构地区:[1]上海应用技术大学机械工程学院,上海201418 [2]河南工业大学机电工程学院,郑州450001
出 处:《计算机应用研究》2022年第2期398-401,共4页Application Research of Computers
基 金:国家自然科学基金项目(U1704156);河南省科技攻关计划项目(212102210357)。
摘 要:针对具有多种覆盖需求的柔性制造车间RFID网络规划问题,以部署成本、阅读器干扰与阅读器效能为多优化目标,提出一种分层聚类、冗余消减与梯度下降方法集成的RFID网络规划方法,采用分层聚类算法确定RFID初始数量与部署位置,采用冗余阅读器消减算法优化RFID数量,采用梯度下降算法优化RFID部署位置从而实现网络规划多目标优化。实验研究表明,提出的方法在多目标综合性能方面优于传统基于分层聚类方法、遗传算法、粒子群与冗余消减混合方法的RFID网络规划方法,验证了该方法的有效性。To solve the RFID network planning problem of flexible manufacturing workshops with multiple coverage requirements,this paper proposed an RFID network planning approach integrating hierarchical clustering,redundancy reduction,and gradient descent,where the deployment cost,reader interference,and reader efficiency were taken as multi-optimization objectives.Firstly,it designed a hierarchical clustering algorithm to determine the initial number and deployment location of RFID.Then,it constructed a redundancy reader reduction algorithm to optimize the number of RFID.Finally,it built a gradient descent algorithm to adjust the RFID deployment location,so as to achieve multi-objective optimization of the RFID network planning.Experimental results show that the proposed approach has better multi-objective comprehensive performance than the traditional RFID network planning methods,including the hierarchical clustering method,genetic algorithm,particle swarm optimization,and redundancy subtraction method.It means the proposed approach is effective.
分 类 号:TP301[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.148.223.53