On the influence of the representation granularity in heuristic forma recombination
Carlos Cotta, José M. Troya · 2000
This work studies a mechanism for reducing the computational cost of heuristic recombination operators.The mechanism is based on adjusting the size of the macro-formae processed during recombination.Using the Dynastically Optimal Forma recombination framework as a test model, it is shown that the computational cost can be dramatically reduced.Moreover, intermediate granularities seem to provide the best tradeoff between the computational cost and the quality of the results.