An heuristic algorithm for handling multiple responses

Consider the graph G = (V, E) with node set V, edge set E. The subsets D, R subset of V denote the sets of demand and candidate response nodes respect ively. A demand i is an element of D that requires l(i) response units is s aid to be covered, when the j'th response unit to it is within the distance delta(jli), j = 1, 2,..., l(i). The objective under these assumptions is t o determine i) the minimum number of response units that cover all the dema nds, ii) the location of a known number of response units in order to maxim ize the coverage. We develop a heuristic algorithm that finds a near-optima l solution for the problems described above. Finally a computational and co mparative experience is presented.