On solving the discrete location problems when the facilities are prone to failure

• Published in: Applied mathematical modelling Vol. 31; no. 5; pp. 817 - 831
• Main Authors: Lee, Shine-Der, Chang, Wen-Tin
• Format: Journal Article
• Language: English
• Published: New York, NY Elsevier Inc 01.05.2007; Elsevier Science
• Subjects: Applied sciences; Discrete location model; Exact sciences and technology; Heuristic; Logistics; Operational research and scientific management; Operational research. Management science; Site selection; Unreliable facilities; Discrete location model; Site selection; Unreliable facilities; Heuristic; Mobile radiocommunication; Probabilistic approach; Cellular radio; Telephone network; Fixed cost; Modular system; Rupture; Operating cost; Cell network; Communication network; Failures; Modeling; Location problem; Facility location; Integer programming; Heuristic method; Telecommunication network
• ISSN: 0307-904X
• DOI: 10.1016/j.apm.2005.12.012

The classical discrete location problem is extended here, where the candidate facilities are subject to failure. The unreliable location problem is defined by introducing the probability that a facility may become inactive. The formulation and the solution procedure have been motivated by an application to model and solve a large size problem for locating base stations in a cellular communication network. We formulate the unreliable discrete location problems as 0–1 integer programming models, and implement an enhanced dual-based solution method to determine locations of these facilities to minimize the sum of fixed cost and expected operating (transportation) cost. Computational tests of some well-known problems have shown that the heuristic is efficient and effective for solving these unreliable location problems.