A multiperiod set covering location model for dynamic redeployment of ambulances

Computers and Operations Research

Volumn 35, Issue 3, 2008, Pages 814-826

  Rajagopalan, Hari K ^a   Saydam, Cem ^b   Xiao, Jing ^c  

^a FRANCIS MARION UNIVERSITY   (United States)

^b UNIVERSITY OF NORTH CAROLINA AT CHARLOTTE   (United States)

^c University of North Carolina at Charlotte   (United States)

Author keywords

Covering location problems; Hypercube model; Tabu search

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SIMULATION; MATHEMATICAL MODELS; PROBABILITY; RELIABILITY THEORY; TABU SEARCH;

COVERING LOCATION PROBLEMS; EMERGENCY MEDICAL SERVICE (EMS) PROVIDERS; HYPERCUBE MODELS; SIMULATION MODELS;

DYNAMIC PROGRAMMING;

EID: 34548382065     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.04.003     Document Type: Article

References (42)

1. Brotcorne L., Laporte G., and Semet F. Ambulance location and relocation models. European Journal of Operational Research 147 (2003) 451-463
2. Goldberg J.B. Operations research models for the deployment of emergency services vehicles. EMS Management Journal 1 1 (2004) 20-39
3. Ball M.O., and Lin L.F. A reliability model applied to emergency service vehicle location. Operations Research 41 (1993) 18-36
4. ILOG, ILOG Cplex 7.0 reference manual. 2000: ILOG.
5. Galvao R.D., Chiyoshi F.Y., and Morabito R. Towards unified formulations and extensions of two classical probabilistic location models. Computers & Operations Research 32 1 (2005) 15-33
6. Karasakal O., and Karasakal E.K. A maximal covering location model in the presence of partial coverage. Computers & Operations Research 31 (2004) 1515-1526
7. Brotcorne L., Laporte G., and Semet F. Fast heuristics for large scale covering location problems. Computers & Operations Research 29 (2002) 651-665
8. Aytug H., and Saydam C. Solving large-scale maximum expected covering location problems by genetic algorithms: a comparative study. European Journal of Operational Research 141 (2002) 480-494
9. Saydam C., and Aytug H. Accurate estimation of expected coverage: revisited. Socio-Economic Planning Sciences 37 (2003) 69-80
10. Gendreau M., Laporte G., and Semet F. A dynamic model and parallel tabu search heuristic for real time ambulance relocation. Parallel Computing 27 (2001) 1641-1653
11. Schilling D.A., Jayaraman V., and Barkhi R. A review of covering problems in facility location. Location Science 1 1 (1993) 25-55
12. Owen S.H., and Daskin M.S. Strategic facility location: a review. European Journal of Operational Research 111 (1998) 423-447
13. Daskin M.S. A maximal expected covering location model: formulation, properties, and heuristic solution. Transportation Science 17 (1983) 48-69
14. ReVelle C., and Hogan K. The maximum availability location problem. Transportation Science 23 (1989) 192-200
15. Revelle C., and Hogan K. The maximum reliability location problem and alpha-reliable p-center problems: derivatives of the probabilistic location set covering problem. Annals of Operations Research 18 (1989) 155-174
16. Marianov V., and ReVelle C. The queuing probabilistic location set covering problem and some extensions. Socio-Economic Planning Sciences 28 (1994) 167-178
17. Larson R.C. A hypercube queuing model for facility location and redistricting in urban emergency services. Computers & Operations Research 1 (1974) 67-95
18. Zaki A.S., Cheng H.K., and Parker B.R. A simulation model for the analysis and management of an emergency service system. Socio-Economic Planning Sciences 31 2 (1997) 173-189
19. Larson R.C. Approximating the performance of urban emergency service systems. Operations Research 23 (1975) 845-868
20. Batta R., Dolan J.M., and Krishnamurthy N.N. The maximal expected covering location problem: revisited. Transportation Science 23 (1989) 277-287
21. Chan Y. Location theory and decision analysis (2001), South Western College Publishing, Cincinnati
22. Daskin M.S. Network and discrete location (1995), Wiley, New York
23. Larson R.C. Urban operations research (1981), Prentice-Hall, Englewood Cliffs, NJ
24. ReVelle C. Review, extension and prediction in emergency siting models. European Journal of Operational Research 40 (1989) 58-69
25. Saydam C., Repede J., and Burwell T. Accurate estimation of expected coverage: a comparative study. Socio-Economic Planning Sciences 28 2 (1994) 113-120
26. Burwell T., Jarvis J.P., and McKnew M.A. Modeling co-located servers and dispatch ties in the hypercube model. Computers & Operations Research 20 (1993) 113-119
27. Takeda RA, Widmer JA, Morabito R. Analysis of ambulance decentralization in an urban medical emergency service using the hypercube queuing model, Computers & Operations Research, 2005, in press, corrected proof available online 17 May 2005, doi: 10.1016/j.cor.2005.03.022.
28. Jarvis J.P. Approximating the equilibrium behavior of multi-server loss systems. Management Science 31 (1985) 235-239
29. Repede J., and Bernardo J. Developing and validating a decision support system for locating emergency medical vehicles in Louisville, Kentucky. European Journal of Operational Research 75 (1994) 567-581
30. Charnes A., and Cooper W. Chance constrained programming. Management Science 6 (1959) 73-79
31. Galvão R.D., Chiyoshi F.Y., and Morabito R. Towards unified formulations and extensions of two classical probabilistic location models. Computers & Operations Research 32 1 (2005) 15-33
32. Glover F., and Laguna M. Tabu search (1997), Kluwer, Boston, MA
33. Osman I.H., and Laporte G. Metaheuristics: a bibliography. Annals of Operations Research 63 (1996) 513-628
34. Gendreau M., Guertin F., Potvin J.Y., and Taillard E. Parallel tabu search for real-time vehicle routing and dispatching. Transportation Science 33 (1999) 381-390
35. Gendreau M., Laporte G., and Semet F. Solving an ambulance location model by tabu search. Location Science 5 2 (1997) 75-88
36. Chiyoshi F.Y., and Galvao R.D. A statistical analysis of simulated annealing applied to the p-median problem. Annals of Operations Research 96 (2000) 61-74
37. Beasley J.E., and Chu P.C. A genetic algorithm for the set covering problem. European Journal of Operational Research 94 (1996) 392-404
38. Jaramillo J., Bhadury J., and Batta R. On the use of genetic algorithms to solve location problems. Computers & Operations Research 29 (2002) 761-779
39. Battiti R., and Tecchiolli G. The reactive tabu search. Journal on Computing 6 2 (1994)
40. Chiyoshi F.Y., Galvao R.D., and Morabito R. A note on solutions to the maximal expected covering location problem. Computers & Operations Research 30 (2002) 87-96
41. Amiri A. The multi-hour service system design problem. European Journal of Operational Research 128 (2001) 625-638
42. Rajagopalan HK, Vergara FE, Saydam C, Xiao J. Developing effective meta-heuristics for a probabilistic location model via experimental design. European Journal of Operational Research, 2005, in press, corrected proof available online 26 January 2006.