Heuristic methods for locating emergency facilities

MODSIM05 - International Congress on Modelling and Simulation: Advances and Applications for Management and Decision Making, Proceedings

Volumn , Issue , 2005, Pages 1744-1750

  Caccetta, L ^a   Dzator, M ^a  

^a CURTIN UNIVERSITY   (Australia)

Author keywords

Emergency; Facilities; Heuristics; Location

Indexed keywords

AVERAGE DISTANCE; COMPUTATIONAL RESULTS; COMPUTATIONAL TIME; EMERGENCY; EMERGENCY CARE; EMERGENCY MEDICAL CARE; EXACT METHODS; FACILITY LOCATION PROBLEM; FACILITY LOCATIONS; FIRE STATION; GENERAL NETWORKS; HEURISTIC APPROACH; HEURISTICS; INDUSTRIAL OPTIMIZATION; LEVEL OF SERVICE; MANUFACTURING INDUSTRIES; NETWORK OPTIMIZATION PROBLEM; NP-HARD; OPTIMAL LOCATIONS; OPTIMIZATION PROBLEMS; P-MEDIAN; P-MEDIAN PROBLEMS; QUALITY OF SOLUTION; REDUCTION METHOD; RUSHTON; SERVICE INDUSTRIES; STRUCTURAL MODELS; SUBOPTIMAL SOLUTION; TRAVEL TIME; CAPITAL CONSTRAINTS;

ACCIDENT PREVENTION; AMBULANCES; DECISION MAKING; FACILITIES; INDUSTRY; LOCATION; MODEL STRUCTURES; OPTIMIZATION; SITE SELECTION; STATISTICS; HEURISTIC METHODS; SERVICE INDUSTRY; TRAVEL TIME;

HEURISTIC METHODS; EMERGENCY SERVICES;

EID: 80053126600     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. Beasley, J. (1993), Lagrangean heuristics for location problems, European Journal of Operational Research, 65, 383-399.
2. Berlin, G., C. Revelle, and J. Elzinga (1976), Determining ambulance-hospital locations for on-scene and hospital services, Environment and Planning A, 8, 553-561.
3. Carson, Y. and R. Batta, (1990) Locating an ambulance on Amherst campus of State University of New York at Buffalo, Interfaces, 20, 43-49.
4. Colome, R., H.R. Lourenco, and D. Serra (2003), A new chance-constrained maximum capture location problem, Annals of Operations Research, 122, 121-139. (Pubitemid 38103394)
5. Daskin, M.S. (1982), Application of an expected covering location model to EMS design, Decision Sciences, 13(3), 416-439.
6. Daskin, M.S. (1983), A maximum expected covering location model: formulation, properties and heuristic solution, Transportation Science, 17, 48-70.
7. Daskin, M.S. K. Hogan, and C. ReVelle, (1988) Integration of multiple, excess, backup, and expected covering models, Environment and Planning B, 15, 15-35.
8. Daskin, M.S. (1995), Network and Discrete Location: Models, Algorithms and Application, John Wiley and Sons, Inc., 498 pp., New York,
9. Densham, P.J., and G. Rushton (1992), A more efficient heuristic for solving large p-median problems Papers in Regional Science 71, 307-329.
10. Fitzsimmons, J.A. (1973), A Methodology for Emergency Ambulance Deployment, Management Science 19, 627-636.
11. Galvao, R.D. (1980), A dual-bounded algorithm for the p-median problem, Operations Research, 28, 1112-1121.
12. Golden, B.L., and C. Skiscism (1986) using simulated annealing to solve routing and location problems, Naval Logistics Quarterly, 33, 261-279.
13. Glover F. (1990), Tabu search: a tutorial, Interfaces, 20, 74-94.
14. Hakimi, S.L. (1964), Optimisation locations of switching centres and the absolute centres and medians of a graph, Operations Research, 12, 450-459.
15. Hosage, C.M., and M.F. Goodchild (1986), Discrete space location-allocation solutions from genetic algorithms, Annals of Operations Research, 6, 35-46.
16. Kariv, O. and S.L. Hakimi (1979), An algorithmic approach to network location problems II: the p-medians, SIAM Journal on Applied Mathematics, 37, 539-560. (Pubitemid 10432632)
17. Maranzana, F.E. (1964), On the location of supply points to minimize transport costs, Operational Research Quaterly, 15, 261-270.
18. Mirchandani, P.B. (1980), Locational decisions on stochastic networks, Geographical Analysis, 12, 172-183.
19. Narula, S.C., V.I. Ogbu and H.M. Samuelson (1977), An algorithm for the p-median problem, Operations Research, 25, 709-712.
20. Paluzzi, M. (2004), Testing a heuristic p-median location allocation model for siting emergency service facilities, Paper presented at annual meeting of association of American Geographers, Philadelphia, PA.
21. Serra D., and V. Marianov (1998), The p-median problem in a changing network: the case of Barcelona, Location Science, 6, 383-394.
22. Swain, R. (1971), A decomposition algorithm for a class of facility location problems. Unpublished Ph.D. dissertation, Cornell University, Ithaca, NY.
23. Teitz, M. B., and P. Bart (1968), Heuristic methods for estimating generalized vertex median of a weighted graph, Operations Research, 16, 955-961.
24. Weaver, J.R., and R.L. Church (1985), A median location model with nonclosest facility service, Transportation Science, 19, 58-74.