• 主题
高级搜索  >
历史搜索 清空历史
首页> 美国政府科技报告 >Generalization and Parallelization of Messy Genetic Algorithms and Communicationin Parallel Genetic Algorithms
【24h】

Generalization and Parallelization of Messy Genetic Algorithms and Communicationin Parallel Genetic Algorithms

机译：并行遗传算法中遗传算法和通信的泛化与并行化

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Genetic algorithms (GA) are highly parallelizable, robust semi-optimizationalgorithms of polynomial complexity. The most commonly implemented GAs are 'simple' GAs (SGAs). Reproduction, crossover, and mutation operate on solution populations. Deceptive and GA-hard problems are provably difficult for simple GAs. Messy GAs (MGA) are designed to overcome these limitations. The MGA is generalized to solve permutation type optimization problems. Its performance is compared to another MGA's, an SGA's, and a permutation SGA's. Against a fully deceptive problem the generalized MGA (GMGA) consistently performs better than the simple GA. Against an NP-complete permutation problem, the GMGA performs better than the other GAs. Against DeJong function f2, the GMGA performs better than the other MGA, but not as well as the SGA. Four parallel MGA data distribution strategies are compared and not found to significantly affect solution quality. The interleaved strategy obtains near linear speedup. The indexed, modified indexed, and block strategies obtain 'super-linear speedup,' indicating that the sequential algorithm can be improved. Population partitioning impacts implementation of selection and crossover. Experiments which compare the solution quality, execution time, and convergence characteristics of three selection algorithms and three solution sharing strategies are performed.... Parallel processing, Genetic algorithms, Optimization.

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号