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

Fingerprint

Location Problem
Cycle
Networks (circuits)
Combinatorial optimization
Variable Neighborhood Search
Iteration Method
Combinatorial Optimization Problem
Iterate
Metaheuristics
Local Search
Location problem
Pairwise
Disjoint
Range of data
Variable neighborhood search

Keywords

  • heuristics
  • variable neighbourhood search
  • circuit
  • cycle

Cite this

Variable neighbourhood structures for cycle location problems. / Lamb, John.

In: European Journal of Operational Research, Vol. 223, No. 1, 11.2012, p. 15–26.

Research output: Contribution to journalArticle

@article{9529a9460aff4a658a9f177249b2967f,
title = "Variable neighbourhood structures for cycle location problems",
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.",
keywords = "heuristics, variable neighbourhood search, circuit, cycle",
author = "John Lamb",
year = "2012",
month = "11",
doi = "10.1016/j.ejor.2012.05.038",
language = "English",
volume = "223",
pages = "15–26",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - Variable neighbourhood structures for cycle location problems

AU - Lamb, John

PY - 2012/11

Y1 - 2012/11

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

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

KW - heuristics

KW - variable neighbourhood search

KW - circuit

KW - cycle

U2 - 10.1016/j.ejor.2012.05.038

DO - 10.1016/j.ejor.2012.05.038

M3 - Article

VL - 223

SP - 15

EP - 26

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 1

ER -