Skip to main content

Research Repository

See what's under the surface

Advanced Search

Generating easy and hard problems using the proximate optimality principle.

McCall, John A.W.; Christie, Lee A.; Brownlee, Alexander E.I.


John A.W. McCall

Alexander E.I. Brownlee


Sara Silva


We present an approach to generating problems of variable difficulty based on the well-known Proximate Optimality Principle (POP), often paraphrased as similar solutions have similar fitness. We explore definitions of this concept in terms of metrics in objective space and in representation space and define POP in terms of coherence of these metrics. We hypothesise that algorithms will perform well when the neighbourhoods they explore in representation space are coherent with the natural metric induced by fitness on objective space. We develop an explicit method of problem generation which creates bit string problems where the natural fitness metric is coherent or anti-coherent with Hamming neighbourhoods. We conduct experiments to show that coherent problems are easy whereas anti-coherent problems are hard for local hill climbers using the Hamming neighbourhoods.

Start Date Jul 11, 2015
Publication Date Jul 11, 2015
Publisher Association for Computing Machinery
Pages 767-768
Institution Citation MCCALL, J.A.W., CHRISTIE, L.A. and BROWNLEE, A.E.I. 2015. Generating easy and hard problems using the proximate optimality principle. In Silva, S. (ed.) Proceedings of the companion publication of the 2015 annual conference on genetic and evolutionary computation (GECCO Companion '15), 11-15 July 2015, Madrid, Spain. New York: ACM [online], pages 767-768. Available from:
Keywords Problem generation; Proximate optimality; Estimation of distribution algorithms; Landscapes
Related Public URLs


You might also like

Downloadable Citations