Quasi-elementary Landscapes and Superpositions of Elementary Landscapes
There exist local search landscapes where the evaluation function is an eigenfunction of the graph Laplacian that corresponds to the neighborhood structure of the search space. Problems that display this structure are called “Elementary Landscapes” and they have a number of special mathematical properties. The term “Quasi-elementary landscapes” is introduced to describe landscapes that are “almost” elementary; in quasi-elementary landscapes there exists some efficiently computed “correction” that captures those parts of the neighborhood structure that deviate from the normal structure found in elementary landscapes. The “shift” operator, as well as the “3-opt” operator for the Traveling Salesman Problem landscapes induce quasi-elementary landscapes. A local search neighborhood for the Maximal Clique problem is also quasi-elementary. Finally, we show that landscapes which are a superposition of elementary landscapes can be quasi-elementary in structure.
KeywordsLocal Search Travel Salesman Problem Auxiliary Function Neighborhood Structure Neighborhood Size
Unable to display preview. Download preview PDF.
- 1.Chicano, F., Whitley, D., Alba, E.: A methodology to find the elementary landscape decomposition of combinatorial optimization problems. Evolutionary Computation (2011)Google Scholar
- 3.Chicano, F., Alba, E.: Elementary landscape decomposition of the 0-1 unconstrained quadratic optimization. Journal of Heuristics xx, xx–xx (2011), doi:10.1007/s10732-011-9170-6Google Scholar
- 7.Stadler, P.F.: Toward a theory of landscapes. In: Lopéz-Peña, R., Capovilla, R., García-Pelayo, R., Waelbroeck, H., Zertruche, F. (eds.) Complex Systems and Binary Networks, pp. 77–163. Springer (1995)Google Scholar
- 9.Sutton, A., Whitley, D., Howe, A.: Computing the moments of k-bounded pseudo-boolean functions over hamming spheres of arbitrary radius in polynomial time. Theoretical Computer Science (2011), doi:10.1016/j.tcs.2011.02.006Google Scholar
- 11.Whitley, D.: Quasi-elementary landscapes. In: Multi-Interdisciplinary Scheduling: Theory and Applications, MISTA (2011)Google Scholar
- 12.Whitley, D., Chicano, F., Alba, E., Luna, F.: Elementary landscapes of frequency assignment problems. In: GECCO 2010, pp. 1409–1416. ACM Press (2010)Google Scholar
- 13.Whitley, D., Sutton, A.M.: Partial neighborhoods of elementary landscapes. In: Proceedings of the Genetic and Evolutionary Computation Conference, Montreal, Canada, pp. 381–388 (July 2009)Google Scholar
- 14.Whitley, L.D., Sutton, A.M., Howe, A.E.: Understanding elementary landscapes. In: Proceedings of the Genetic and Evolutionary Computation Conference, Atlanta, GA, pp. 585–592 (July 2008)Google Scholar