On the time-consistent stochastic dominance risk averse measure for tactical supply chain planning under uncertainty

被引:13
|
作者
Escudero, Laureano F. [1 ]
Francisco Monge, Juan [2 ]
Morales, Dolores Romero [3 ]
机构
[1] Univ Rey Juan Carlos, Estadist & Invest Operativa, Mostoles, Madrid, Spain
[2] Univ Miguel Hernandez, Ctr Invest Operativa, Elche, Alicante, Spain
[3] Copenhagen Business Sch, Frederiksberg, Denmark
关键词
Tactical supply chain planning; Nonlinear separable objective function; Multistage stochastic integer optimization; Risk management; Time-consistency; Stochastic nested decomposition; DECOMPOSITION; MODELS; OPTIMIZATION; PROGRAMS; CONSTRAINTS; DEFINITION; GENERATION; ALGORITHM; DECISIONS;
D O I
10.1016/j.cor.2017.07.011
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this work a modeling framework and a solution approach have been presented for a multi-period stochastic mixed 0-1 problem arising in tactical supply chain planning (TSCP). A multistage scenario tree based scheme is used to represent the parameters' uncertainty and develop the related Deterministic Equivalent Model. A cost risk reduction is performed by using a new time-consistent risk averse measure. Given the dimensions of this problem in real-life applications, a decomposition approach is proposed. It is based on stochastic dynamic programming (SDP). The computational experience is twofold, a comparison is performed between the plain use of a current state-of-the-art mixed integer optimization solver and the proposed SDP decomposition approach considering the risk neutral version of the model as the subject for the benchmarking. The add-value of the new risk averse strategy is confirmed by the computational results that are obtained using SDP for both versions of the TSCP model, namely, risk neutral and risk averse. (C) 2017 Elsevier Ltd. All rights reserved.
引用
收藏
页码:270 / 286
页数:17
相关论文
共 50 条
  • [1] On preparedness resource allocation planning for natural disaster relief under endogenous uncertainty with time-consistent risk-averse management
    Escudero, Laureano E.
    Araceli Garin, M.
    Monge, Juan F.
    Unzueta, Aitziber
    COMPUTERS & OPERATIONS RESEARCH, 2018, 98 : 84 - 102
  • [2] Time-consistent approximations of risk-averse multistage stochastic optimization problems
    Tsvetan Asamov
    Andrzej Ruszczyński
    Mathematical Programming, 2015, 153 : 459 - 493
  • [3] Time-consistent approximations of risk-averse multistage stochastic optimization problems
    Asamov, Tsvetan
    Ruszczynski, Andrzej
    MATHEMATICAL PROGRAMMING, 2015, 153 (02) : 459 - 493
  • [4] Tactical supply chain planning for a forest biomass power plant under supply uncertainty
    Shabani, Nazanin
    Sowlati, Taraneh
    Ouhimmou, Mustapha
    Roennqvist, Mikael
    ENERGY, 2014, 78 : 346 - 355
  • [5] Risk Management for a Global Supply Chain Planning Under Uncertainty: Models and Algorithms
    You, Fengqi
    Wassick, John M.
    Grossmann, Ignacio E.
    AICHE JOURNAL, 2009, 55 (04) : 931 - 946
  • [6] Risk-averse stochastic programming approach for microgrid planning under uncertainty
    Narayan, Apurva
    Ponnambalam, Kumaraswamy
    RENEWABLE ENERGY, 2017, 101 : 399 - 408
  • [7] Multistage stochastic programming for the closed-loop supply chain planning with mobile modules under uncertainty
    Ge, Congqin
    Zhang, Lifeng
    Yang, Wenhui
    Yuan, Zhihong
    AICHE JOURNAL, 2023, 69 (09)
  • [8] Tactical supply chain planning after mergers under uncertainty with an application in oil and gas
    Alnaqbi, A.
    Trochu, J.
    Dweiri, F.
    Chaabane, A.
    COMPUTERS & INDUSTRIAL ENGINEERING, 2023, 179
  • [9] A hybrid scenario cluster decomposition algorithm for supply chain tactical planning under uncertainty
    Zanjani, Masoumeh Kazemi
    Bajgiran, Omid Sanei
    Nourelfath, Mustapha
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 252 (02) : 466 - 476
  • [10] Stochastic Programming for Global Supply Chain Planning Under Uncertainty: An Outline
    Fan, Yingjie
    Schwartz, Frank
    Voss, Stefan
    Woodruff, David L.
    COMPUTATIONAL LOGISTICS, ICCL 2017, 2017, 10572 : 437 - 451