Budget-constrained, capacitated hub location to maximize expected demand coverage in fixed-wireless telecommunication networks

被引:14
作者
Bollapragada, Ramesh
Li, Yanjun
Rao, Uday S.
机构
[1] San Francisco State Univ, Coll Business, San Francisco, CA 94132 USA
[2] Bell Labs, Lucent Technol, Holmdel, NJ 07733 USA
[3] Purdue Univ, Krannert Sch Management, W Lafayette, IN 47907 USA
[4] Univ Cincinnati, Coll Business, Cincinnati, OH 45221 USA
关键词
telecommunications; broadband access; fixed-wireless; location-allocation; network planning; stochastic programming; greedy approximation algorithms;
D O I
10.1287/ijoc.1050.0143
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper presents a quantitative model for telecommunication network installation by companies in the broadband-access business, specialized to the fixed-wireless case. Under stochastic demand modeled using scenarios, we maximize the expected demand coverage subject to a budget constraint on hub installation, and technological constraints on demand coverage by installed hubs. There are multiple hub types, differing in costs and capacities. We present a practical greedy heuristic based on the budgeted maximum-coverage problem and analyze its worst-case performance. For special cases with a single hub type or a single demand scenario, we show that a guarantee of 1-1/e or 63.2% applies to our greedy heuristic. For the general case we develop a data-dependent performance guarantee. Through computational experiments, we show that the greedy heuristic's empirical performance is, on average, within 2% of the optimal expected demand coverage.
引用
收藏
页码:422 / 432
页数:11
相关论文
共 27 条
[1]  
[Anonymous], FACILITY LOCATION AP
[2]  
[Anonymous], 1997, APPROXIMATION ALGORI
[3]   A DECOMPOSITION ALGORITHM FOR LOCAL ACCESS TELECOMMUNICATIONS NETWORK EXPANSION PLANNING [J].
BALAKRISHNAN, A ;
MAGNANTI, TL ;
WONG, RT .
OPERATIONS RESEARCH, 1995, 43 (01) :58-76
[4]   Spare-capacity assignment for line restoration using a single-facility type [J].
Balakrishnan, A ;
Magnanti, TL ;
Sokol, JS ;
Wang, Y .
OPERATIONS RESEARCH, 2002, 50 (04) :617-635
[5]  
BARAHONA F, 1999, 21606 RC IBM COMP SC
[6]   THE MAXIMAL EXPECTED COVERING LOCATION PROBLEM - REVISITED [J].
BATTA, R ;
DOLAN, JM ;
KRISHNAMURTHY, NN .
TRANSPORTATION SCIENCE, 1989, 23 (04) :277-287
[7]   AN OVERVIEW OF REPRESENTATIVE PROBLEMS IN LOCATION RESEARCH [J].
BRANDEAU, ML ;
CHIU, SS .
MANAGEMENT SCIENCE, 1989, 35 (06) :645-674
[8]  
CHUNG CH, 1986, J OPER RES SOC, V37, P735, DOI 10.2307/2581958
[9]   LOCATION OF BANK ACCOUNTS TO OPTIMIZE FLOAT - ANALYTIC STUDY OF EXACT AND APPROXIMATE ALGORITHMS [J].
CORNUEJOLS, G ;
FISHER, ML ;
NEMHAUSER, GL .
MANAGEMENT SCIENCE, 1977, 23 (08) :789-810
[10]   CAPACITATED COVERING MODELS [J].
CURRENT, JR ;
STORBECK, JE .
ENVIRONMENT AND PLANNING B-PLANNING & DESIGN, 1988, 15 (02) :153-163