Clustering of Local Optima in Combinatorial Fitness Landscapes
Using the recently proposed model of combinatorial landscapes: local optima networks, we study the distribution of local optima in two classes of instances of the quadratic assignment problem. Our results indicate that the two problem instance classes give rise to very different configuration spaces. For the so-called real-like class, the optima networks possess a clear modular structure, while the networks belonging to the class of random uniform instances are less well partitionable into clusters. We briefly discuss the consequences of the findings for heuristically searching the corresponding problem spaces.
Unable to display preview. Download preview PDF.
- 2.Vérel, S., Ochoa, G., Tomassini, M.: Local optima networks of NK landscapes with neutrality. IEEE Trans. on Evol. Comp. (2010) (to appear)Google Scholar
- 5.Daolio, F., Vérel, S., Ochoa, G., Tomassini, M.: Local optima networks of the quadratic assignment problem. In: IEEE Congress on Evolutionary Computation, CEC 2010, pp. 3145–3152. IEEE Press, Los Alamitos (2010)Google Scholar