Abstract
A multi-objective version of the Maximum Availability Location Problem is presented in this paper. The assumption of server independence is relaxed by adopting the approach of the Queuing Probabilistic Location Set Covering Problem for calculating the probability that all servers in a given region are busy. The first objective seeks to maximize the population receiving coverage within a given distance standard and with a given level of reliability. The second objective chooses those locations which minimize the cost of covering the population. This model is used to obtain sets of good locations using data obtained from the Barbados Emergency Ambulance Service. The solutions obtained from the optimization model are then subject to a detailed analysis by simulation. The results reveal the potentially good performance of the system, when locations derived from the optimization model are used.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
