Solving large-scale maximum expected covering location problems by genetic algorithms: A comparative study

European Journal of Operational Research

Volumn 141, Issue 3, 2002, Pages 480-494

  Aytug, Haldun ^a   Saydam, Cem ^b  

^a UNIVERSITY OF FLORIDA   (United States)

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

Author keywords

Genetic algorithms; Integer programming; Location

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC METHODS; LINEAR PROGRAMMING; PROBLEM SOLVING;

SET COVERING LOCATION PROBLEMS (SCLP);

OPERATIONS RESEARCH;

EID: 0037120616     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(01)00260-0     Document Type: Article

References (34)

1. Anderson E.J., Ferris M.C. Genetic algorithms for combinatorial optimization: The assembly line balancing problem. ORSA Journal on Computing. 6(2):1994;161-173.
2. Aytug H., Koehler G.J., Snowdon J.L. Genetic learning of dynamic scheduling within a simulation environment. Computers & Operations Research. 21(8):1994;909-925.
3. Aytug H., Koehler G.J. Stopping criteria for finite length genetic algorithms. ORSA Journal on Computing. 8(2):1996;183-191.
4. Aytug H., Bhattacharyya S., Koehler G.J., Snowdon J.L. A review of machine learning in scheduling. IEEE Transactions on Engineering Management. 41(2):1994;165-171.
5. Batta R., Dolan J.M., Krishnamurthy N.N. The maximal expected covering location problem: revisited. Transportation Science. 23:1989;277-287.
6. Bean J.C. Genetic algorithms and random keys for sequencing and optimization. INFORMS Journal on Computing. 6(2):1994;154-160.
7. Beasley J.E., Chu P.C. A genetic algorithm for the set covering problem. European Journal of Operational Research. 94:1996;392-404.
8. Bennett K., Ferris M.C., Ioannidis Y.E. 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;400-407.
9. Church R., ReVelle C. The maximal covering location problem. Papers of the Regional Science Association. 32:1974;101-118.
10. Cleveland G.A., Smith S.F. Using genetic algorithms to schedule flow shop releases. Proceedings of the Third International Conference on Genetic Algorithms. 1989;160-169.
11. CPLEX (1995) Using the CPLEX Callable Library, CPLEX Optimization, Inc., Incline Village, NV.
12. Daskin M.S. Application of an expected covering location model to emergency medical service system design. Decision Sciences. 13:1982;416-439.
13. Daskin M.S. A maximal expected covering location model: Formulation properties and heuristic solution. Transportation Science. 17:1983;48-69.
14. Daskin M.S., Hogan K., ReVelle C. Integration of multiple excess backup and expected covering models. Environment and Planning B: Planning and Design. 15:1988;15-35.
15. Desrochers M., Marcotte P. The congested facility location problem. Location Science. 3(1):1995;9-32.
16. Gendreau M., LaPorte G., Semet F. Solving an ambulance location model by tabu search. Location Science. 5:1997;75-88.
17. Goldberg D.E. Genetic Algorithms in Search, Optimization and Machine Learning. 1989;Addison-Wesley, New York.
18. Hogan K., ReVelle C. Concepts and applications of backup coverage. Management Science. 32:1986;1435-1444.
19. Holland H.J. Adaptation in Natural and Artificial Systems. 1975;University of Michigan Press, Ann Arbor.
20. Houck C.R., Joines J.A., Kay M.G. Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems. Computers & Operations Research. 23(6):1996;587-596.
21. Larson R.C. A hypercube queuing model for facility location and redistricting in urban emergency services. Computers & Operations Research. 1:1974;67-95.
22. Marianov V., ReVelle C. The queuing maximal availability location problem: A model for the siting of emergency vehicles. European Journal of Operations Research. 93:1996;110-120.
23. Michalewicz Z. Genetic Algorithms + Data Structures = Evolution Programs. 1996;Springer, Berlin.
24. Owen S.H., Daskin M.S. Strategic facility location: A review. European Journal of Operational Research. 111:1998;423-447.
25. Repede J., Bernardo J. Developing and validating a decision support system for locating emergency vehicles in Louisville, Kentucky. European Journal of Operational Research. 75:1994;567-581.
26. ReVelle C., Bigman D., Schilling D., Cohon J., Church R. Facility location: A review of context free and EMS models. Health Services Research. 12:1977;129-146.
27. ReVelle C. Review, extension and prediction in emergency siting models. European Journal of Operational Research. 40:1989;58-69.
28. ReVelle C., Hogan K. The maximum availability location problem. Transportation Science. 23:1989;192-200.
29. 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;191-197.
30. Saydam C., Repede J., Burwell T. Accurate estimation of expected coverage: a comparative study. Socio-Economic Planning Sciences. 28(2):1994;113-120.
31. Saydam C., McKnew M. A Separable programming approach to expected coverage: An application to ambulance location. Decision Sciences. 16:1985;381-398.
32. Schilling D.A., Jayaraman V., Barkhi R. A review of covering problems in facility location. Location Science. 1(1):1993;25-55.
33. Toregas C., Swain R., ReVelle C., Bergman L. The location of emergency service facilities. Operations Research. 19:1971;1363-1373.
34. Whitley D., Starkweather T., Fuquay D.A. Scheduling problems and traveling salesman: The genetic edge recombination operator. Proceedings of the Third International Conference on Genetic Algorithms, George Mason University. 1989;133-140.