Abstract
Combinatorial optimization problems have applications in a variety of sciences and engineering. In the presence of data uncertainty, these problems lead to stochastic combinatorial optimization problems which result in very large scale combinatorial optimization problems. In this paper, we report on the solution of some of the largest stochastic combinatorial optimization problems consisting of over a million binary variables. While the methodology is quite general, the specific application with which we conduct our experiments arises in stochastic server location problems. The main observation is that stochastic combinatorial optimization problems are comprised of loosely coupled subsystems. By taking advantage of the loosely coupled structure, we show that decomposition-coordination methods provide highly effective algorithms, and surpass the scalability of even the most efficiently implemented backtracking search algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ahmed, S. and Garcia, R. (in press), Dynamic capacity acquisition and assignment under uncertainty, Annals of Operational Research.
Ahmed, S., Tawarmalani, M. and Sahinidis, N.V. (in press), A finite branch and bound algorithm for two-stage stochastic integer programs, Mathematical Programming. http://www.isye.gatech.edu/so/publications/.
Albareda-Sambola, M., van der Vlerk, M.H. and Fernandez, E. (2002), Exact solutions to a class of stochastic generalized assignment problems. Research Report 02A11, SOM, University of Groningen, The Netherlands, http://som.rug.nl.
A. Alonso L.F. Escudero M.T. Ortuńo (2000) ArticleTitleA stochastic 0-1 program based approach for the air traffic flow management problem European Journal of Operations Research 120 47–62 Occurrence Handle10.1016/S0377-2217(98)00381-6
A. Alonso-Ayuso L.F. Escudero A. Garín M.T. Ortuńo G. Perez (2003) ArticleTitleAn approach for strategic supply chain planning under uncertainty based on stochastic 0–1 programming Journal of Global Optimization 26 97–124 Occurrence Handle10.1023/A:1023071216923 Occurrence HandleMR1993105
E. Balas (1979) ArticleTitleDisjunctive programming Annals of Discrete Mathematics 5 3–51 Occurrence HandleMR558566
Barahona, F., Bermon, S., Gunluk, O. and Hood, S. (2001), Robust capacity planning in semiconductor manufacturing. IBM Research Report RC22196, IBM.
J.R. Birge F.V. Louveaux (1997) Introduction to Stochastic Programming Springer New York
W.J. Cook W.H. Cunningham W.R. Pulleyblank A. Schrijver (1998) Combinatorial Optimization John Wiley and Sons New York
Doverspike, R.D. (2003), Private communication.
ILOG, IL. (2000), CPLEX 7.0 Reference Manual, ILOG CPLEX Division, Incline Village, NV.
S. Jorjani C.H. Scott D.L. Woodruff (1995) Selection of an optimal subset of sizes University of California Davis, CA
G. Laporte F.V. Louveaux (1993) ArticleTitleThe integer L-shaped method for stochastic integer programs with complete recourse Operations Research Letters 1 133–142 Occurrence Handle10.1016/0167-6377(93)90002-X
G. Laporte F.V. Louveaux L. Hamme Particlevan (2002) ArticleTitleAn integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands Operations Research 50 415–423 Occurrence Handle10.1287/opre.50.3.415.7751
J. Linderoth S.J. Wright (2003) ArticleTitleDecomposition algorithms for stochastic programming on a computational grid Computational Optimization and Applications 24 207–250 Occurrence Handle10.1023/A:1021858008222
Sen, S. (2003), Algorithms for stochastic mixed-integer programming models. In: Aardal, K., Nemhauser, G. and Weismantel, R. (eds.), Stochastic Integer Programming Handbook, Dordrecht, The Netherlands, Chapter 18. http://www.sie.arizona.edu/MORE/papers/SIPHbook.pdf.
S. Sen R.D. Doverspike S. Cosares (1994) ArticleTitleNetwork planning with random demand Telecommunications Systems 3 11–30 Occurrence Handle10.1007/BF02110042
Sen, S. and Higle, J.L. (2000), The C3 theorem and a D2 algorithm for large scale stochastic integer programming: Set convexification. Stochastic E-Print Series. http://dochost.rz.hu-berlin.de/speps/.
S. Sen J.L. Higle L. Ntaimo (2002) A summary and illustration of disjunctive decomposition with set convexification D.L. Woodruff (Eds) Stochastic Integer Programming and Network Interdiction Models Kluwer Academic Press Dordrecht, The Netherlands
Stougie, L. and van der Vlerk, M.H. (2003), Approximation in stochastic integer programming. Research Report 03A14, SOM, Univ. of Groningen, The Netherlands. http://www.ub.rug.n1/eldoc/som/a/03A14/03A14.pdf.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ntaimo, L., Sen, S. The Million-Variable “March” for Stochastic Combinatorial Optimization. J Glob Optim 32, 385–400 (2005). https://doi.org/10.1007/s10898-004-5910-6
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10898-004-5910-6