Opposition-based learning estimation of distribution algorithm with Gaussian copulas and its application to placement of RFID readers

  • Authors:
  • Ying Gao;Xiao Hu;Huiliang Liu;Fufang Li;Lingxi Peng

  • Affiliations:
  • Department of Computer Science and Technology, Guangzhou University, Guangzhou, P.R. of China;Department of Computer Science and Technology, Guangzhou University, Guangzhou, P.R. of China;Department of Computer Science and Technology, Guangzhou University, Guangzhou, P.R. of China;Department of Computer Science and Technology, Guangzhou University, Guangzhou, P.R. of China;Department of Computer Science and Technology, Guangzhou University, Guangzhou, P.R. of China

  • Venue:
  • AICI'11 Proceedings of the Third international conference on Artificial intelligence and computational intelligence - Volume Part I
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Estimation of distribution algorithms are a class of optimization algorithms based on probability distribution model. In this paper, we propose an improved estimation of distribution algorithm using opposition-based learning and Gaussian copulas. The improved algorithm employs multivariate Gaussian copulas to construct probability distribution model and uses opposition-based learning for population initialization and new population generation. 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. Then, the opposite numbers have also been utilized to improve the convergence performances. The improved algorithm is applied to some benchmark functions and optimal placement of readers in RFID networks. The relative experimental results show that the improved algorithm has better performance than original version of estimation of distribution algorithm and is effective in the optimal placement of readers in RFID networks.