2 ms·
In a lot of cases, "GA" just seems to be a fancy name for randomized search. Even when it does use elements from the evolutionary metaphor (crossover operators,
by _delirium 16y ago
In a lot of cases, "GA" just seems to be a fancy name for randomized search. Even when it does use elements from the evolutionary metaphor (crossover operators, etc.), you can often get equivalent results with a non-GA randomized-optimization method.
The interesting part here IMO is how to pose the problem as an optimization problem, and what representation they used for the candidate solutions. The details of how you optimize once you have those two things aren't as exciting, and on a lot of problems don't matter that much, so it's a bit of a shame that they always get emphasized (admittedly, the "genetic" and "evolutionary" metaphors make for nice PR, whereas a lot of randomized-optimization algorithms are really boring sounding).