Computer Science – Neural and Evolutionary Computing
Scientific paper
2007-02-16
Computer Science
Neural and Evolutionary Computing
submited to GECCO 2007 (jan 31)
Scientific paper
The Building Block Hypothesis suggests that Genetic Algorithms (GAs) are well-suited for hierarchical problems, where efficient solving requires proper problem decomposition and assembly of solution from sub-solution with strong non-linear interdependencies. The paper proposes a hill-climber operating over the building block (BB) space that can efficiently address hierarchical problems. The new Building Block Hill-Climber (BBHC) uses past hill-climb experience to extract BB information and adapts its neighborhood structure accordingly. The perpetual adaptation of the neighborhood structure allows the method to climb the hierarchical structure solving successively the hierarchical levels. It is expected that for fully non deceptive hierarchical BB structures the BBHC can solve hierarchical problems in linearithmic time. Empirical results confirm that the proposed method scales almost linearly with the problem size thus clearly outperforms population based recombinative methods.
Dumitrescu Dan
Iclanzan David
No associations
LandOfFree
Overcoming Hierarchical Difficulty by Hill-Climbing the Building Block Structure does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Overcoming Hierarchical Difficulty by Hill-Climbing the Building Block Structure, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Overcoming Hierarchical Difficulty by Hill-Climbing the Building Block Structure will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-348310