Facility location under uncertainty: a review

被引:384
作者
Snyder, LV [1 ]
机构
[1] Lehigh Univ, Dept Ind & Syst Engn, Bethlehem, PA 18015 USA
关键词
D O I
10.1080/07408170500216480
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Plants, distribution centers, and other facilities generally function for years or decades, during which time the environment in which they operate may change substantially. Costs, demands, travel times, and other inputs to classical facility location models may be highly uncertain. This has made the development of models for facility location under uncertainty a high priority for researchers in both the logistics and stochastic/robust optimization communities. Indeed, a large number of the approaches that have been proposed for optimization under uncertainty have been applied to facility location problems. This paper reviews the literature oil stochastic and robust facility location models. Our intent is to illustrate both the rich variety of approaches for optimization under uncertainty that have appeared in the literature and their application to facility location problems. In a few instances for which examples in facility location are not available, we provide examples from the more general logistics literature.
引用
收藏
页码:537 / 554
页数:18
相关论文
共 154 条
[1]   An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming [J].
Alonso-Ayuso, A ;
Escudero, LF ;
Garín, A ;
Ortuño, MT ;
Pérez, G .
JOURNAL OF GLOBAL OPTIMIZATION, 2003, 26 (01) :97-124
[2]  
[Anonymous], J BUS LOGIST
[3]  
[Anonymous], 2004, Production and Operations Analysis
[4]  
Averbakh I., 1997, Location Science, V5, P247, DOI 10.1016/S0966-8349(98)00033-3
[5]   Algorithms for the robust 1-center problem on a tree [J].
Averbakh, I ;
Berman, O .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 123 (02) :292-302
[6]   Complexity of robust single facility location problems on networks with uncertain edge lengths [J].
Averbakh, I .
DISCRETE APPLIED MATHEMATICS, 2003, 127 (03) :505-522
[7]   An improved algorithm for the minmax regret median problem on a tree [J].
Averbakh, I ;
Berman, O .
NETWORKS, 2003, 41 (02) :97-103
[8]   Minmax regret median location on a network under uncertainty [J].
Averbakh, I ;
Berman, O .
INFORMS JOURNAL ON COMPUTING, 2000, 12 (02) :104-110
[9]  
AVERBAKH I, 2003, OPER RES LETT, V27, P57
[10]  
AVERBAKH I, 1997, INFORMS OCT 1997 DAL