Modeling co-located servers and dispatch ties in the hypercube model
Computers and Operations Research
A note on solutions to the maximal expected covering location problem
Computers and Operations Research
A multiperiod set covering location model for dynamic redeployment of ambulances
Computers and Operations Research
The heuristic concentration-integer and its application to a class of location problems
Computers and Operations Research
Network location of a reliable center using the most reliable route policy
Computers and Operations Research
Joint location and dispatching decisions for Emergency Medical Services
Computers and Industrial Engineering
| Hi-index | 0.01 |
We give a unified view of Daskin's Maximum Expected Covering Location Problem (MEXCLP) and ReVelle and Hogan's Maximum Availability Location Problem (MALP), identifying similarities and dissimilarities between these models and showing how they relate to each other. These models arise in the location of servers in congested emergency systems. An existing extension of MEXCLP is reviewed; we then develop an extension of MALP and give the corresponding mathematical formulation. These two extensions are obtained when the simplifying assumptions of the original models are dropped and Larson's hypercube model is embedded into local search methods. In this paper these methods are further enhanced by the use of simulated annealing. Computational results are given for problems available in the literature.