A Genetic Algorithm for the Set Covering Problem

1996535 citationsJournal Article

Authors

K. S. Al-Sultan · Engineering Systems (United States)

Mohammed F. Hussain · Automatic Data Processing (United States)

J. S. Nizami · King Fahd University of Petroleum and Minerals

Abstract

In this paper, the set covering problem (SCP) is considered. Several algorithms have been suggested in the literature for solving it. We propose a new algorithm for solving the SCP which is based on the genetic technique. This algorithm has been implemented and tested on various standard and randomly generated test problems. Preliminary results are encouraging, and are better than the existing heuristics for the problem.

Topics & Keywords

Vehicle Routing Optimization Methods Optimization and Packing Problems Transportation and Mobility Innovations

Publication Details

Published in: Journal of the Operational Research Society

Volume 47, Issue 5, pp. 702-709

DOI: 10.1057/jors.1996.82

Field-Weighted Citation Impact: 31.09

Command Palette

A Genetic Algorithm for the Set Covering Problem

Authors

Abstract

Topics & Keywords

Publication Details