Information landscapes and problem hardness
Yossi Borenstein, Riccardo Poli · 2005
In [20] we introduced a new concept of a landscape: the information landscape. We showed that for problems of very small size (e.g. a 3-bit problem), it can be used to generally and accurately predict the performance of a GA. Based on this framework, in this paper we develop a method to predict GA hardness on realistic landscapes. We give empirical results which support our approach.