A template is presented that captures a vast majority of the local search algorithms proposed in the literature, including iterative improvement, simulated annealing, threshold accepting, tabu search and genetic algorithms. The template leads to a classification of existing local search algorithms and offers the possibility to fit in new types of local search approaches.
|Number of pages||11|
|Journal||Computers & Operations Research and their application to problems of world concern: An international journal|
|Publication status||Published - 1998|
Vaessens, R. J. M., Aarts, E. H. L., & Lenstra, J. K. (1998). A local search template. Computers & Operations Research and their application to problems of world concern: An international journal, 25(11), 969-979. https://doi.org/10.1016/S0305-0548(97)00093-2