An enhanced sample average approximation method for stochastic optimization

被引:47
|
作者
Emelogu, Adindu [1 ]
Chowdhury, Sudipta [1 ]
Marufuzzaman, Mohammad [1 ]
Bian, Linkan [1 ]
Eksioglu, Burak [2 ]
机构
[1] Mississippi State Univ, Dept Ind & Syst Engn, Starkville, MS 39759 USA
[2] Clemson Univ, Dept Ind Engn, Clemson, SC 29634 USA
关键词
Sample average approximation; K-means; K-means plus; K-meansll; Fuzzy C-means; Facility location problem; Scenario clustering; FUZZY C-MEANS; FACILITY LOCATION; BOUND ALGORITHM; PROGRAMMING APPROACH; DESIGN; MODELS; SIZE; DECOMPOSITION; SEARCH;
D O I
10.1016/j.ijpe.2016.08.032
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Choosing the appropriate sample size in Sample Average Approximation (SAA) method is very challenging. Inappropriate sample size can lead to the generation of low quality solutions with high computational burden. To overcome this challenge, our study proposes an enhanced SAA algorithm that utilizes clustering techniques to dynamically update the sample sizes and offers high quality solutions in a reasonable amount of time. We evaluate this proposed algorithm in the context of a facility location problem [FLP]. A number of numerical experiments (e.g., impact of different clustering techniques, fixed vs. dynamic clusters) are performed for various problem instances to illustrate the effectiveness of the proposed method. Results indicate that on average, enhanced SAA with fixed clustering size and dynamic clustering size solves [FLP] almost 631% and 699% faster than the basic SAA algorithm, respectively. Furthermore, it is observed that there is no single winner among the clustering techniques to solve all the problem instances of enhanced SAA algorithm and the performance is highly impacted by the size of the problems. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:230 / 252
页数:23
相关论文
共 50 条
  • [1] The sample average approximation method for stochastic discrete optimization
    Kleywegt, AJ
    Shapiro, A
    Homem-De-Mello, T
    [J]. SIAM JOURNAL ON OPTIMIZATION, 2001, 12 (02) : 479 - 502
  • [2] SAMPLE AVERAGE APPROXIMATION METHOD FOR COMPOUND STOCHASTIC OPTIMIZATION PROBLEMS
    Ermoliev, Yuri M.
    Norkin, Vladimir I.
    [J]. SIAM JOURNAL ON OPTIMIZATION, 2013, 23 (04) : 2231 - 2263
  • [3] THE SAMPLE AVERAGE APPROXIMATION METHOD FOR MULTI-OBJECTIVE STOCHASTIC OPTIMIZATION
    Kim, Sujin
    Ryu, Jong-hyun
    [J]. PROCEEDINGS OF THE 2011 WINTER SIMULATION CONFERENCE (WSC), 2011, : 4021 - 4032
  • [4] SAMPLE COMPLEXITY OF SAMPLE AVERAGE APPROXIMATION FOR CONDITIONAL STOCHASTIC OPTIMIZATION
    Hu, Yifan
    Chen, Xin
    He, Niao
    [J]. SIAM JOURNAL ON OPTIMIZATION, 2020, 30 (03) : 2103 - 2133
  • [5] Stochastic Multiobjective Optimization: Sample Average Approximation and Applications
    Jörg Fliege
    Huifu Xu
    [J]. Journal of Optimization Theory and Applications, 2011, 151 : 135 - 162
  • [6] Stochastic Multiobjective Optimization: Sample Average Approximation and Applications
    Fliege, Joerg
    Xu, Huifu
    [J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2011, 151 (01) : 135 - 162
  • [7] A smoothing sample average approximation method for stochastic optimization problems with CVaR risk measure
    Fanwen Meng
    Jie Sun
    Mark Goh
    [J]. Computational Optimization and Applications, 2011, 50 : 379 - 401
  • [8] A SAMPLE AVERAGE APPROXIMATION METHOD BASED ON A GAP FUNCTION FOR STOCHASTIC MULTIOBJECTIVE OPTIMIZATION PROBLEMS
    Zhao, Yong
    Chen, Lin
    Yang, Xinmin
    [J]. PACIFIC JOURNAL OF OPTIMIZATION, 2021, 17 (04): : 681 - 694
  • [9] Scaling up the sample average approximation method for Stochastic optimization with applications to trading agents
    Greenwald, Amy
    Guillemette, Bryan
    Naroditskiy, Victor
    Tschantz, Michael
    [J]. AGENT-MEDIATED ELECTRONIC COMMERCE: DESIGNING TRADING AGENTS AND MECHANISMS, 2006, 3937 : 187 - 199
  • [10] A smoothing sample average approximation method for stochastic optimization problems with CVaR risk measure
    Meng, Fanwen
    Sun, Jie
    Goh, Mark
    [J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2011, 50 (02) : 379 - 401