Next generation genetic algorithms
9 Citations•2017•
L. D. Whitley
Proceedings of the Genetic and Evolutionary Computation Conference Companion
New developments in Gray Box Optimization makes it possible to construct new forms of Genetic Algorithms that do not use random mutation or random recombination for certain classes of NP Hard problems.
Abstract
New developments in Gray Box Optimization makes it possible to construct new forms of Genetic Algorithms that do not use random mutation or random recombination. Instead, for certain classes of NP Hard problems (ranging from MAXSAT to the Traveling Salesman Problem), it is possible to exactly compute the location of improving moves (often in constant time), and to use highly efficient forms of greedy deterministic recombination. In some cases, this makes random mutation and random recombination unnecessary and obsolete.