A local search template

R.J.M. Vaessens; E.H.L. Aarts; J.K. Lenstra

doi:10.1016/S0305-0548(97)00093-2

A local search template

R.J.M. Vaessens, E.H.L. Aarts, J.K. Lenstra

Research output: Contribution to journal › Article › Scientific › peer-review

43 Citations (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	969-979
Number of pages	11
Journal	Computers & Operations Research
Volume	25
Issue number	11
DOIs	https://doi.org/10.1016/S0305-0548(97)00093-2
Publication status	Published - 1998
Externally published	Yes

Access to Document

10.1016/S0305-0548(97)00093-2

Cite this

@article{11b3b58e29cd469385d1cd680011c73b,

title = "A local search template",

abstract = "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.",

author = "R.J.M. Vaessens and E.H.L. Aarts and J.K. Lenstra",

year = "1998",

doi = "10.1016/S0305-0548(97)00093-2",

language = "English",

volume = "25",

pages = "969--979",

journal = "Computers & Operations Research",

issn = "0305-0548",

publisher = "Elsevier Limited",

number = "11",

}

TY - JOUR

T1 - A local search template

AU - Vaessens, R.J.M.

AU - Aarts, E.H.L.

AU - Lenstra, J.K.

PY - 1998

Y1 - 1998

N2 - 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.

AB - 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.

U2 - 10.1016/S0305-0548(97)00093-2

DO - 10.1016/S0305-0548(97)00093-2

M3 - Article

SN - 0305-0548

VL - 25

SP - 969

EP - 979

JO - Computers & Operations Research

JF - Computers & Operations Research

IS - 11

ER -

A local search template

Abstract

Access to Document

Fingerprint

Cite this