Examining the properties of local optima is a common method for understanding combinatorial-problem landscapes. Unfortunately, exhaustive algorithms for finding local optima are limited to very small problem sizes. We propose a method for exploiting problem structure to skip hyperplanes that cannot contain local optima, allowing runtime to scale with the number of local optima instead of with the landscape size. We prove optimality for linear functions and Concatenated Traps, and we provide empirical evidence of optimality on NKq Landscapes and Ising Spin Glasses. We further refine this method to find solutions that cannot be improved by flipping r or fewer bits, which counterintuitively can reduce total runtime. While previous methods were limited to landscapes with at most 234 binary strings, hyperplane elimination can enumerate the same problems with 277 binary strings, and find all 4-bit local optima of problems with 2200 binary strings.
CITATION STYLE
Goldman, B. W., & Punch, W. F. (2016). Hyperplane elimination for quickly enumerating local optima. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9595, pp. 154–169). Springer Verlag. https://doi.org/10.1007/978-3-319-30698-8_11
Mendeley helps you to discover research relevant for your work.