A stochastic intra-ring synchronous optimal network design problem

J. Cole; Andrew J. Schaefer; Joyce W. Yen

edoc-Server der Humboldt-Universität zu Berlin

SPEPS Preprint

Author(s):	J. Cole, Smith University of Arizona Andrew J. Schaefer, University of Pittsburgh Joyce W. Yen, University of Washington
Title:	A stochastic intra-ring synchronous optimal network design problem
Date of Acceptance:	23.04.2002
Series Title:	Stochastic Programming E-Print Series (SPEPS)
Editors:	Julie L. Higle; Werner Römisch; Surrajeet Sen
Complete Preprint:	pdf (urn:nbn:de:kobv:11-10058374)
Keywords (eng):	Programming: stochastic - integer (applications - Benders/decomposition)
Metadata export: To export the complete metadata set as Endote or Bibtex format please click to the appropriate link.	Endnote Bibtex
print on demand: If you click on this icon you can order a print copy of this publication.
Diese Seite taggen: These icons lead to social bookmarking systems where you can create and manage personal bookmarks and discover bookmakrs of other users.

Abstract (eng):

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.

Access Statistics:

These data concerning access statistics for individual documents have been compiled using the webserver log files aggregated by AWSTATS. They refer to a monthly access count to the full text documents as well as to the entry page.

As for format versions of a document which consist of multiple files (such as HTML) the highest monthly access number to one of the files (chapters) is shown respectivly.

To see the detailled access numbers please move the mouse pointer over the single bars of the digaram.

May
11

Jun
11

Jul
11

Aug
11

Sep
11

Oct
11

Nov
11

Dec
11

Jan
12

Feb
12

Apr
12

May
12

Jun
12

Jul
12

Aug
12

Sep
12

Oct
12

Nov
12

Dec
12

Jan
13

Apr
13

Monat	May 11	Jun 11	Jul 11	Aug 11	Sep 11	Oct 11	Nov 11	Dec 11	Jan 12	Feb 12	Apr 12	May 12	Jun 12	Jul 12	Aug 12	Oct 12	Nov 12	Dec 12	Jan 13	Apr 13
Startseite	1	1	1	3	1		2		1	4	1	1	1	2	2	1			2	1
PDF	7	3	7	6		1	2	1	2	2	1	1	4	5	1	4	61	2	14	9

Gesamtzahl der Zugriffe seit May 2011:

Startseite – 25 (1.19 pro Monat)
PDF – 133 (6.33 pro Monat)

Generated at 22.05.2013, 10:12:28

edoc-Server der Humboldt-Universität zu Berlin • Impressum • edoc@cms.hu-berlin.de • Nutzungsbedingungen • Haftungsausschluss • Statistik