Capacitated network design with uncertain demand

Capacitated network design with uncertain demand

0.00 Avg rating0 Votes
Article ID: iaor20032997
Country: United States
Volume: 14
Issue: 3
Start Page Number: 247
End Page Number: 260
Publication Date: Jul 2002
Journal: INFORMS Journal On Computing
Authors: ,
Keywords: programming: integer, programming: probabilistic, communication
Abstract:

We consider a capacity-expansion problem arising in the design of telecommunication networks. The problem is to install capacity on links of the network so as to meet customer demand while minimizing total costs incurred. When studying this and related problems it is customary to assume that point-to-point demands are given. This will not be the case in practice, however, since future demand is generally unknown and the decision must be based on uncertain forecasts. We develop a stochastic integer programming formulation of the problem and propose an L-shaped solution procedure based on well-known cutting-plane procedures for the deterministic problem. The algorithm was tested on two sets of real-life problem instances and we present results of our computational experiments.

Reviews

Required fields are marked *. Your email address will not be published.