Morphic search strategies
Jason Kingdon, L. Dekker · 2002
This paper presents the details of a novel search strategy based on randomly remapped search spaces. The algorithm, the Multi-Morphic Hill Climber (MMHC), uses multiple base changes in the encoding of potential solutions, so as to adjust the shape and form of a search problem. We describe the algorithm's structure and present the details of the algorithm's results on the range of real-valued test functions as defined by the IEEE First International Contest on Evolutionary Optimisation.