An adaptation of SH heuristic to the location set covering problem

An adaptation of SH heuristic to the location set covering problem

0.00 Avg rating0 Votes
Article ID: iaor19991607
Country: Netherlands
Volume: 100
Issue: 3
Start Page Number: 586
End Page Number: 593
Publication Date: Aug 1997
Journal: European Journal of Operational Research
Authors: ,
Keywords: programming: dynamic
Abstract:

In a recent paper, a new surrogate heuristic (SH) has been proposed for the set covering problem. Here we present an adaptation of it in order to solve more efficiently the location set covering problem. We will show that our new version not only outperforms algorithm SH but that it is more accurate than the pair CMA/FMC. Its power is experimentally tested over a set of 65 randomly generated problems.

Reviews

Required fields are marked *. Your email address will not be published.