The facility location problem with Bernoulli demands

被引:41
作者
Albareda-Sambola, Maria [2 ]
Fernandez, Elena [1 ]
Saldanha-da-Gama, Francisco [3 ,4 ]
机构
[1] Univ Politecn Cataluna, Dept Estadist & Invest Operat, ES-08034 Barcelona, Spain
[2] Univ Politecn Cataluna, Dept Estadist & Invest Operat, Terrassa 08022, Spain
[3] Univ Lisbon, Fac Ciencias, Dept Estat & Invest Operac, P-1749016 Lisbon, Portugal
[4] Univ Lisbon, Ctr Invest Operac, P-1749016 Lisbon, Portugal
来源
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE | 2011年 / 39卷 / 03期
关键词
Location; Stochastic programming; TRAVELING SALESMAN PROBLEM; SUPPLY CHAIN; UNCERTAINTY; NETWORK; ALGORITHM; MODELS; EXTENSION; CUSTOMERS; RETAILER; POLICIES;
D O I
10.1016/j.omega.2010.08.002
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper presents the facility location problem with Bernoulli demands. In this capacitated discrete location stochastic problem the goal is to define an a priori solution for the locations of the facilities and for the allocation of customers to the operating facilities that minimizes the sum of the fixed costs of the open facilities plus the expected value of the recourse function. The problem is formulated as a two-stage stochastic program and two different recourse actions are considered. For each of them, a closed form is presented for the recourse function and a deterministic equivalent formulation is obtained for the case in which the probability of demand is the same for all customers. Numerical results from computational experiments are presented and analyzed. (C) 2010 Elsevier Ltd. All rights reserved.
引用
收藏
页码:335 / 345
页数:11
相关论文
共 37 条
[1]   Exact solutions to a class of stochastic generalized assignment problems [J].
Albareda-Sambola, Maria ;
van der Vlerk, Maarten H. ;
Fernandez, Elena .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 173 (02) :465-487
[2]   Heuristic and lower bound for a stochastic location-routing problem [J].
Albareda-Sambola, Maria ;
Fernandez, Elena ;
Laporte, Gilbert .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 179 (03) :940-955
[3]  
Averbakh I., 1997, Location Science, V5, P247, DOI 10.1016/S0966-8349(98)00033-3
[4]   An improved algorithm for the minmax regret median problem on a tree [J].
Averbakh, I ;
Berman, O .
NETWORKS, 2003, 41 (02) :97-103
[5]   Minmax regret median location on a network under uncertainty [J].
Averbakh, I ;
Berman, O .
INFORMS JOURNAL ON COMPUTING, 2000, 12 (02) :104-110
[6]   The dynamic plant layout problem: Incorporating rolling horizons and forecast uncertainty [J].
Balakrishnan, Jaydeep ;
Cheng, Chun Hung .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2009, 37 (01) :165-177
[7]  
BERLADI P, 2009, EUR J OPER RES, V196, P323
[8]   FINDING THE OPTIMAL A PRIORI TOUR AND LOCATION OF A TRAVELING SALESMAN WITH NONHOMOGENEOUS CUSTOMERS [J].
BERMAN, O ;
SIMCHILEVI, D .
TRANSPORTATION SCIENCE, 1988, 22 (02) :148-154
[9]   Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem [J].
Bianchi, Leonora ;
Campbell, Ann Melissa .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 176 (01) :131-144
[10]   AN OVERVIEW OF REPRESENTATIVE PROBLEMS IN LOCATION RESEARCH [J].
BRANDEAU, ML ;
CHIU, SS .
MANAGEMENT SCIENCE, 1989, 35 (06) :645-674