Minimizing interference in mobile communications using genetic algorithms

被引:0
作者
Li, S [1 ]
Lay, SC [1 ]
Yu, WH [1 ]
Wang, LP [1 ]
机构
[1] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore
来源
COMPUTATIONAL SCIENCE-ICCS 2002, PT I, PROCEEDINGS | 2002年 / 2329卷
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
There is a continuously growing demand for mobile communication. With the limited frequency spectrum, the problem of channel assignment becomes increasingly important. This problem is known to belong to a class of very difficult combinatorial optimization problems. In this paper, we apply the formulation of Ngo and Li with genetic algorithms to ten benchmarking problems, for some of which interference-free solutions cannot be found but the approach is able to minimize the interference effectively.
引用
收藏
页码:960 / 969
页数:10
相关论文
共 21 条
[1]  
CUPPINI M, 1996, EUR T TELECOMM RELAT, V45, P91
[2]  
Davis L., 1987, GENETIC ALGORITHMS S
[3]  
Falkenauer E., 1998, GENETIC ALGORITHMS G
[4]   A NEURAL NETWORK PARALLEL ALGORITHM FOR CHANNEL ASSIGNMENT PROBLEMS IN CELLULAR RADIO NETWORKS [J].
FUNABIKI, N ;
TAKEFUJI, Y .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 1992, 41 (04) :430-437
[5]  
GOLDBERG D, 1989, 1953 GENETIC ALGORIT
[7]  
HOLLAND JH, 1975, ADAPTATION NATURAL A
[8]  
Kim J.-S., 1996, Wireless Personal Communications, V3, P273, DOI 10.1007/BF00354875
[9]  
KIM S, 1994, IEEE T VEH TECHNOL, V43, P542
[10]  
KO TM, 1994, P 5 IEEE INT S PERS, P311