R. A. Watson and J. B. Pollack. Analysis of recombinative algorithms on a hierarchical building-block problem. In Foundations of Genetic Algorithms (FOGA), 2000.  Home/Search   Document Not in Database   Summary   Related Articles

....with a building block structure where the sub problem that each block represents has strong interdependencies with other blocks. That is, unlike many existing building block problems, the optimal solution to any block in H IFF is strongly dependent on how other building blocks have been solved [16, 17]. The fitness of a string using H IFF can be defined using the recursive function given below. This function interprets a string as a binary tree and recursively decomposes the string into left and right halves. Each resultant sub string constitutes a building block and confers a fitness ....

.... strong epistatic linkage in H IFF and many local optima (see Figure 4 left) These local optima prevent any kind of mutation based hill climber from reliably reaching one of the two global optima in H IFF (all ones or all zeros) in time less than exponential in N, the number of bits in the problem [17]. Figure 4 (left) shows a particular section through the H IFF landscape. This is the section through a 64 bit landscape starting from all zeros on the left and ending with all ones. Specifically, it shows the fitness of the strings 000 : 0 , 100 : 0 , 110 : 0 , 111 : ....

R. A. Watson and J. B. Pollack. Analysis of recombinative algorithms on a hierarchical building-block problem. In Foundations of Genetic Algorithms (FOGA), 2000.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC