Solution approaches for facility location of medical supplies for large-scale emergencies
暂无分享,去创建一个
[1] Rajan Batta,et al. On the use of genetic algorithms to solve location problems , 2002, Comput. Oper. Res..
[2] K. Al-Sultan,et al. A Genetic Algorithm for the Set Covering Problem , 1996 .
[3] Hasan Pirkul,et al. The capacitated maximal covering location problem with backup service , 1990 .
[4] C. Reeves. Modern heuristic techniques for combinatorial problems , 1993 .
[5] N. Megiddo,et al. The Maximum Coverage Location Problem , 1983 .
[6] O. Kariv,et al. An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .
[7] Vladimir Marianov,et al. The Queueing Maximal availability location problem: A model for the siting of emergency vehicles , 1996 .
[8] Mohammad Abdulrahman Al-Fawzan,et al. A tabu search approach to the uncapacitated facility location problem , 1999, Ann. Oper. Res..
[9] Charles S. ReVelle,et al. The Location of Emergency Service Facilities , 1971, Oper. Res..
[10] Bintong Chen,et al. Minmax-regret robust 1-median location on a tree , 1998, Networks.
[11] Fernando Ordóñez,et al. Chapter 11 RAPID DISTRIBUTION OF MEDICAL SUPPLIES , 2005 .
[12] Charles ReVelle,et al. Concepts and applications of backup coverage , 1986 .
[13] Richard L. Church,et al. The Team/Fleet Models for Simultaneous Facility and Equipment Siting , 1979 .
[14] R. A. Whitaker,et al. A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems , 1983 .
[15] Mitsuo Gen,et al. Genetic algorithms and engineering optimization , 1999 .
[16] L. A. Lorena,et al. A surrogate heuristic for set covering problems , 1994 .
[17] Éric D. Taillard,et al. Heuristic Methods for Large Centroid Clustering Problems , 2003, J. Heuristics.
[18] K. Holmberg,et al. A Lagrangean heuristic for the facility location problem with staircase costs , 1997 .
[19] L A N Lorena,et al. Genetic algorithms applied to computationally difficult set covering problems , 1997 .
[20] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[21] Dirk C. Mattfeld,et al. A Computational Study , 1996 .
[22] C. Revelle,et al. A Lagrangean heuristic for the maximal covering location problem , 1996 .
[23] Uwe Aickelin,et al. A genetic algorithm approach for set covering problems , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.
[24] Leon Cooper,et al. Heuristic Methods for Location-Allocation Problems , 1964 .
[25] Søren Kruse Jacobsen,et al. Heuristics for the capacitated plant location model , 1983 .
[26] Mark S. Daskin,et al. Stochastic p-robust location problems , 2006 .
[27] Maged Dessouky,et al. A modeling framework for facility location of medical services for large-scale emergencies , 2007 .
[28] Amin Saberi,et al. A new greedy approach for facility location problems , 2002, STOC '02.
[29] Scott Robert Ladd,et al. Genetic algorithms in C , 1995 .
[30] Mark S. Daskin,et al. Network and Discrete Location: Models, Algorithms and Applications , 1995 .
[31] Bhaba R. Sarker,et al. Discrete location theory , 1991 .
[32] Richard L. Church,et al. The maximal covering location problem , 1974 .
[33] Zvi Drezner,et al. An Efficient Genetic Algorithm for the p-Median Problem , 2003, Ann. Oper. Res..
[34] Lawrence V. Snyder,et al. Facility location under uncertainty: a review , 2006 .