Multi-period descriptive sampling for scenario generation applied to the stochastic capacitated lot-sizing problem

被引:0
|
作者
Stadtler, Hartmut [1 ]
Heinrichs, Nikolai [2 ]
机构
[1] Univ Hamburg, Inst Logist & Transport, Moorweiden str 18, D-20148 Hamburg, Germany
[2] Univ Hamburg, Inst Logist Transport & Prod, Moorweiden str 18, D-20148 Hamburg, Germany
关键词
Scenario generation; Stochastic lot-sizing; Service level constraints; Sample average approximation; APPROXIMATIONS; STRATEGY; DEMAND; MODELS;
D O I
10.1007/s00291-023-00743-x
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Using scenarios to model a stochastic system's behavior poses a dilemma. While a large(r) set of scenarios usually improves the model's accuracy, it also causes drastic increases in the model's size and the computational effort required. Multi-period descriptive sampling (MPDS) is a new way to generate a small(er) set of scenarios that yield a good fit both to the periods' probability distributions and to the convoluted probability distributions of stochastic variables (e.g., period demands) over time. MPDS uses descriptive sampling to draw a sample of S representative random numbers from a period's known (demand) distribution. Now, to create a set of S representative scenarios, MPDS heuristically combines these random numbers (period demands) period by period so that a good fit is achieved to the convoluted (demand) distributions up to any period in the planning interval. A further contribution of this paper is an (accuracy) improvement heuristic, called fine-tuning, executed once the fix-and-optimize (FO) heuristic to solve a scenario-based mixed integer programming model has been completed. Fine-tuning uses linear programming (LP) with fixed binary variables (e.g., setup decisions) generated by FO and iteratively adapts production quantities so that compliance with given expected service level constraints is reached. The LP is solved with relatively little computational effort, even for large(r) sets of scenarios. We show the advancements possible with MPDS and fine-tuning by solving numerous test instances of the stochastic capacitated lot-sizing problem under a static uncertainty approach.
引用
收藏
页码:639 / 668
页数:30
相关论文
共 50 条
  • [21] A memetic algorithm for a multistage capacitated lot-sizing problem
    Berretta, R
    Rodrigues, LF
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2004, 87 (01) : 67 - 81
  • [22] Solving the capacitated lot-sizing problem with backorder consideration
    Cheng, CH
    Madan, MS
    Gupta, Y
    So, S
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2001, 52 (08) : 952 - 959
  • [23] Partial objective inequalities for the multi-item capacitated lot-sizing problem
    Buyuktahtakin, I. Esra
    Smith, J. Cole
    Hartman, Joseph C.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2018, 91 : 132 - 144
  • [24] Heuristics for the multi-item capacitated lot-sizing problem with lost sales
    Absi, Nabil
    Detienne, Boris
    Dauzere-Peres, Stephane
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (01) : 264 - 272
  • [25] A heuristic approach for a multi-product capacitated lot-sizing problem with pricing
    Gonzalez-Ramirez, Rosa G.
    Smith, Neale R.
    Askin, Ronald G.
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2011, 49 (04) : 1173 - 1196
  • [26] Analysis of Lagrangian decomposition for the multi-item capacitated lot-sizing problem
    Thizy, J.-M.
    [J]. INFOR Journal (Canadian Journal of Operational Research and Information Processing), 1991, 29 (04):
  • [27] Solving to Optimality a Discrete Lot-Sizing Problem Thanks to Multi-product Multi-period Valid Inequalities
    Gicquel, Celine
    Minoux, Michel
    [J]. OPERATIONS RESEARCH AND ENTERPRISE SYSTEMS, ICORES 2014, 2015, 509 : 237 - 250
  • [28] Lead time considerations for the multi-level capacitated lot-sizing problem
    Almeder, Christian
    Klabjan, Diego
    Traxler, Renate
    Almada-Lobo, Bernardo
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 241 (03) : 727 - 738
  • [29] Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing
    Cunha, Jesus O.
    Kramer, Hugo H.
    Melo, Rafael A.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2019, 104 : 149 - 158
  • [30] Multi-period lot-sizing with supplier selection using achievement scalarizing functions
    Ustun, Ozden
    Demirtas, Ezgi Aktar
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2008, 54 (04) : 918 - 931