Developing effective meta-heuristics for a probabilistic location model via experimental design
暂无分享,去创建一个
Cem Saydam | Jing Xiao | F. Elizabeth Vergara | Hari K. Rajagopalan | C. Saydam | F. E. Vergara | Jing Xiao
[1] Peter Norvig,et al. Artificial Intelligence: A Modern Approach , 1995 .
[2] Gilbert Laporte,et al. Ambulance location and relocation models , 2000, Eur. J. Oper. Res..
[3] Mark S. Daskin,et al. Strategic facility location: A review , 1998, Eur. J. Oper. Res..
[4] Reza Barkhi,et al. A REVIEW OF COVERING PROBLEMS IN FACILITY LOCATION. , 1993 .
[5] J. Beasley,et al. A genetic algorithm for the set covering problem , 1996 .
[6] Gilbert Laporte,et al. Metaheuristics: A bibliography , 1996, Ann. Oper. Res..
[7] Fred W. Glover,et al. Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..
[8] Cem Saydam,et al. Solving large-scale maximum expected covering location problems by genetic algorithms: A comparative study , 2002, Eur. J. Oper. Res..
[9] Cem Saydam,et al. Accurate estimation of expected coverage: revisited , 2003 .
[10] Mark S. Daskin,et al. A Maximum Expected Covering Location Model: Formulation, Properties and Heuristic Solution , 1983 .
[11] Mark S. Daskin,et al. APPLICATION OF AN EXPECTED COVERING MODEL TO EMERGENCY MEDICAL SERVICE SYSTEM DESIGN , 1982 .
[12] Richard L. Church,et al. The Team/Fleet Models for Simultaneous Facility and Equipment Siting , 1979 .
[13] Cem Saydam,et al. Accurate estimation of expected coverage: A comparative study , 1994 .
[14] Reinaldo Morabito,et al. Towards unified formulations and extensions of two classical probabilistic location models , 2005, Comput. Oper. Res..
[15] Michael O. Ball,et al. A Reliability Model Applied to Emergency Service Vehicle Location , 1993, Oper. Res..
[16] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[17] Zbigniew Michalewicz,et al. An evolutionary algorithm for optimizing material flow in supply chains , 2002 .
[18] Haldun Aytug,et al. Use of genetic algorithms to solve production and operations management problems: A review , 2003 .
[19] Mauricio G. C. Resende,et al. Designing and reporting on computational experiments with heuristic methods , 1995, J. Heuristics.
[20] M. J. Norušis,et al. SPSS 13.0 Guide to Data Analysis , 2000 .
[21] Zbigniew Michalewicz,et al. Genetic Algorithms + Data Structures = Evolution Programs , 2000, Springer Berlin Heidelberg.
[22] Michel Gendreau,et al. A dynamic model and parallel tabu search heuristic for real-time ambulance relocation , 2001, Parallel Comput..
[23] Rajan Batta,et al. On the use of genetic algorithms to solve location problems , 2002, Comput. Oper. Res..
[24] G Laporte,et al. TABU SEARCH ALGORITHMS FOR THE (R/XP)-MEDIANOID AND (R/P)-CENTROID PROBLEMS , 1994 .
[25] J. Beasley. Lagrangean heuristics for location problems , 1993 .
[26] Richard L. Church,et al. The maximal covering location problem , 1974 .
[27] Gilbert Laporte,et al. Fast heuristics for large scale covering-location problems , 2002, Comput. Oper. Res..
[28] RICHARD C. LARSON,et al. A hypercube queuing model for facility location and redistricting in urban emergency services , 1974, Comput. Oper. Res..
[29] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[30] Dr. Zbigniew Michalewicz,et al. How to Solve It: Modern Heuristics , 2004 .
[31] Charles S. ReVelle,et al. The Maximum Availability Location Problem , 1989, Transp. Sci..
[32] Gilbert Laporte,et al. Solving an ambulance location model by tabu search , 1997 .
[33] Charles S. ReVelle,et al. The Location of Emergency Service Facilities , 1971, Oper. Res..
[34] Fernando Y. Chiyoshi,et al. A statistical analysis of simulated annealing applied to the p-median problem , 2000, Ann. Oper. Res..