Conquering hierarchical difficulty by explicit chunking: Substructural chromosome compression (2006)
Cached
Download Links
- [www.cs.bham.ac.uk]
- [www.illigal.uiuc.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the 2006 Genetic and Evolutionary Computation Conference (GECCO 2006) Workshops: International Workshop on Learning Classifier Systems |
| Citations: | 7 - 3 self |
BibTeX
@INPROCEEDINGS{Yu06conqueringhierarchical,
author = {Tian-li Yu and David E. Goldberg},
title = {Conquering hierarchical difficulty by explicit chunking: Substructural chromosome compression},
booktitle = {In Proceedings of the 2006 Genetic and Evolutionary Computation Conference (GECCO 2006) Workshops: International Workshop on Learning Classifier Systems},
year = {2006},
pages = {1385--1392},
publisher = {ACM Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper proposes a chromosome compression scheme which represents subsolutions by the most expressive schemata. The proposed chromosome compression scheme is combined with the dependency structure matrix genetic algorithm and the restricted tournament replacement to create a scalable optimization tool which optimizes problems via hierarchical decomposition. One important feature of the proposed method is that at the end of the run, the problem structure obtained from the proposed method is comprehensible to human researchers and is reusable for larger-scale problems. The empirical result shows that the proposed method scales sub-quadratically with the problem size on hierarchical problems and is able to capture the problem structures accurately.
