Novel formulation and efficient solution strategy for strategic optimization of an industrial chemical supply chain under demand uncertainty

被引:4
作者
McLean, Kyle [1 ]
Ogbe, Emmanuel [1 ]
Li, Xiang [1 ]
机构
[1] Queens Univ, Dept Chem Engn, Kingston, ON K7L 3N6, Canada
关键词
supply chain; uncertainty; stochastic programming; robust scenario formulation; Benders decomposition; DECOMPOSITION;
D O I
10.1002/cjce.22173
中图分类号
TQ [化学工业];
学科分类号
0817 ;
摘要
This paper is concerned with strategic optimization of a typical industrial chemical supply chain, which involves a material purchase and transportation network, several manufacturing plants with on-site material and product inventories, a product transportation network, and several regional markets. In order to address large uncertainties in customer demands at the different regional markets, a novel robust scenario formulation, which has been recently developed by the authors, is tailored and applied for strategic optimization. Case study results show that the robust scenario formulation works well for this real industrial supply chain system, and it outperforms the deterministic formulation and the classical scenario-based stochastic programming formulation by generating better expected economic performance and solutions that are guaranteed to be feasible for all uncertainty realizations. The robust scenario problem exhibits a decomposable structure that can be taken advantage of by Benders decomposition for efficient solution, so the application of Benders decomposition to the solution of the strategic optimization is also discussed. The case study results show that Benders decomposition can reduce the solution time by almost an order of magnitude when the number of scenarios in the problem is large.
引用
收藏
页码:971 / 985
页数:15
相关论文
共 27 条
  • [1] [Anonymous], GAMS USERS MANUAL
  • [2] Uncertainties and sustainability concepts in biofuel supply chain management: A review
    Awudu, Iddrisu
    Zhang, Jun
    [J]. RENEWABLE & SUSTAINABLE ENERGY REVIEWS, 2012, 16 (02) : 1359 - 1368
  • [3] Branch-and-price: Column generation for solving huge integer programs
    Barnhart, C
    Johnson, EL
    Nemhauser, GL
    Savelsbergh, MWP
    Vance, PH
    [J]. OPERATIONS RESEARCH, 1998, 46 (03) : 316 - 329
  • [4] BENDERS JF, 1962, NUMER MATH, V4, P238, DOI [DOI 10.1007/BF01386316, DOI 10.1007/S10287-004-0020-Y]
  • [5] BenTal A, 2009, PRINC SER APPL MATH, P1
  • [6] Robust linear optimization under general norms
    Bertsimas, D
    Pachamanova, D
    Sim, M
    [J]. OPERATIONS RESEARCH LETTERS, 2004, 32 (06) : 510 - 516
  • [7] Birge JR, 2011, SPRINGER SER OPER RE, P3, DOI 10.1007/978-1-4614-0237-4
  • [8] Dual decomposition in stochastic integer programming
    Caroe, CC
    Schultz, R
    [J]. OPERATIONS RESEARCH LETTERS, 1999, 24 (1-2) : 37 - 45
  • [9] DECOMPOSITION PRINCIPLE FOR LINEAR-PROGRAMS
    DANTZIG, GB
    WOLFE, P
    [J]. OPERATIONS RESEARCH, 1960, 8 (01) : 101 - 111
  • [10] Eksioglu D. S., 2009, COMPUT IND ENG, P1342