An effective and simple heuristic for the set covering problem

@article{Lan2007AnEA,
  title={An effective and simple heuristic for the set covering problem},
  author={Guanghui Lan and Gail W. DePuy and Gary E. Whitehouse},
  journal={European Journal of Operational Research},
  year={2007},
  volume={176},
  pages={1387-1403}
}
This paper investigates the development of an effective heuristic to solve the set covering problem (SCP) by applying the meta-heuristic Meta-RaPS (Meta-heuristic for Randomized Priority Search). In Meta-RaPS, a feasible solution is generated by introducing random factors into a construction method. Then the feasible solutions can be improved by an improvement heuristic. In addition to applying the basic Meta-RaPS, the heuristic developed herein integrates the elements of randomizing the… CONTINUE READING
Highly Cited
This paper has 68 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 42 extracted citations

69 Citations

051015'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 69 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 31 references

Computational experience with approximation algorithms for the set covering problem

  • T. Grossman, A. Wool
  • European Journal of Operational Research
  • 1997
Highly Influential
4 Excerpts

A Lagrangian heuristic for set covering problems

  • J. E. Beasley
  • Naval Research Logistics
  • 1990
Highly Influential
6 Excerpts

An algorithm for set covering problem

  • J. E. 875–890. Beasley
  • European Journal of Operational Research
  • 1987
Highly Influential
9 Excerpts

Meta-RaPS: A simple and effective approach for solving the traveling salesman

  • G. W. 77–97. DePuy, R. J. Moraga, G. Whitehouse
  • 2005
Highly Influential
4 Excerpts

Meta - RaPS : A simple and effective approach for solving the traveling salesman problem

  • G. W. DePuy, R. J. Moraga, G. Whitehouse
  • Transportation Research Part E : Logistics and…
  • 2005
2 Excerpts

A probabilistic greedy search algorithm for combinatorial optimization with application to the set covering problem

  • M. Haouari, J. S. Chaouachi
  • Journal of the Operational Research Society
  • 2002
2 Excerpts

Similar Papers

Loading similar papers…