|
Abstract : |
When a function is mapped onto a bit representation, the structure of the fitness landscape can change dramatically. Techniques such as Delta Coding have tried to dynamically adapt the representation during the search process in hopes of making the problem easier for a genetic algorithm to solve. We introduce a new technique for changing between a restricted set of Gray representations during search; the method involves little overhead but can offer a significant performance improvement for a variety of search algorithms. 1, |
