A two-phase heuristic for set covering

Salim Haddadi, Meryem Cheraitia and Abdellah Salhi

International Journal of Mathematics in Operational Research, 2018, vol. 13, issue 1, 61-78

Abstract: The set covering problem (SCP) is a well-known computationally intractable problem. We suggest here a two-phase heuristic to solve it. The first phase reduces substantially the size of the given SCP by removing some variables; the second phase applies a simple Lagrangian heuristic applied to the reduced problem. Construction and improvement heuristics are embedded in the Lagrangian solution approach. The construction heuristic provides good covers by solving small SCPs. The improvement heuristic inserts these covers into larger ones from which better covers are extracted, again by solving different but also small SCPs. The novelty lies in the reduction of the problem size by an effective variable-fixing heuristic, which, in practice, eliminates up to 95% of the variables of the problem without sacrificing the solution quality. Extensive computational and comparative results are presented.

Keywords: set covering; variable-fixing heuristic; greedy heuristic with regret; Lagrangian heuristic. (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=92962 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:13:y:2018:i:1:p:61-78

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().