.png){kind=icon}
返回
Hybrid algorithm for discrete event simulation based supply chain optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2009.07.039.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Supply chain optimization, as a key determinant of strategic resources mobility along the value-added chain, allows each participant in the global network to capitalize on its particular strategic competency. Simulation is widely used to test the impact on supply chain performance for the strategic level decisions, such as the number of plants, the modes of transport, or the relocation of warehouses. However, the complexity of supply chain optimization problem and the stochastic nature of simulation cause the unaffordable computational load: the evaluation of a large number of alternatives for supply chain optimization is in a class of NP-hard problem and the number of simulation replications is required for accurately evaluating the performance of each alternative. The objective of the present work is to propose hybrid algorithm with the application of the nested partitioning (NP) method and the optimal computing budget allocation (OCBA) method to reduce the computational load, hence, to improve the efficiency of supply chain optimization via discrete event simulation. The NP method is a global sampling strategy that is continuously adapted via a partitioning of the feasible solution region. The number of candidate alternatives to be evaluated can be reduced by the application of NP. The OCBA method minimizes the number of samples (simulation replications) required to evaluate a particular alternative by allocating computing resources to potentially critical alternative. Carefully designed experiments show extensive numerical result to illustrate the benefits of the proposed approach. (C) 2009 Elsevier Ltd. All rights reserved.
Keyword:
Supply chain optimization
Simulation
Nested partitioning
Optimal computing budget allocation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
