I. Introduction
Many metaheuristics generate search solutions through the influence of reference solutions. For example, Genetic Algorithms [1] store a population of parent (reference) solutions, and offspring (search) solutions are created from the parents by applying operators such as crossover and mutation. Another example is Particle Swarm Optimization [2] in which a set of personal best (reference) positions are used to guide the search trajectories of moving particles, and these trajectories affect the sampled (search) solutions. In general, the exploratory search solutions that will be generated by a metaheuristic are strongly influenced by a set of retained reference solutions.