How well does a single-point crossover mix building blocks with tight linkage.pdfVIP

下载本文档

2
0
约5.22万字
约 21页
2017-04-13 发布于江苏
举报
版权申诉

How well does a single-point crossover mix building blocks with tight linkage.pdf

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

How well does a single-point crossover mix building blocks with tight linkage

How Well Does A Single-Point Crossover Mix Building Blocks with Tight Linkage? Kumara Sastry David E. Goldberg IlliGAL Report No. 2002013 May, 2002 Illinois Genetic Algorithms Laboratory (IlliGAL) Department of General Engineering University of Illinois at Urbana-Champaign 117 Transportation Building 104 S. Mathews Avenue, Urbana, IL 61801 How Well Does A Single-Point Crossover Mix Building Blocks with Tight Linkage? Kumara Sastry and David E. Goldberg Illinois Genetic Algorithms Laboratory (IlliGAL) Department of General Engineering University of Illinois at Urbana-Champaign 104 S. Mathews Ave, Urbana, IL 61801 {ksastry,deg}@ Abstract Ensuring building-block (BB) mixing is critical to the success of genetic and evolutionary algorithms. This study develops facetwise models to predict the BB mixing time and the pop- ulation sizing dictated by BB mixing for single-point crossover. Empirical results are used to validate these models. The population-sizing model suggests that for moderate-to-large prob- lems, BB mixing—instead of BB decision making and BB supply—bounds the population size required to obtain a solution of constant quality. Furthermore, the population sizing for single- point crossover scales as O ( 2km1.5 ) , where k is the BB size and m is the number of BBs. 1 Introduction Since the inception of genetic algorithms (GAs), the importance of building blocks have been recognized (Holland, 1975; Goldberg, 1989b). Based on Holland’s notion of BBs, Goldberg proposed a design decomposition method for a successful design of GAs (Goldberg, 1991; Goldberg Liepens, 1991; Goldberg, Deb, Clark, 1992). This design decomposition currently consists of sevens steps (Goldberg, in press) and can be stated as follows: (1) Know what GAs process—building blocks (BBs), (2) solve problems that are of bounded BB difficulty, (3) ensure an adequate supply of raw BBs, (4) ensure increased market share for superior BBs, (5) know BB takeover and convergence times, (6) ensure that B