A Hybrid Algorithm for Set Covering Problem1

@inproceedings{Eremeev2000AHA,
  title={A Hybrid Algorithm for Set Covering Problem1},
  author={Anton V. Eremeev and Alexander A. Kolokolov and LIDIA A. ZAOZERSKAYAOmsk},
  year={2000}
}
In this paper we propose a hybrid algorithm for the set covering problem (SCP), which combines L-class enumeration, genetic algorithm (GA) and Lagrangean heuristic. The lexicographical enumeration of L-classes in the linear relaxation of SCP ensures optimality of the resulting solution. Both heuristics are used for obtaining the initial approximate solution. The linear subproblems in L-class enumeration are also tested by means of Lagrangean relaxation. The results of computation experiments… CONTINUE READING