2005-12-29Buch DOI: 10.18452/2973
A Comparative Study of Decomposition Algorithms for Stochastic Combinatorial Optimization
This paper presents comparative computational results using three decomposition algorithms on a battery of instances drawn from three 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, strategic supply chain planning under uncertainty, and stochastic bipartitite matching. 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 three 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.
Dateien zu dieser Publikation