Output details

Communities of Minima in Local Optima Networks of Combinatorial Spaces

<22> In this paper, within the context of the combinatorial landscapes literature, the community structure of local optima is studied for the first time. Problem instances closely resembling real-world situations revealed significantly higher community structure than those that are randomly generated. This suggests that search algorithms suited for randomly generated instances would not necessarily perform well in real word situations, which has clear implications in the use of benchmarks problems for testing algorithms. This research represents a multi-disciplinary and international collaboration with the University of Nice Sophia Antipolis and the University of Lausanne.