Parallel genetic algorithms for third generation mobile network planning

被引:18
作者
Maple, C [1 ]
Guo, L [1 ]
Zhang, J [1 ]
机构
[1] Univ Luton, Dept Comp & Informat Syst, Luton LU1 3JU, Beds, England
来源
INTERNATIONAL CONFERENCE ON PARALLEL COMPUTING IN ELECTRICAL ENGINEERING | 2004年
关键词
3G; CDMA; parallel genetic algorithm; optimisation; coverage; capacity;
D O I
10.1109/PCEE.2004.1335615
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
As Third Generation (3G) mobile networks start to be implemented, there is a need for effective network planning. However, deciding upon the optimum placement for the base stations of the networks is a complex task requiring vast computational resource. This paper discusses the conflicting objectives of base station planning and characterises a multi-objective optimisation problem. We present a genetic encoding of the third generation mobile network planning problem and parallel genetic algorithms to solve it.
引用
收藏
页码:229 / 236
页数:8
相关论文
共 14 条
[1]  
ANDRE D, 1996, P 5 ANN C EV PROGR
[2]  
[Anonymous], IEEE J SELECTED AREA
[3]  
CANTUPAZ E, 1998, RESEAUX SYSTEMS REPA, V10
[4]  
Gilhousen K.S., 1991, IEEE T VEHICULAR TEC
[5]  
HARRI H, 2000, WCDMA UMTS RADIO ACC
[6]  
HOPPE R, P IEEE INT S PERS IN
[7]  
JAANA L, 2002, RADIO NETWORK PLANNI
[8]  
JUKKA L, 2001, RADIO INFERFERENCE S
[9]  
KYOUNG K, 2000, HDB CDMA SYSTEM DESI
[10]  
SRINIVAS M, 1994, IEEE COMPUTER, V27