Tunably Rugged Landscapes With Known Maximum and Minimum
{{output}}
We propose NM landscapes as a new class of tunably rugged benchmark problems. NM landscapes are well defined on alphabets of any arity, including both discrete and real-valued alphabets, include epistasis in a natural and transparent manner, are proven to have... ...