Metaheuristic design pattern: candidate solution repair

@inproceedings{Krawiec2014MetaheuristicDP,
  title={Metaheuristic design pattern: candidate solution repair},
  author={Krzysztof Krawiec},
  booktitle={GECCO},
  year={2014}
}
In metaheuristic algorithms applied to certain problems, it may be difficult to design search operators that guarantee producing feasible search points. In such cases, it may be more efficient to allow a search operator to yield an infeasible solution, and then turn it into a feasible one using a repair process. This paper is an attempt to provide a broad perspective on the candidate solution repair and frame it as a metaheuristic design pattern.