ISSN:
1572-9451
Source:
Springer Online Journal Archives 1860-2000
Topics:
Electrical Engineering, Measurement and Control Technology
Notes:
Abstract We study a planning problem associated with networks for private line services. In these networks, demands are known to exhibit considerable variability, and as such, they should be treated as random variables. The proposed planning model is a two-stage stochastic linear program (SLP) with recourse. Due to the enormous size of the deterministic equivalent, we choose a sampling based algorithm calledstochastic decomposition (SD). For very large-scale SLPs, such as the ones solved in this application, SD provides an effective methodology. The model presented in this paper is validated by using a detailed simulation of the network. We report results with a network that has 86 demand pairs, 89 links and 706 potential routes.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF02110042
