Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH
Vol. 54, No. 2, March-April 2006, pp. 261-276
DOI: 10.1287/opre.1050.0259
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Bienstock, D.
Right arrow Articles by Wang, Q.
Right arrow Search for Related Content

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

Daniel Bienstock, Olga Raskina, Iraj Saniee, Qiong Wang

Department of Industrial Engineering and Operations Research, Columbia University, 500 W. 120th Street, New York, New York 10027
Emptoris, Incorporated, 200 Wheeler Road, Burlington, Massachusetts 01803
Bell Laboratories, 600 Mountain Avenue, Murray Hill, New Jersey 07974
Bell Laboratories, 600 Mountain Avenue, Murray Hill, New Jersey 07974

dano{at}columbia.edu
oraskina{at}emptoris.com
iis{at}research.bell-labs.com
qwang{at}research.bell-labs.com

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.

Subject classifications: communications; facility/equipment planning; capacity expansion; design; maintenance/replacement; programming; nonlinear.
History: Received May 2003; revision received December 2003; accepted January 2005.




This article has been cited by other articles:


Home page
Operations ResearchHome page
L. Brotcorne, M. Labbe, P. Marcotte, and G. Savard
Joint Design and Pricing on a Network
Operations Research, September 1, 2008; 56(5): 1104 - 1115.
[Abstract] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2006 by INFORMS.