A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering

@article{Pessoa2013AHL,
  title={A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering},
  author={Luciana S. Pessoa and Mauricio G. C. Resende and Celso C. Ribeiro},
  journal={Computers & OR},
  year={2013},
  volume={40},
  pages={3132-3146}
}
The set k-covering problem is an extension of the set covering problem, in which each object has to be covered at least k times. We describe a GRASP with path-relinking heuristic for its solution, as well as the template of a family of Lagrangean heuristics. The hybrid GRASP Lagrangean heuristic employs the GRASP with path-relinking heuristic using modified costs to obtain solutions for the Lagrangean relaxation problem. Numerical experiments have shown that the Lagrangean heuristics performed… CONTINUE READING

Citations

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

References

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

A Lagrangian heuristic for set-covering problems

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

OR-Library: Distributing test problems by electronic mail

  • J. E. Beasley
  • Journal of the Operational Research Society,
  • 1990
Highly Influential
5 Excerpts

Metaheuristic hybridization with Greedy Randomized Adaptive Search Procedures Greedy randomized adaptive search procedures

  • F. Glover, G. Kochenberger
  • Handbook of Metaheuristics
  • 2003

Similar Papers

Loading similar papers…