首页> 外文会议>International Conference on Evolutionary Computation >Are Long Path Problems Hard for Genetic Algorithms?
【24h】

Are Long Path Problems Hard for Genetic Algorithms?

机译:是遗传算法很难的长路径问题吗?

获取原文

摘要

Long path problems have been introduced into GA literature as problems that are hard for hill-climbers but empirical results suggest they can easily be solved by GAs. However, no formal analysis has been carried out which would explain this apparent success. The paper shows that the Root2path problem resembles a Royal Road function which allows the GA to exploit short cuts in the crossover landscape. To fully understand the GA behaviour the original problem as introduced by Horn et.al. has been decomposed into its components: the Root2path and the slope function. Although both functions may be classified as GA-easy, they impose different requirements on the constitution of the population. These requirements are shown to be incompatible, so that the combination of Root2path and slope function results in a problem that is hard for a GA.
机译:长路径问题被引入到GA文学中,因为山地登山者难以努力,但实证结果表明它们很容易通过气体解决。但是,没有进行正式分析,这将解释这一明显的成功。本文表明,root2Path问题类似于皇家公路功能,它允许GA在交叉景观中利用短切。为了充分了解GA行为,Rone et.al引入的原始问题。已被分解为其组件:root2Path和斜率函数。虽然这两种功能都可以被归类为GA - 容易,但它们对人口的构成施加了不同的要求。这些要求显示出不兼容,因此root2Path和斜率函数的组合导致了GA很难的问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号