Selecting hierarchical facilities in a service-operations environment

European Journal of Operational Research

Volumn 147, Issue 3, 2003, Pages 613-628

  Jayaraman, Vaidyanathan ^a   Gupta, Rakesh ^b   Pirkul, Hasan ^b  

^a UNIVERSITY OF MIAMI   (United States)

^b UNIVERSITY OF TEXAS AT DALLAS   (United States)

Author keywords

Heuristics; Mathematical programming; Service location; Service operations

Indexed keywords

HEURISTIC METHODS; LAGRANGE MULTIPLIERS; LINEAR PROGRAMMING; SET THEORY;

SERVICE FACILITIES;

OPERATIONS RESEARCH;

EID: 0037449218     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00300-4     Document Type: Article

References (36)

1. Batta R., Mannur N. Covering-location models for emergency situations that require multiple response units. Management Science. 36:1990;16-23.
2. Bianchi G., Church R. A hybrid fleet model for emergency medical service systems design. Social Sciences Medicine. 26:1988;163-171.
3. Brandeau M., Chiu S. An overview of representative problems in location research. Management Science. 35:1989;527-552.
4. Church R., Current J., Storbeck J. A bicriterion maximal covering location formulation which considers the satisfaction of uncovered demand. Decision Sciences. 22:1991;38-52.
5. Church R., ReVelle C. The maximal covering location problem. Papers of Regional Science Association. 32:1974;101-118.
6. CPLEX, 1993. CPLEX Optimization, Inc. NV.
7. Current J., Storbeck J.E. Capacitated covering models. Environment and Planning B. 14:1988;183-192.
8. Daskin M. Application of an expected covering model to emergency medical service system design. Decision Sciences. 13:1982;416-439.
9. Daskin M. Network and Discrete Location: Models, Algorithms, and Applications. 1995;John Wiley & Sons, New York.
10. Eaton D., Daskin M., Simmons D., Bullock B., Jausma G. Determining emergency medical service vehicle deployment in Austin, Texas. Interfaces. 15:1985;96-108.
11. Fisher M. An applications oriented guide to Lagrangian relaxation. Interfaces. 15:1985;10-21.
12. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-completeness. 1979;Freeman, San Francisco.
13. Holmberg K. A Lagrangian heuristic based brunch-and-bound approach for the capacitated network design problem. Operations Research. 48:2000;461-481.
14. Hunting M., Faigle U., Kern W. A Lagrangian relaxation approach to the edge-weighted clique problem. European Journal of Operational Research. 2001;119-131.
15. Jack C., Kai S.R., Shulman A. NETCAP: An interactive optimization system for GTE telephone network planning. Interfaces. 22:1992;72-89.
16. Jain K., Vazirani V. Approximation algorithms for metric facility location and kappa-median problems using the primal-dual schema and Lagrangian relaxation. Association of Computing Machinery. 2001;274-296.
17. Johnson E., Padberg M. A note on the knapsack problem with special ordered sets. Operations Research Letters. 1:1981;18-22.
18. Keenan P. Spatial decision support systems for vehicle routing. Decision Support Systems. 22(1):1998;65-71.
19. Mandell M. Covering models for two-tiered emergency medical service systems. ISOLDE VII, Edmonton, Canada. 1996.
20. Marianov V., Serra D. Hierarchical location-allocation models for congested systems. European Journal of Operational Research. 135:2001;195-208.
21. Narasimhan S. The concentrator location problem with varying coverage. Computer Networks ISDN Systems. 19:1990;1-10.
22. Narasimhan S., Pirkul H., Schilling D. Capacitated emergency facility siting with multiple levels of backup. Annals of Operations Research. 40:1992;235-248.
23. Narula S. Hierarchical location-allocation problems: A classification scheme. European Journal of Operational Research. 15:1984;93-99.
24. Narula S. Minisum hierarchical location-allocation problems on a network. Annals of Operations Research. 6:1986;257-272.
25. Papadimitriou C., Steiglitz K. Combinatorial Optimization: Algorithms and Complexity. 1982;Prentice Hall, Englewood Cliffs, NJ.
26. Pirkul H., Jayaraman V. Production, transportation and distribution planning in a multi-commodity tri-echelon system. Transportation Science. 30(4):1996;291-302.
27. Pirkul H., Schilling D. The maximal covering location problem with capacities on total workload. Management Science. 37(2):1991;233-248.
28. Pirkul H., Gupta R., Rolland E. VisOpt: A visual interactive optimization tool for P-median problems. Decision Support Systems. 26(3):1999;209-223.
29. Schilling D., Jayaraman V., Barkhi R. A review of covering problem in facility location. Location Science. 1:1993;25-55.
30. Serra D. The coherent covering location problem. The Journal of RSAI. 75(1):1996;79-101.
31. Serra D., ReVelle C. The pq-medial problem: Location and districting of hierarchical facilities. Location Science. 1(4):1993;299-312.
32. Serra D., ReVelle C. The pq-medial problem: Location and districting of hierarchical facilities - II. Location Science. 2(1):1994;63-82.
33. Simpson N., Erenguc S. Modeling the order picking function in supply chain systems: Formulation, experimentation and insights. IIE Transactions. 33:2001;119-130.
34. Sprague R.H., Carlson E.D. Building Effective Decision Support Systems. 1982;Prentice Hall, Englewood Cliffs, NJ.
35. Tien J.M., El-Tell K., Simons G.R. Improved formulations to the Hierarchical health facility location-allocation problems. IEEE Transactions on Systems, Man, and Cybernetics. 13:1983;1128-1132.
36. Tracey M., Dror M. Interactive graphical computer application for large scale cattle feed distribution management. Decision Support Systems. 19:1997;61-72.