Abstract
The problem of designing high speed networks using different modules of link capacities, in the same model, in order to meet uncertain demands obtained from different probability distribution functions (PDF) is a very hard and challenging real network design problem. The novelty of the new model, compared to previous ones, is to allow installing more than one module per link having equal or different capacities. Moreover, the scenarios of traffic can be generated, according to practical observations, from the main classes of uncertain demands (multi-service) simulated from different PDFs, including heavy tailed ones. These classes of traffic are considered simultaneously for the scenario generation, different from related works in the literature that use only one probability distribution function to simulate the scenarios of traffic. In this work we present the problem formulation and report computational results using branch-and-bound and L-shaped decomposition solution approaches. We consider in the same model up to three different types of modular capacities (multi-facility), since it seems that using more than this can lead to an intractable model. The objective is to minimize penalty (in case of unmet demands) and investment costs. We obtain confidence intervals (with 95% of covering rate) on the expected optimal solution value for the resulting two-stage stochastic integer-modular problem and discuss when they are meaningful. Numerical experiments show that our model can handle up to medium real size instances.
Similar content being viewed by others
References
Ahmed, S., Tawarmalani, M., & Sahinidis, N. V. (2004). A finite branch-and-bound algorithm for two-stage stochastic integer programs. Mathematical Programming, 100(2), 355–377.
Andrade, R., Lisser, A., Maculan, N., & Plateau, G. (2004). Telecommunication network capacity design for uncertain demand. Computational Optimization and Applications, 29(2), 127–146.
Andrade, R., Lisser, A., Maculan, N., & Plateau, G. (2005). B&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty. Annals of Operations Research, 140(17), 49–65.
Andrade, R., Lisser, A., Maculan, N., & Plateau, G. (2006). Enhancing a branch-and-bound algorithm for two-stage stochastic integer network design-based models. Management Science, 52(9), 1450–1455.
Atamtürk, A., & Zhang, M. (2007). Two-stage robust network flow and design under demand uncertainty. Operations Research, 55(4), 662–673.
Davison, A. C., & Hinkley, D. V. (1997). Bootstrap methods and their applications. Cambridge: Cambridge University Press.
Davison, A. C., Hinkley, D. V., & Young, G. A. (2003). Recent developments in bootstrap methodology. Statistical Science, 18(2), 141–157.
Eichhorn, A., & Römisch, W. (2007). Stochastic integer programming: Limit theorems and confidence intervals. Mathematics of Operations Research, 32(1), 118–135.
Gaivoronski, A. (1995). Stochastic programming approach to the network planning under uncertainty. New York: Wiley.
Heitsch, H., & Römisch, W. (2009). Scenario tree modeling for multistage stochastic programs. Mathematical Programming, 118(2), 371–406.
Infanger, G. (1992). Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs. Annals of Operations Research, 39, 69–95.
Jones, K. L., Lustig, I. J., Farvolden, J. M., & Powell, W. B. (1993). Multicommodity network flows: The impact of formulation on decomposition. Mathematical Programming, 62, 95–117.
Karagiannis, T., Molle, M., & Faloutsos, M. (2004). Long-range dependence: Ten years of internet traffic modeling. IEEE Internet Computing, 8, 57–64.
Laporte, G., & Louveaux, F. V. (1993). The integer L-shaped method for stochastic integer programs with complete recourse. Operations Research Letters, 13(3), 133–142.
Mertens, S. (2003) The easiest hard problem: number partitioning (Technical Report). cond-mat/0310317.
Minoux, M. (2010). Robust network optimization under polyhedral demand uncertainty is NP-hard. Discrete Applied Mathematics, 158(5), 597–603.
Nesterov, Y., & Vial, J. P. (2008). Confidence level solutions for stochastic programming. Automatica, 44(6), 1559–1568.
Norkin, V. I., Pflug, G. C., & Ruszczyński, A. (1998). A branch and bound method for stochastic global optimization. Mathematical Programming, 83(1), 425–450.
Sen, S., Doverspike, R. D., & Cosares, S. (1994). Network planning with random demand. Telecommunications Systems, 3, 11–30.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Andrade, R., Lisser, A. & Maculan, N. Multi-service multi-facility network design under uncertainty. Ann Oper Res 199, 157–178 (2012). https://doi.org/10.1007/s10479-011-1003-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-011-1003-3