首页> 外文会议>2012 IEEE Fifth International Conference on Advanced Computational Intelligence. >Pareto-based multi-objective estimation of distribution algorithm with Gaussian copulas and application in RFID network planning
【24h】

Pareto-based multi-objective estimation of distribution algorithm with Gaussian copulas and application in RFID network planning

机译:基于Pareto的高斯分布分布算法多目标估计及其在RFID网络规划中的应用

获取原文
获取原文并翻译 | 示例

摘要

A Pareto-based multi-objective estimation of distribution algorithm with Gaussian copulas is proposed and applied to RFID network planning. The algorithm employs Pareto-based approach and multivariate Gaussian copulas to construct probability distribution model. By estimating Kendall's tau and using the relationship of Kendall's tau and correlation matrix, Gaussian copula parameters are firstly estimated, thus, joint distribution is estimated. Afterwards, the Monte Carte simulation is used to generate new individuals. An archive with maximum capacity is used to maintain the non-dominated solutions. The Pareto optimal solutions are selected from the archive on the basis of the diversity of the solutions, and the crowding-distance measure is used for the diversity measurement. The archive gets updated with the inclusion of the non-dominated solutions from the combined population and current archive, and the archive which exceeds the maximum capacity is cut using the diversity consideration. The proposed algorithm is applied to some benchmark and RFID network planning. The relative experimental results show that the algorithm has better performance and is effective.
机译:提出了一种基于Pareto的多目标分布高斯分布估计算法,并将其应用于RFID网络规划。该算法采用基于Pareto的方法和多元高斯copulas构造概率分布模型。通过估计肯德尔τ的值,并利用肯德尔τ和相关矩阵的关系,首先估计高斯系参数,从而估计联合分布。之后,使用蒙特卡特模拟产生新的个体。具有最大容量的归档文件用于维护非主导解决方案。根据解的多样性从存档中选择帕累托最优解,并使用拥挤距离度量进行多样性度量。通过合并人口和当前档案中的非支配解决方案来更新档案,并且使用多样性考虑因素来削减超出最大容量的档案。该算法被应用于一些基准测试和RFID网络规划中。相关实验结果表明,该算法具有较好的性能和有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号