A Note on Building-block Identification by Simultaneity Matrix.pdfVIP

下载本文档

4
0
约2.17万字
约 10页
2017-04-13 发布于江苏
举报
版权申诉

A Note on Building-block Identification by Simultaneity Matrix.pdf

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

A Note on Building-block Identification by Simultaneity Matrix

A Note on Building-block Identification by Simultaneity Matrix Chatchawit Aporntewan and Prabhas Chongstitvatana Chulalongkorn University, Bangkok 10330, Thailand Chatchawit.A@student.chula.ac.th Prabhas.C@chula.ac.th Abstract. This paper presents a line of research in genetic algorithms (GAs), called building-block identification. The building blocks (BBs) are common structures inferred from a set of solutions. In simple GA, crossover operator plays an important role in mixing BBs. However, the crossover probably disrupts the BBs because the cut point is chosen at random. Therefore the BBs need to be identified explicitly so that the solutions are efficiently mixed. We propose an approach for identifying BBs. The approach is based on an observation of the compact GA. We observe that the vector elements that correspond to the bits in the same BB are simultaneously updated with a high probability. We formulate the observation to the simultaneity matrix – an `×` matrix of numbers constructed from a set of `-bit solutions. The matrix element in row i and column j is denoted by mij . The larger the mij is, the higher the dependency is between bit i and bit j. If mij is high, bit i and bit j should be passed together to prevent BB disruption. 1 Introduction This paper presents a line of research in genetic algorithms (GAs), called building- block identification. The GAs is a probabilistic search and optimization algo- rithm [7, 4]. The GAs begin with a random population – a set of solutions. A solution (or an individual) is represented by a fixed-length binary string. A solution is assigned a fitness value that indicates the quality of solution. The high-quality solutions are more likely to be selected to perform solution recom- bination. The crossover operator takes two solutions. Each solution splits in two pieces. Then, the four pieces of solutions are exchanged to reproduce two so- lutions. The population size is made constant by discarding some low-quality solutions