Facility Location: A Robust Optimization Approach

被引:140
作者
Baron, Opher [1 ]
Milner, Joseph [1 ]
Naseraldin, Hussein [2 ]
机构
[1] Univ Toronto, Rotman Sch Management, Toronto, ON M5S 3E6, Canada
[2] ORT Braude Coll Engn, Dept Ind Engn & Management, IL-21982 Karmiel, Israel
关键词
facility location; robust optimization; uncertainty; robust counterpart; MODEL; ALGORITHMS;
D O I
10.3401/poms.1080.01194
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this research, we apply robust optimization (RO) to the problem of locating facilities in a network facing uncertain demand over multiple periods. We consider a multi-period fixed-charge network location problem for which we find (1) the number of facilities, their location and capacities, (2) the production in each period, and (3) allocation of demand to facilities. Using the RO approach we formulate the problem to include alternate levels of uncertainty over the periods. We consider two models of demand uncertainty: demand within a bounded and symmetric multi-dimensional box, and demand within a multi-dimensional ellipsoid. We evaluate the potential benefits of applying the RO approach in our setting using an extensive numerical study. We show that the alternate models of uncertainty lead to very different solution network topologies, with the model with box uncertainty set opening fewer, larger facilities. Through sample path testing, we show that both the box and ellipsoidal uncertainty cases can provide small but significant improvements over the solution to the problem when demand is deterministic and set at its nominal value. For changes in several environmental parameters, we explore the effects on the solution performance.
引用
收藏
页码:772 / 785
页数:14
相关论文
共 34 条
[1]   A robust optimization approach to dynamic pricing and inventory control with no backorders [J].
Adida, E ;
Perakis, G .
MATHEMATICAL PROGRAMMING, 2006, 107 (1-2) :97-129
[2]  
Averbakh I., 1997, Location Science, V5, P247, DOI 10.1016/S0966-8349(98)00033-3
[3]   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
[4]   Minmax regret median location on a network under uncertainty [J].
Averbakh, I ;
Berman, O .
INFORMS JOURNAL ON COMPUTING, 2000, 12 (02) :104-110
[5]  
Ben T.A., 2000, Applied Optimization, P303
[6]   Robust convex optimization [J].
Ben-Tal, A ;
Nemirovski, A .
MATHEMATICS OF OPERATIONS RESEARCH, 1998, 23 (04) :769-805
[7]   Retailer-supplier flexible commitments contracts: A robust optimization approach [J].
Ben-Tal, Aharon ;
Golany, Boaz ;
Nemirovski, Arkadi ;
Vial, Jean-Philippe .
Manufacturing and Service Operations Management, 2005, 7 (03) :248-271
[8]   Robust solutions of uncertain linear programs [J].
Ben-Tal, A ;
Nemirovski, A .
OPERATIONS RESEARCH LETTERS, 1999, 25 (01) :1-13
[9]  
BenTal A, 2009, PRINC SER APPL MATH, P1
[10]  
Berman O, 2006, INFOR, V44, P267