首页> 中文期刊> 《武汉大学学报:自然科学英文版》 >Asynchronous Parallel Evolutionary Algorithms for Constrained Optimizations

Asynchronous Parallel Evolutionary Algorithms for Constrained Optimizations

         

摘要

Recently Guo Tao proposed a stochastic search algorithm in his PhD thesis for solving function op- timization problems. He combined the subspace search method (a general multi-parent recombination strategy) with the population hill-climbing method. The former keeps a global search for overall situation, and the latter keeps the convergence of the algorithm. Guo’s algorithm has many advantages,such as the sim- plicity of its structure, the higher accuracy of its results, the wide range of its applications,and the robustness or its use. Io this paper a preliminary theoretical analysis or the algorithm is given and some numerical experiments has been done by using Guo’s algorithm for demonstrating the theoretical results. Three asynchronous paral- lel evolutionary algorithms with different granularities for MIMD machines are designed by parallelizing Guo’s Algorithm.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号