A Complex-Networks View of Hard Combinatorial Search Spaces
According to worst-case complexity analysis, difficult combinatorial problems are those for which no polynomial-time algorithms are known (see, for instance, ). Thus, according to this point of view, large enough instances of these problems cannot be solved in reasonable time. The mathematical analysis is primarily based on decision problems, i.e. those that require a yes/no answer [7, 15], but the theory can readily be extended to optimization problems , roughly speaking, those in which we seek a solution with an associated minimum or maximum cost, which are the ones that will be dealt with here.
KeywordsLocal Search Local Optimum Travel Salesman Problem Community Detection Fitness Landscape
Unable to display preview. Download preview PDF.
- 4.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 (2010)Google Scholar
- 9.Jones, T.: Evolutionary algorithms, fitness landscapes and search. PhD thesis. The University of New Mexico (1995)Google Scholar
- 11.Kauffman, S.A.: The Origins of Order. Oxford University Press, New York (1993)Google Scholar
- 14.Ochoa, G., Tomassini, M., Vérel, S., Darabos, C.: A study of NK landscapes’ basins and local optima networks. In: Genetic and Evolutionary Computation Conference, GECCO 2008, pp. 555–562. ACM (2008)Google Scholar