Variable neighbourhood structures for cycle location problems

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Variable neighbourhood search is a metaheuristic used mainly to tackle combinatorial optimisation problems. Its performance depends on having a good variable neighbourhood structure: that is, a sequence of neighbourhoods that are ideally pairwise disjoint and contain feasible solutions further and further from a given feasible solution. This article defines a variable neighbourhood structure with these properties that is new for cycle location problems. It find bounds for the neighbourhood sizes and shows how to iterate over then when the cycle is a circuit. It tests the structure and iteration method using variable neighbourhood search on a range of median cycle problems and finds a neighbourhood size beyond which there is, on average, no benefit in applying local search. This neighbourhood size is found not to depend on problem size or bound on circuit length.
Original languageEnglish
Pages (from-to)15–26
Number of pages12
JournalEuropean Journal of Operational Research
Volume223
Issue number1
Early online date26 May 2012
DOIs
Publication statusPublished - Nov 2012

Keywords

  • heuristics
  • variable neighbourhood search
  • circuit
  • cycle

Fingerprint Dive into the research topics of 'Variable neighbourhood structures for cycle location problems'. Together they form a unique fingerprint.

  • Cite this