Solution approaches for facility location of medical supplies for large-scale emergencies

Computers and Industrial Engineering

Volumn 52, Issue 2, 2007, Pages 257-276

  Jia, Hongzhong ^a   Ordóñez, Fernando ^a   Dessouky, Maged M ^a  

^a University of Southern California ^*  (United States)

Author keywords

Genetic algorithm; Greedy algorithm; Lagrangean relaxation; Large scale emergency; Locate allocate; Maximal covering problem

Indexed keywords

DATA STRUCTURES; GENETIC ALGORITHMS; HEURISTIC METHODS; INFORMATION MANAGEMENT; REQUIREMENTS ENGINEERING;

GREEDY ALGORITHMS; LAGRANGEAN RELAXATION; LARGE-SCALE EMERGENCY; MAXIMAL COVERING PROBLEM;

HOSPITAL DATA PROCESSING;

EID: 33847123676     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2006.12.007     Document Type: Article

References (39)

1. Aickelin U. An indirect genetic algorithm for set covering problems. Journal of the Operational Research Society 53 (2002) 1118-1126
2. Alp O., Drezner Z., and Erkut E. An Efficient Genetic Algorithm for the p-Median Problem. Annals of Operations Research 122 (2003) 21-42
3. Al-Sultan K.S., and Al-Fawzan M.A. A tabu search approach to the uncapacitated facility location problem. Annals of Operations Research 86 (1999) 91-103
4. Alves M.L., and Almeida M.T. Simulated annealing algorithm for the simple plant location problem: A computational study. Revista Investigaćão Operacional (1992) 12
5. Beasley J.E., and Chu P.C. A genetic algorithm for the set covering problem. European Journal of Operational Research 94 (1996) 392-404
6. CDC website (2005). Available from: .
7. Chen B., and Lin C.S. Minmax-regret robust 1-median location on a tree. Networks 31 (1998) 93-103
8. Church R., and ReVelle C. The maximal covering location problem. Papers of the Regional Science Association 32 (1974) 101-118
9. Cooper L. Heuristic methods for location - allocation Problems. SIAM Review 6 (1964) 37-53
10. Daskin M.S. Network and discrete location: models, algorithms, and applications (1995), John Wiley & Sons, New York
11. Dessouky M.M., Ordóñez F., Jia H.Z., and Shen Z.H. Rapid Distribution of Medical Supplies. In: Hall R. (Ed). Delay Management in Health Care Systems (2006), Springer
12. ESRI website (2006). .
13. Galvão R.D., and ReVelle C. A lagrangean heuristic for the maximal covering location problem. European Journal of Operational Research 88 (1996) 114-123
14. Gen M., and Cheng R. Genetic algorithms and engineering optimization (2000), Wiley, New York
15. Geoffrion A.M. Lagrangean relaxation for integer programming. Mathematical Programming Study 2 (1974) 82-114
16. Goldberg D.E. Genetic algorithms in search, optimization and machine learning (1989), Addison-Wesley, Reading, MA
17. Hakimi S.L. Locations with spatial interaction: competitive locations and games. In: Mirchandani P.B., and Francis R.L. (Eds). Discrete Location Theory (1990), Wiley, New York
18. Hogan K., and ReVelle C. Concepts and applications of backup coverage. Management Science 32 (1986) 1434-1444
19. Holmberg K., and Ling J. A lagrangean heuristic for the facility location problem with staircase costs. European Journal of Operational Research 97 (1997) 63-74
20. Jacobsen S.K. Heuristics for the capacitated plant location model. European Journal of Operational Research 12 (1983) 253-261
21. Jain, K., Mahdian, M., Saberi, A. (2002). A new greedy approach for facility location problems. In Proceedings of the 34th Annual ACM symposium on Theory of Computing, pp. 731-740.
22. Jaramillo J.H., Bhadury J., and Batta R. On the use of genetic algorithms to solve location problems. Location Analysis 29 6 (2002) 761-779
23. Jia H.Z., Ordóñez F., and Dessouky M.M. A modeling framework for facility location of medical services for large-scale emergencies. IIE Transactions 39 1 (2007) 41-55
24. Kariv O., and Hakimi S. An algorithm approach to network location problem. SIAM Journal of Applied Mathematics 37 (1979) 513-560
25. Ladd S.R. Genetic algorithms in C++ (1996), M & T Books, New York
26. Larson R.C., and Brandeau M. Extending and applying the hypercube queueing model to deploy ambulances in Boston. In: Swersey A., and Ignall E. (Eds). Delivery of Urban Services (1986), North Holland, New York
27. Lorena L., and deSouza-Lopez L. GAs applied to computationally difficult set covering problems. Journal of the Operational Research Society 48 (1977) 440-445
28. Lorena L., and Lopes F. A surrogate heuristic for set covering problems. European Journal of Operational Research 79 (1994) 138-150
29. Marianov V., and ReVelle C. The queueing maximal availability location problem: a model for the siting of emergency vehicles. European Journal of Operational Research 93 (1996) 110-120
30. Megiddo N., Zemel E., and Hakimi S.L. The maximum coverage location problem. SIAM Journal of Algebraic and Discrete Methods 4 (1983) 253-261
31. Owen, S. H., Daskin, M. S. (1998). Strategic facility location via evolutionary programming. Working paper, Department of Industrial Engineering and Management Science, Northwestern University, Evanston, Illinois.
32. Paluzzi, M. (2004). Testing a heuristic P-median location allocation model for siting emergency service facilities. Paper Presented at the Annual Meeting of Association of American Geographers, Philadelphia, PA.
33. Pirkul H., and Schilling D. The capacitated maximal covering location problem with backup service. Annal of Operations Research 18 (1989) 141-154
34. Schilling D., Elzinga D., Cohon J., Church R., and ReVelle C. The TEAM/FLEET models for simultaneous facility and equipment siting. Transportation Science 13 (1979) 163-175
35. Snyder L.V. Facility location under uncertainty: a review. IIE Transactions 38 7 (2006) 547-564
36. Snyder L.V., and Daskin M.S. Stochastic p-robust location problems. IIE Transactions 38 11 (2006) 971-985
37. Taillard E.D. Heuristic methods for large centroid clustering problems. Journal of Heuristics 9 (2003) 51-73
38. Weaver, J.R., & Church, R.L. (1984). A comparison of direct and indirect primal heuristic/dual bounding solution procedures for the maximal covering location problem. Working Paper.
39. Whitaker R. A fast algorithm for the greedy interchange of large-scale clustering and median location problems. INFOR 21 (1983) 95-108