Multi-period capacity expansion for a local access telecommunications network

In this paper, we examine a multi-period capacity expansion problem for a local access telecommunications network with a tree topology. Capacity expansion is realized through the installation of concentrators at the nodes and cables on the links of the network. Clearly, the installation of concentrators reduces the need for additional cables, and conversely. The goal is to find the least cost alternative to satisfy the demand. A heuristic approach is proposed to solve this problem, where local installation decisions at each node are propagated in the network. This information is then used to adjust prices that guide the decision process from one iteration to the next, until a fixed point is reached. Numerical results are reported on problem instances based on different cost and demand structures. � 2005 Elsevier B.V. All rights reserved.

[1]  Amitava Dutta,et al.  A Multiperiod Capacity Planning Model for Backbone Computer Communication Networks , 1992, Oper. Res..

[2]  Thomas L. Magnanti,et al.  Working Paper Alfred P. Sloan School of Management "models for Planning Capacity Expansion in Local Access Telecommunication Networks" "models for Planning Capacity Expansion in Local Access Telecommunication Networks" Models for Planning Capacity Expansion in Local Access Telecommunication Networks , 2008 .

[3]  Bezalel Gavish,et al.  Telecommunications Network Topological Design and Capacity Expansion , 1991 .

[4]  José Pinto Paixão,et al.  Dynamic programming based heuristics for the topological design of local access networks , 1991, Ann. Oper. Res..

[5]  Pierre Chardaire.  Hierarchical Two Level Location Problems , 1999 .

[6]  M. R. Rao,et al.  Optimal Network Capacity Planning: A Shortest-Path Scheme , 1975, Oper. Res..

[7]  Brunilde Sansò,et al.  Telecommunications Network Planning , 1998 .

[8]  Bezalel Gavish,et al.  Lower Bounding Procedures for Multiperiod Telecommunications Network Expansion Problems , 1995, Oper. Res..

[9]  Arie M. C. A. Koster,et al.  A dynamic programming algorithm for the local access telecommunication network expansion problem , 2000, Eur. J. Oper. Res..

[10]  Thomas L. Magnanti,et al.  A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning , 1995, Oper. Res..

[11]  Yuping Qiu,et al.  Planning for optimal expansion of leased line communication networks , 1992, Ann. Oper. Res..

[12]  P. Brooker,et al.  Optimal expansion of an existing network , 1974, Math. Program..

[13]  Norman Zadeh,et al.  On building minimum cost communication networks over time , 1974, Networks.

[14]  Luís Gouveia,et al.  Using generalized capacitated trees for designing the topology of local access networks , 1997, Telecommun. Syst..

[15]  Christine Dupuis.  Résolution d'un problème de la capacité dans un réseau de télécommunications , 1998 .

[16]  Geraldo Robson Mateus,et al.  Model and heuristic for a generalized access network design problem , 2000, Telecommun. Syst..

[17]  Bezalel Gavish,et al.  Telecommunications network topological design and capacity expansion: Formulations and algorithms , 1993, Telecommun. Syst..