The maximal expected coverage relocation problem for emergency vehicles

The maximal expected coverage relocation problem for emergency vehicles

0.00 Avg rating0 Votes
Article ID: iaor20071918
Country: United Kingdom
Volume: 57
Issue: 1
Start Page Number: 22
End Page Number: 28
Publication Date: Jan 2006
Journal: Journal of the Operational Research Society
Authors: , ,
Keywords: programming: integer, simulation: applications, location
Abstract:

In the Maximal Expected Coverage Relocation Problem the aim is to provide a dynamic relocation strategy for emergency vehicle waiting sites in such a way that the expected covered demand is maximized and the number of waiting site relocations is controlled. The problem can be formulated as an integer linear program. When the number of vehicles is relatively small this program can be solved within reasonable computing time. Simulations conducted with real-life emergency medical services data from the Montreal area confirm the feasibility of the proposed approach.

Reviews

Required fields are marked *. Your email address will not be published.