.png){kind=icon}
.png){kind=icon}
Return
A comparative study of decomposition algorithms for stochastic combinatorial optimization
.png){kind=icon}
PRE
AI
DOI：10.1007/s10589-007-9085-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents comparative computational results using three decomposition algorithms on a battery of instances drawn from two different applications. In order to preserve the commonalities among the algorithms in our experiments, we have designed a testbed which is used to study instances arising in server location under uncertainty and strategic supply chain planning under uncertainty. Insights related to alternative implementation issues leading to more efficient implementations, benchmarks for serial processing, and scalability of the methods are also presented. The computational experience demonstrates the promising potential of the disjunctive decomposition (D-2) approach towards solving several large-scale problem instances from the two application areas. Furthermore, the study shows that convergence of the D-2 methods for stochastic combinatorial optimization (SCO) is in fact attainable since the methods scale well with the number of scenarios.
Keywords:
stochastic mixed-integer programming
disjunctive decomposition
stochastic server location
strategic supply chain planning
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
2
Papers:
68
Citations:
3.5K