Article ID: | iaor20072762 |
Country: | United States |
Volume: | 53 |
Issue: | 2 |
Start Page Number: | 170 |
End Page Number: | 179 |
Publication Date: | Mar 2006 |
Journal: | Naval Research Logistics |
Authors: | Sherali Hanif D., Lee Youngho, Kwon Ikhyun, Kim Seongin |
Keywords: | programming: integer, military & defence, sets |
In this paper, we consider a situation in which a group of facilities must be constructed in order to serve a given set of customers, where the facilities might not be able to guarantee an absolute coverage to the different customers. We examine the problem of maximizing the total service reliability of the system subject to a budgetary constraint. We propose a new reformulation of this problem that facilitates the generation of tight lower and upper bounds. These bounding mechanisms are embedded within the framework of a branch-and-bound procedure. Computational results on problem instances ranging in size up to 100 facilities and 200 customers reveal the efficacy of the proposed exact and heuristic approaches.