Combined Network Design and Multiperiod Pricing: Modeling, Solution Techniques, and Computation

Daniel Bienstock (), Olga Raskina (), Iraj Saniee () and Qiong Wang ()
Additional contact information
Daniel Bienstock: Department of Industrial Engineering and Operations Research, Columbia University, 500 W. 120th Street, New York, New York 10027
Olga Raskina: Emptoris, Incorporated, 200 Wheeler Road, Burlington, Massachusetts 01803
Iraj Saniee: Bell Laboratories, 600 Mountain Avenue, Murray Hill, New Jersey 07974
Qiong Wang: Bell Laboratories, 600 Mountain Avenue, Murray Hill, New Jersey 07974

Operations Research, 2006, vol. 54, issue 2, 261-276

Abstract: In this paper we describe an efficient algorithm for solving novel optimization models arising in the context of multiperiod capacity expansion of optical networks. We assume that the network operator must make investment decisions over a multiperiod planning horizon while facing rapid changes in transmission technology, as evidenced by a steadily decreasing per-unit cost of capacity. We deviate from traditional and monopolistic models in which demands are given as input parameters, and the objective is to minimize capacity deployment costs. Instead, we assume that the carrier sets end-to-end prices of bandwidth at each period of the planning horizon. These prices determine the demands that are to be met, using a plausible and explicit price-demand relationship; the resulting demands must then be routed, requiring an investment in capacity. The objective of the optimization is now to simultaneously select end-to-end prices of bandwidth and network capacities at each period of the planning horizon, so as to maximize the overall net present value of expanding and operating the network. In the case of typical large-scale optical networks with protection requirements, the resulting optimization problems pose significant challenges to standard optimization techniques. The complexity of the model, its nonlinear nature, and the large size of realistic problem instances motivates the development of efficient and scalable solution techniques. We show that while general-purpose nonlinear solvers are typically not adequate for the task, a specialized decomposition scheme is able to handle large-scale instances of this problem in reasonable time, producing solutions whose net present value is within a small tolerance of the optimum.

Keywords: communications; facility/equipment planning; capacity expansion; design; maintenance/replacement; programming; nonlinear (search for similar items in EconPapers)
Date: 2006
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1050.0259 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:54:y:2006:i:2:p:261-276

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().