.png){kind=icon}
返回
An enhanced sample average approximation method for stochastic optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijpe.2016.08.032.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Sample average approximation
K-means
K-means plus
K-meansll
Fuzzy C-means
Facility location problem
Scenario clustering
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10
论文数:
8.0K
被引数:
3.6W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容