Quarterly (spring, summer, fall, winter)
176 pp. per issue
7 x 10
ISSN
1063-6560
E-ISSN
1530-9304
2014 Impact factor:
2.37

Evolutionary Computation

Fall 2016, Vol. 24, No. 3, Pages 491-519
(doi: 10.1162/EVCO_a_00184)
© 2016 Massachusetts Institute of Technology
Gray Box Optimization for Mk Landscapes (NK Landscapes and MAX-kSAT)
Article PDF (528.15 KB)
Abstract

This article investigates Gray Box Optimization for pseudo-Boolean optimization problems composed of M subfunctions, where each subfunction accepts at most k variables. We will refer to these as Mk Landscapes. In Gray Box Optimization, the optimizer is given access to the set of M subfunctions. We prove Gray Box Optimization can efficiently compute hyperplane averages to solve non-deceptive problems in time. Bounded separable problems are also solved in time. As a result, Gray Box Optimization is able to solve many commonly used problems from the evolutional computation literature in evaluations. We also introduce a more general class of Mk Landscapes that can be solved using dynamic programming and discuss properties of these functions. For certain type of problems Gray Box Optimization makes it possible to enumerate all local optima faster than brute force methods. We also provide evidence that randomly generated test problems are far less structured than those found in real-world problems.