J. Puerto, F. Ricca, A. Scozzari
In this paper we study a location problem on networks that combines three important issues: 1) it considers that facilities are extensive, 2) it handles simultaneously the location of more than one facility, and 3) it incorporates reliability aspects assuming that facilities may fail. The problem consists of locating two path-shaped facilities minimizing the expected service cost in the long run, assuming that paths may become unavailable and their failure probabilities are known in advance. We show that the problem in general networks is NP-hard. Then, we provide a recursive algorithm that solves the problem on tree networks in O(n2) time, where n is the number of vertices.
Reliable location, path-shaped facilities, network location
Tipo di pubblicazione: