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 or is implied by] V denote the sets of demand and candidate response nodes respectively. A demand i [is an element of] D that requires l_i response units is said to be covered, when the j'th response unit to it...

Full description

Saved in:
Bibliographic Details
Published in:Journal of heuristics 2000-06, Vol.6 (2), p.269
Main Authors: Satratzemi, Maria, Tsouros, Constantine, Harary, Frank
Format: Article
Language:English
Subjects:
Algorithms
Demand
Heuristic
Mathematical models
Optimization
Studies
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Consider the graph G = (V, E) with node set V, edge set E. The subsets D, R [subset or is implied by] V denote the sets of demand and candidate response nodes respectively. A demand i [is an element of] D that requires l_i response units is said to be covered, when the j'th response unit to it is within the distance [delta]_jl, j = 1, 2, ... , l_i. The objective under these assumptions is to determine i) the minimum number of response units that cover all the demands, ii) the location of a known number of response units in order to maximize the coverage. We develop a heuristic algorithm that finds a near-optimal solution for the problems described above. Finally a computational and comparative experience is presented. [PUBLICATION ABSTRACT]
ISSN:1381-1231
1572-9397
DOI:10.1023/A:1009631612046