Hierarchical maximal-coverage location-allocation: Case of generalized search-and-rescue

Computers and Operations Research

Volumn 35, Issue 6, 2008, Pages 1886-1904

  Chan, Yupo ^a   Mahan, Jean M ^b   Chrissis, James W ^c   Drake, David A ^d   Wang, Dong ^e  

^a University of Arkansas at Little Rock   (United States)

^b Transportation Command   (United States)

^c AIR FORCE INSTITUTE OF TECHNOLOGY   (United States)

^d SCIENCE APPLICATIONS INTERNATIONAL CORPORATION   (United States)

^e ARIZONA STATE UNIVERSITY   (United States)

Author keywords

Assignment; Enhanced 911; Location allocation; Maximal coverage facility location; Mutiobjective optimization; Network flow; Primary vs. backup coverage

Indexed keywords

ALGORITHMS; FREQUENCY DOMAIN ANALYSIS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; ONLINE SEARCHING; OPTIMIZATION; PROBLEM SOLVING;

LOCATION-ALLOCATION; MAXIMAL-COVERAGE FACILITY-LOCATION; MUTIOBJECTIVE OPTIMIZATION; NETWORK FLOW;

BASE STATIONS;

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

References (34)

1. Basdemir MM. Locating search and rescue stations in the Aegean and Western Mediterranean regions of Turkey. Master's thesis, Graduate School of Engineering, Air Force Institute of Technology (AU), Wright-Patterson AFB OH, March 2000 (Available from Defense Technical Information Clearinghouse).
2. Cronin T. Severely constrained allocation of a bounded number of transceivers. ARO Report 94-1, Transactions of the Eleventh Army Conference on Applied Mathematics and Computing, Army Research Office, 1994.
3. Mehrez A., Eben-Chaime M., and Brimberg J. Locational analyses of military intelligence ground facilities. Military Operations Research 2 3 (1996) 61-70
4. Nguyen B.U., and Ng K.Y.K. Modeling Canadian search and rescue operations. Military Operations Research 5 1 (2000) 5-16
5. Schilling D., Elzinga D.J., Cohon J., Church R., and ReVelle C.S. The team/fleet models for simultaneous facility and equipment siting. Transportation Science 13 (1979)
6. Tutschku K. Demand-based radio network planning of cellular mobile communication systems. Working Paper, Institute of Computer Science, University of Wurzburg, Wurzburg, Germany, 1997.
7. Whitaker R.M., and Hurley S. On the optimality of facility location for wireless transmission infrastructure. Computers & Industrial Engineering 46 (2004) 171-191
8. Zimmerman J., Hons R., and Muhlenbein H. ENCON: an evolutionary algorithm for the antenna placement problem. Computers & Industrial Engineering 44 (2003) 209-226
9. Daskin M.S. A maximum expected covering location model: formulation, properties and heuristic solution. Transportation Science 17 (1983) 48-49
10. Marianov V., and ReVelle C. The queuing probabilistic location set covering problem and some extensions. Socio-Economic Planning Sciences 28 (1994) 167-178
11. Snyder LV, Daskin MS. Reliability models for facility location: the expected failure cost case. Working Paper, Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, Pennsylvania, 2003.
12. Hogan K., and Revelle C. Concepts and applications of backup coverage. Management Science 32 (1986) 1434-1444
13. Berman O., and Kaplan E.H. Equity maximizing facility location schemes. Transportation Science 24 (1990) 137-144
14. Johnson KE. Frequency assignments for HFDF receivers in a search and rescue network. Master's thesis, School of Engineering, Air Force Institute of Technology (AU), Wright-Patterson AFB OH, March 1990. (Available from Defense Technical Information Clearinghouse).
15. Daniels H.E. The theory of position finding. Journal of the Royal Statistical Society 13 2 (1951) 186-207
16. Borchers B., and Mitchell J.E. An improved branch and bound algorithm for mixed integer nonlinear programs. Computers and Operations Research 21 (1994) 359-367
17. Stubbs RA, Mehrotra S. A branch-and-cut method for 0-1 mixed convex programming. Technical report 96-01, Department of Industrial Engineering, Northwestern University, Evanston, IL, 1996.
18. Church R., Current J., and Storbeck J. A bicriterion maximal covering location formulation which considers the satisfaction of uncovered demand. Decision Sciences 22 (1991) 38-52
19. Narula S.C., and Vassilev V. An interactive algorithm for solving multiple objective integer linear programming problems. European Journal of Operational Research 79 (1994) 443-450
20. Pirkul H., and Schilling D. The capacitated maximal covering location problem with backup service. Annals of Operations Research 18 (1989) 141-154
21. ReVelle C., and Hogan K. The maximum availability location problem. Transportation Science 23 (1989) 192-199
22. Steuer R.E. Multiple criteria optimization: theory, computation, and application (1986), Wiley, New York, NY
23. Chrissis JW. The solution of nonlinear pseudo-Boolean optimization problems subject to linear constraints. Ph.D. Dissertation, Department of Industrial Engineering and Operations Research, Virginia Tech, Blacksburg, VA, 1980.
24. Ahuja R.K., Magnanti T.L., and Orlin J.B. Network flows (1993), Prentice Hall, Englewood Cliffs, New Jersey
25. Sun M. Warm-start routines for solving multiple objective network programming problems. Division of Management and Marketing, College of Business, The University of Texas at San Antonio, vol. 21, No. 2, 2000.
26. Sun M. Procedures for finding nondominated solutions for multiple objective network programming problems. Transportation Science 37 2 (2003) 139-152
27. Yu P.L. Multiple-criteria decision making (1985), Plenum Press, New York
28. Nielsen SS, Zenios SA. Mixed-integer nonlinear programming on generalized networks. Report 89-09-12, Wharton School, University of Pennsylvania, Philadelphia, PA, 1990.
29. Sarker R., Runarsson T., and Newton C. Genetic algorithms for solving a class of constrained nonlinear integer programs. International Transactions in Operational Research 8 (2001) 61-74
30. Batta R., Dolan J.M., and Krishnamurthy N.N. The maximal expected covering location problem: revisited. Transportation Science 23 (1989) 277-287
31. Chamberland S. An efficient heuristic for the expansion problem of cellular wireless networks. Computers & Operations Research 31 (2004) 1769-1791
32. Louveaux F.S., and Thisse J.F. Production and location on a network under demand uncertainty. Operations Research Letters 4 (1985) 145-149
33. Urli B., and Nadeau R. Stochastic MOLIP with incomplete information: an interactive approach with recourse. Journal of the Operational Research Society 41 (1990) 1143-1152
34. Ahuja RK, Magnanti TL, Orlin JB. Networkflows: theory, algorithms, and applications. Englewoods Cliffs, NJ: Prentice Hall; 1993.