Accurate estimation of expected coverage: Revisited

Socio-Economic Planning Sciences

Volumn 37, Issue 1, 2003, Pages 69-80

  Saydam, Cem ^a   Aytuǧ, Haldun ^b  

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

^b UNIVERSITY OF FLORIDA   (United States)

Author keywords

Genetic algorithms; Integer programming; Location

Indexed keywords

ESTIMATION METHOD;

EID: 0037355432     PISSN: 00380121     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0038-0121(02)00004-6     Document Type: Article

References (32)

1. Daskin MS. Network and discrete location. New York: Wiley, Inc., 1995.
2. Owen SH, Daskin MS. Strategic facility location: a review. European Journal of Operational Research 1998;111:423-47.
3. Zaki AS, Cheng HK, Parker BR. A simulation model for the analysis and management of an emergency service system. Socio-Economic Planning Science 1997;31(3):173-89.
4. ReVelle C. Review, extension and prediction in emergency siting models. European Journal of Operational Research 1989;40:58-69.
5. Schilling DA, Jayaraman V, Barkhi R. A review of covering problems in facility location. Location Science 1993;1(1):25-55.
6. Mirchandani PB, Fracis RL. Discrete location theory. New York: Wiley, 1990.
7. Toregas C, Swain R, ReVelle C, Bergman L. The location of emergency service facilities. Operations Research 1971;19:1363-73.
8. Church R, ReVelle C. The maximal covering location problem. Papers of the Regional Science Association 1974;32:101-18.
9. Hogan K, ReVelle C. Concepts and applications of backup coverage. Management Science 1986;32:1435-44.
10. Daskin MS. Application of an expected covering location model to emergency medical service system design. Decision Science 1982;13:416-39.
11. Daskin MS. A maximal expected covering location model: formulation, properties, and heuristic solution. Transport Science 1983;17:48-69.
12. Daskin MS, Hogan K, ReVelle C. Integration of multiple excess, backup, and expected covering models. Environment and Planning B 1988;15:15-35.
13. ReVelle C, Hogan K. The maximum availability location problem. Transport Science 1989;23:192-200.
14. Batta R, Dolan JM, Krishnamurthy NN. The maximal expected covering location problem: revisited. Transport Science 1989;23:277-87.
15. Larson RC. Approximating the performance of urban emergency service systems. Operations Research 1975;23:845-68.
16. Saydam C, Repede J, Burwell T. Accurate estimation of expected coverage: a comparative study. Socio-Economic Planning Science 1994;28(2):113-20.
17. Marianov V, ReVelle C. The queuing maximal availability location problem: a model for the siting of emergency vehicles. European Journal of Operational Research 1996;93:110-20.
18. Holland HJ. Adaptation in natural and artificial systems. Ann Arbor: University of Michigan Press, 1975.
19. Larson RC. A hypercube queuing model for facility location and redistricting in urban emergency services. Computers and Operations Research 1974;1:67-95.
20. Goldberg DE. Genetic algorithms in search, optimization and machine learning. New York: Addison Wesley, 1989.
21. Houck CR, Joines JA, Kay MG. Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems. Computers and Operations Research 1996;23(6):587-96.
22. Aytug H, Koehler GJ, Snowdon JL. Genetic learning of dynamic scheduling within a simulation environment. Computers and Operations Research 1994;21(8):909-25.
23. Cleveland GA, Smith SF. Using genetic algorithms to schedule flow shop releases. Proceedings of the Third International Conference on Genetic Algorithms, 1989. p. 160-9.
24. Whitley D, Starkweather T, Fuquay DA. Scheduling problems and traveling salesman: the genetic edge recombination operator. Proceedings of the Third International Conference on Genetic Algorithms, George Mason University, 1989. p. 133-40.
25. Bennett K, Ferris MC, Ioannidis YE. A genetic algorithm for database query optimization. Proceedings of the Fourth International Conference on Genetic Algorithms, University of California, San Diego, July 13-16, 1991. p. 400-7.
26. Aytug H, Bhattacharyya S, Koehler GJ, Snowdon JL. A review of machine learning in scheduling. IEEE Transactions on Engineering Management 1994;41(2):165-71.
27. Beasley JE, Chu PC. A genetic algorithm for the set covering problem. European Journal of Operational Research 1996;94:392-404.
28. Anderson EJ, Ferris MC. Genetic algorithms for combinatorial optimization: the assembly line balancing problem. ORSA Journal on Computing 1994;6(2):161-73.
29. Bean JC. Genetic algorithms and random keys for sequencing and optimization. INFORMS Journal on Computing 1994;6(2):154-60.
30. Richardson J, Palmer M, Liepens G, Hilliard M. Some guidelines for genetic algorithms with penalty functions. Proceedings of the Third International Conference on Genetic Algorithms, 1989, p. 191-7.
31. Aytug H, Koehler GJ. Stopping criteria for finite length genetic algorithms. ORSA Journal on Computing 1996;8(2):183-91.
32. Jarvis JP. Approximating the equilibrium behavior of multi-server loss systems. Management Science 1985;31: 235-9.