On solving unreliable planar location problems

On solving unreliable planar location problems

0.00 Avg rating0 Votes
Article ID: iaor20013224
Country: United Kingdom
Volume: 28
Issue: 4
Start Page Number: 329
End Page Number: 344
Publication Date: Apr 2001
Journal: Computers and Operations Research
Authors:
Keywords: quality & reliability, heuristics
Abstract:

In this paper, we generalize conventional P-median location problems by considering the unreliability of facilities. The unreliable location problem is defined by introducing the probability that a facility may become inactive. We proposed efficient solution methods to determine locations of these facilities in the unreliable location model. Space-filling curve-based algorithms are developed to determine initial locations of these facilites. The unreliable P-median location problem is then decomposed to P 1-median location problems; each problem is solved to the optimum. A bounding procedure is used to monitor the iterative search, and to provide a consistent basis for termination. Extensive computational tests have indicated that the heuristics are efficient and effective for solving unreliable location problems.

Reviews

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