Multi-period capacity expansion for a local access telecommunications network

被引:21
作者
Gendreau, M
Potvin, JY
Smires, A
Soriano, P
机构
[1] Univ Montreal, Ctr Rech Transports, Montreal, PQ H3C 3J7, Canada
[2] Univ Montreal, Dept Informat & Rech Operationnelle, Montreal, PQ H3C 3J7, Canada
[3] Ecole Hautes Etud Commerciales, Montreal, PQ H3T 2A7, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
telecommunications; local access network; capacity expansion; multi-period; heuristic;
D O I
10.1016/j.ejor.2004.12.006
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
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. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:1051 / 1066
页数:16
相关论文
共 16 条
[1]   A DECOMPOSITION ALGORITHM FOR LOCAL ACCESS TELECOMMUNICATIONS NETWORK EXPANSION PLANNING [J].
BALAKRISHNAN, A ;
MAGNANTI, TL ;
WONG, RT .
OPERATIONS RESEARCH, 1995, 43 (01) :58-76
[2]  
Balakrishnan A., 1991, Annals of Operations Research, V33, P239
[3]   LOWER BOUNDING PROCEDURES FOR MULTIPERIOD TELECOMMUNICATIONS NETWORK EXPANSION PROBLEMS [J].
CHANG, SG ;
GAVISH, B .
OPERATIONS RESEARCH, 1995, 43 (01) :43-57
[4]  
CHANG SG, 1993, TELECOMMUN SYST, V1, P99
[5]  
Chardaire P., 1999, TELECOMMUNICATIONS N, P33
[6]  
CHEN M, 1996, MODEL PLANNING MULTI
[7]  
Christofides N, 1974, MATH PROGRAM, V6, P197
[8]   OPTIMAL NETWORK CAPACITY PLANNING - SHORTEST-PATH SCHEME [J].
DOULLIEZ, PJ ;
RAO, MR .
OPERATIONS RESEARCH, 1975, 23 (04) :810-818
[9]  
DUPUIS C, 1998, THESIS U MONTREAL
[10]   A MULTIPERIOD CAPACITY PLANNING-MODEL FOR BACKBONE COMPUTER-COMMUNICATION NETWORKS [J].
DUTTA, A ;
LIM, JI .
OPERATIONS RESEARCH, 1992, 40 (04) :689-705