scholarly journals Maximum Coverage Location Model for Fire Stations with Top Corporate Risk Locations

Author(s):  
Abdulaziz Saleh Alzahrani ◽  
Ahmad Al Hanbali

The fire station location is a critical decision to optimize the coverage level as measured in terms of the response time. This paper focuses on optimizing the coverage problem, especially in the fire protection field, with new model features to incorporate realistic business challenges such as location criticality and secondary coverage. We extend the deterministic Maximum Coverage Location Problem to account for Top Corporate Risk locations being covered by different fire stations as primary and secondary coverage. To deal with the response time uncertainty arising in practice, we propose a new binary linear problem based on the Maximum Expected Covering Location Problem. By exploiting the model structural characteristics, we prove that the model complexity can be substantially reduced to yield an efficient solution. In the numerical experiments, we use a real case study with five years of historical data. The optimization results of the models yield a priority ranking of the fire stations to open and show the value of incorporating the coverage uncertainty. Finally, we also compare our model with uncertainty with the standard scenario-based optimization to extend the numerical results.

2004 ◽  
Vol 92 ◽  
pp. 52-64 ◽  
Author(s):  
Maria Flavia Mammana ◽  
Steffen Mecke ◽  
Dorothea Wagner

2013 ◽  
Vol 47 (4) ◽  
pp. 617-628 ◽  
Author(s):  
S. A. MirHassani ◽  
R. Ebrazi

2015 ◽  
Vol 20 (7) ◽  
pp. 2565-2575 ◽  
Author(s):  
M. Gabli ◽  
E. M. Jaara ◽  
E. B. Mermri

2013 ◽  
Vol 2013 ◽  
pp. 1-11 ◽  
Author(s):  
Dandan Hu ◽  
Zhi-Wei Liu ◽  
Wenshan Hu

In many services, promise of specific response time is advertised as a commitment by the service providers for the customer satisfaction. Congestion on service facilities could delay the delivery of the services and hurts the overall satisfaction. In this paper, congestion service facilities location problem with promise of response time is studied, and a mixed integer nonlinear programming model is presented with budget constrained. The facilities are modeled as M/M/c queues. The decision variables of the model are the locations of the service facilities and the number of servers at each facility. The objective function is to maximize the demands served within specific response time promised by the service provider. To solve this problem, we propose an algorithm that combines greedy and genetic algorithms. In order to verify the proposed algorithm, a lot of computational experiments are tested. And the results demonstrate that response time has a significant impact on location decision.


Sign in / Sign up

Export Citation Format

Share Document