https://scholars.lib.ntu.edu.tw/handle/123456789/372842
標題: | A test problem with adjustable degrees of overlap and conflict among subproblems | 作者: | TIAN-LI YU Chen W.-M Shao C.-Y Hsu P.-C |
關鍵字: | building blocks; genetic algorithms; non-separable problems; performance measures | 公開日期: | 2012 | 起(迄)頁: | 257-264 | 來源出版物: | GECCO'12 - Proceedings of the 14th International Conference on Genetic and Evolutionary Computation | 摘要: | In the field of genetic algorithms (GAs), some researches on overlapping building blocks (BBs) have been proposed. To further study on overlapping BBs, we need to measure the performance of an algorithm to solve problems with over-lap among subproblems. Several test problems have been proposed, but the controllability over the degree of overlapping is not yet fully satisfactory. Our new test problem is designed with full controllability of overlapping as well as conflict, a specific type of overlap, among BBs. We present a framework for building the structure of this problem in this paper. Some model-building GAs are tested by the proposed problem. This test problem can be applied to further researches on overlapping and conflicting BBs. © 2012 ACM. |
URI: | http://www.scopus.com/inward/record.url?eid=2-s2.0-84864702084&partnerID=MN8TOARS http://scholars.lib.ntu.edu.tw/handle/123456789/372842 |
DOI: | 10.1145/2330163.2330201 | SDG/關鍵字: | Building blockes; non-separable problems; Performance measure; Sub-problems; Test problem; Genetic algorithms; Problem solving |
顯示於: | 電機工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。