Location of Repository

An Iterated Heuristic Algorithm for the Set Covering Problem

By Elena Marchiori and Adri Steenbeek

Abstract

The set covering problem is a well-known NP-hard combinatorial optimization problem with wide practical applications. This paper introduces a novel heuristic for the uni-cost set covering problem. An iterated approximation algorithm (ITEG) based on this heuristic is developed: in the first iteration a cover is constructed, and in the next iterations a new cover is built by starting with part of the best solution so far obtained. The final output of the algorithm is the best solution obtained in all the iterations. ITEG is empirically evaluated on a set of randomly generated problem instances, on instances originated from the Steiner triple systems, and on instances derived from two challenging combinatorial questions by Erdos. The performance of ITEG on these benchmark problems is very satisfactory, both in terms of solution quality (i.e., small covers) as well as in terms of running time

Year: 1998
OAI identifier: oai:CiteSeerX.psu:10.1.1.41.168
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.mpi-sb.mpg.de/~wae9... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.