The maximal expected coverage relocation problem for emergency vehicles

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.