Logo of Humboldt-Universität zu BerlinLogo of Humboldt-Universität zu Berlin
edoc-Server
Open-Access-Publikationsserver der Humboldt-Universität
de|en
Header image: facade of Humboldt-Universität zu Berlin
View Item 
  • edoc-Server Home
  • Elektronische Zeitschriften
  • Stochastic Programming E-print Series (SPEPS)
  • Volume 2002
  • View Item
  • edoc-Server Home
  • Elektronische Zeitschriften
  • Stochastic Programming E-print Series (SPEPS)
  • Volume 2002
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
All of edoc-ServerCommunity & CollectionTitleAuthorSubjectThis CollectionTitleAuthorSubject
PublishLoginRegisterHelp
StatisticsView Usage Statistics
All of edoc-ServerCommunity & CollectionTitleAuthorSubjectThis CollectionTitleAuthorSubject
PublishLoginRegisterHelp
StatisticsView Usage Statistics
View Item 
  • edoc-Server Home
  • Elektronische Zeitschriften
  • Stochastic Programming E-print Series (SPEPS)
  • Volume 2002
  • View Item
  • edoc-Server Home
  • Elektronische Zeitschriften
  • Stochastic Programming E-print Series (SPEPS)
  • Volume 2002
  • View Item
2002-04-23Buch DOI: 10.18452/8269
A stochastic intra-ring synchronous optimal network design problem
Cole, J.
Schaefer, Andrew J.
Yen, Joyce W.
We develop a stochastic programming approach to solving an intra-ring Synchronous Optical Network (SONET) design problem. This research differs from pioneering SONET design studies in two fundamental ways. First, while traditional approaches to solving this problem assume that all data are deterministic, we observe that for practical planning situations, network demand levels are stochastic. Second, while most models disallow demand shortages and focus only on the minimization of capital Add-Drop Multiplexer (ADM) equipment expenditure, our model minimizes a mix of ADM installations and expected penalties arising from the failure to satisfy some or all of the actual telecommunication demand. We propose an L-shaped algorithm to solve this design problem, and demonstrate how a nonlinear reformulation of the problem may improve the strength of the generated optimality cuts. We next enhance the ba-sic algorithm by implementing powerful lower and upper bounding techniques via an assortment of modeling, valid inequality, and heuristic strategies. Our computational results conclusively demonstrate the efficacy of our proposed algorithm as opposed to standard L-shaped and extensive form approaches to solving the problem.
Files in this item
Thumbnail
5.pdf — Adobe PDF — 220.2 Kb
MD5: c15f526aae94eb90a9bf2ea60bfaadb3
Cite
BibTeX
EndNote
RIS
InCopyright
Details
DINI-Zertifikat 2019OpenAIRE validatedORCID Consortium
Imprint Policy Contact Data Privacy Statement
A service of University Library and Computer and Media Service
© Humboldt-Universität zu Berlin
 
DOI
10.18452/8269
Permanent URL
https://doi.org/10.18452/8269
HTML
<a href="https://doi.org/10.18452/8269">https://doi.org/10.18452/8269</a>