Haddadi, S and Guessoum, F and Cheraitia, M and Salhi, A (2018) 'A Two-Phase Heuristic for Set Covering.' International Journal of Mathematics in Operational Research, 13 (1). 61 - 78. ISSN 1757-5850
|
Text
authorFinalVersion.pdf - Accepted Version Download (1MB) | Preview |
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.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Set Covering; Variable-fixing Heuristic; Greedy Heuristic with Regret; Lagrangian Heuristic |
| Subjects: | Q Science > QA Mathematics |
| Divisions: | Faculty of Science and Health > Mathematical Sciences, Department of |
| Depositing User: | Jim Jamieson |
| Date Deposited: | 06 Dec 2016 10:26 |
| Last Modified: | 13 May 2019 01:00 |
| URI: | http://repository.essex.ac.uk/id/eprint/18349 |
Actions (login required)
 |
View Item |
Altmetric
Altmetric