Journal article
A comparison of acceptance criteria for the adaptive large neighbourhood search metaheuristic
Pompeu Fabra University1
Department of Management Engineering, Technical University of Denmark2
Management Science, Department of Management Engineering, Technical University of Denmark3
Transport DTU, Department of Management Engineering, Technical University of Denmark4
Operations Research, Management Science, Department of Management Engineering, Technical University of Denmark5
Molde University College6
Adaptive large neighborhood search (ALNS) is a useful framework for solving difficult combinatorial optimisation problems. As a metaheuristic, it consists of some components that must be tailored to the specific optimisation problem that is being solved, while other components are problem independent.
The literature is sparse with respect to studies that aim to evaluate the relative merit of different alternatives for specific problem independent components. This paper investigates one such component, the move acceptance criterion in ALNS, and compares a range of alternatives. Through extensive computational testing, the alternative move acceptance criteria are ranked in three groups, depending on the performance of the resulting ALNS implementations.
Among the best variants, we find versions of criteria based on simulated annealing, threshold acceptance, and record-to-record travel, with a version of the latter being consistently undominated by the others. Additional analyses focus on the search behavior, and multiple linear regression is used to identify characteristics of search behavior that are associated with good search performance.
Language: | English |
---|---|
Publisher: | Springer US |
Year: | 2018 |
Pages: | 783-815 |
ISSN: | 15729397 and 13811231 |
Types: | Journal article |
DOI: | 10.1007/s10732-018-9377-x |
ORCIDs: | 0000-0002-0440-0357 and Røpke, Stefan |