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.
A variable neighborhood search algorithm for the multimode set covering problem / F. Colombo, R. Cordone, G. Lulli. - In: JOURNAL OF GLOBAL OPTIMIZATION. - ISSN 0925-5001. - 63:3(2015 Nov 01), pp. 461-480.
A variable neighborhood search algorithm for the multimode set covering problem
F. ColomboPrimo
;R. Cordone
;
2015
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.File | Dimensione | Formato | |
---|---|---|---|
MM-SCP.pdf
Open Access dal 12/01/2017
Descrizione: Articolo
Tipologia:
Pre-print (manoscritto inviato all'editore)
Dimensione
220.2 kB
Formato
Adobe PDF
|
220.2 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.