Home > Research > Publications & Outputs > A variable neighborhood search algorithm for th...

Research

Associated organisational units

Links

Text available via DOI:

Keywords

View graph of relations

A variable neighborhood search algorithm for the multimode set covering problem

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

A variable neighborhood search algorithm for the multimode set covering problem. / Colombo, Fabio; Cordone, Roberto; Lulli, Guglielmo.
In: Journal of Global Optimization, Vol. 63, No. 3, 11.2015, p. 461-480.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Colombo, F, Cordone, R & Lulli, G 2015, 'A variable neighborhood search algorithm for the multimode set covering problem', Journal of Global Optimization, vol. 63, no. 3, pp. 461-480. https://doi.org/10.1007/s10898-013-0094-6

APA

Colombo, F., Cordone, R., & Lulli, G. (2015). A variable neighborhood search algorithm for the multimode set covering problem. Journal of Global Optimization, 63(3), 461-480. https://doi.org/10.1007/s10898-013-0094-6

Vancouver

Colombo F, Cordone R, Lulli G. A variable neighborhood search algorithm for the multimode set covering problem. Journal of Global Optimization. 2015 Nov;63(3):461-480. Epub 2013 Aug 11. doi: 10.1007/s10898-013-0094-6

Author

Colombo, Fabio ; Cordone, Roberto ; Lulli, Guglielmo. / A variable neighborhood search algorithm for the multimode set covering problem. In: Journal of Global Optimization. 2015 ; Vol. 63, No. 3. pp. 461-480.

Bibtex

@article{0ae37440f8f646cf8f72c804eac61ce3,
title = "A variable neighborhood search algorithm for the multimode set covering problem",
abstract = "This paper introduces the multi-mode set covering problem, which consists of a plurality of set covering problems linked by cardinality constraints. We propose a variable neighborhood search algorithm and a greedy randomized adaptive search procedure based on a common local search routine. This routine applies a penalized relaxation of the covering constraints, tuned by self-adapting parameters, and visits a sequence of neighborhoods in a nested strategy. We compare the two heuristics with each other and with a time-limited run of a general-purpose integer linear programming solver, on a benchmark set of instances with heterogeneous structure. Both heuristics outperform the solver, though with interesting differences with respect to the various classes of instances. In particular, the variable neighborhood search algorithm proves more effective and less dependent on the specific features of the instances.",
keywords = "Greedy randomized adaptive search procedure, Set covering problem, Variable neighborhood search",
author = "Fabio Colombo and Roberto Cordone and Guglielmo Lulli",
year = "2015",
month = nov,
doi = "10.1007/s10898-013-0094-6",
language = "English",
volume = "63",
pages = "461--480",
journal = "Journal of Global Optimization",
issn = "0925-5001",
publisher = "Springer Netherlands",
number = "3",

}

RIS

TY - JOUR

T1 - A variable neighborhood search algorithm for the multimode set covering problem

AU - Colombo, Fabio

AU - Cordone, Roberto

AU - Lulli, Guglielmo

PY - 2015/11

Y1 - 2015/11

N2 - This paper introduces the multi-mode set covering problem, which consists of a plurality of set covering problems linked by cardinality constraints. We propose a variable neighborhood search algorithm and a greedy randomized adaptive search procedure based on a common local search routine. This routine applies a penalized relaxation of the covering constraints, tuned by self-adapting parameters, and visits a sequence of neighborhoods in a nested strategy. We compare the two heuristics with each other and with a time-limited run of a general-purpose integer linear programming solver, on a benchmark set of instances with heterogeneous structure. Both heuristics outperform the solver, though with interesting differences with respect to the various classes of instances. In particular, the variable neighborhood search algorithm proves more effective and less dependent on the specific features of the instances.

AB - This paper introduces the multi-mode set covering problem, which consists of a plurality of set covering problems linked by cardinality constraints. We propose a variable neighborhood search algorithm and a greedy randomized adaptive search procedure based on a common local search routine. This routine applies a penalized relaxation of the covering constraints, tuned by self-adapting parameters, and visits a sequence of neighborhoods in a nested strategy. We compare the two heuristics with each other and with a time-limited run of a general-purpose integer linear programming solver, on a benchmark set of instances with heterogeneous structure. Both heuristics outperform the solver, though with interesting differences with respect to the various classes of instances. In particular, the variable neighborhood search algorithm proves more effective and less dependent on the specific features of the instances.

KW - Greedy randomized adaptive search procedure

KW - Set covering problem

KW - Variable neighborhood search

U2 - 10.1007/s10898-013-0094-6

DO - 10.1007/s10898-013-0094-6

M3 - Journal article

VL - 63

SP - 461

EP - 480

JO - Journal of Global Optimization

JF - Journal of Global Optimization

SN - 0925-5001

IS - 3

ER -