Perl: the Markov chain saw  
PerlMonks 
comment on 
( [id://3333] : superdoc . print w/replies, xml )  Need Help?? 
The fitness landscape is a 3dimensional surface only if the genes of the individuals have exactly 2 degrees of freedom. Even in the ONEMAX problem above, the fitness landscape is a 21dimensional surface. Your indpendent variable is any tuple in {0,1}^20, and you've got the dependent variable, fitness. Granted, the 20 independent dimensions are not big (just 0 and 1), but it's still more than I know how to visualize effectively.
Using terms like "hills" to help visualize the problem space is helpful, but only because we usually omit the fact that the hills are almost never 3dimensional. ;) It's worse if you're evolving structures other than strings and arrays. An ncharacter string is easily analogous to a tuple in some ndimensional space. But what if we are evolving neural net structures, or state machines, or parse trees? How do we "plot" the fitnesses of these things? How do you even measure the distance between two state machines so that you can build the "grid" that the fitness will be plotted on? Strict mathematical analysis on these problems is tough. Even trying to look at the spaces involved is often next to impossible. There can't be any single plugnplay way of dumping a plot of your fitness landscape. Doing such a plot requires a large understanding of the independent variables, and probably lots of trial and error. You're probably better off analyzing the EA results using statistical analysis, as opposed to inspecting the actual fitness landscape. blokhead In reply to Re: Re: A Beginning Guide To Evolutionary Algorithms
by blokhead

Log In^{?}
Chatterbox^{?}
Other Users^{?}
Sections^{?}
Information^{?}
Find Nodes^{?}
Leftovers^{?}
Voting Booth^{?}
My favourite way to spend a leap day ...
Results (22 votes). Check out past polls. 