Concepts and applications of backup coverage
Management Science
| Hi-index | 0.00 |
Consider the graph G = (V, E) with node set V, edge set E. The subsets D, R ⊂ V denote the sets of demand and candidate response nodes respectively. A demand i ∈ D that requires l_i response units is said to be covered, when the j'th response unit to it is within the distance δ_jl, j = 1, 2, … , l_i. The objective underthese assumptions is to determine i) the minimum number of response unitsthat cover all the demands, ii) the location of a known number ofresponse units in order to maximize the coverage. We develop aheuristic algorithm that finds a near-optimal solution for theproblems described above. Finally a computational and comparativeexperience is presented.