New hybrid genetic algorithms for the frequency assignment problem

被引:28
作者
Alabau, M [1 ]
Idoumghar, L
Schott, R
机构
[1] Technopole Metz 2000, TDF C2R Broadcasting & Wireless Res Ctr, F-57078 Metz, France
[2] IECN, F-54506 Vandoeuvre Les Nancy, France
[3] LORIA, F-54506 Vandoeuvre Les Nancy, France
关键词
frequency assignment problem; genetic algorithms; graph coloring problem; greedy algorithms; hybrid algorithms; tabu search;
D O I
10.1109/11.992851
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 [电气工程]; 0809 [电子科学与技术];
摘要
This paper presents a new hybrid genetic algorithm used to solve a frequency assignment problem. The hybrid genetic algorithm presented in this paper uses two original mutation and two crossover operators. Theses operators use specialized information to enhance the quality of the solutions. The results obtained by our algorithm are better than the best known results obtained by other methods like tabu search and hybrid genetic algorithm. Our results are validated in the field of radiobroadcasting and compared to the best existing solutions in this domain.(1)
引用
收藏
页码:27 / 34
页数:8
相关论文
共 17 条
[1]
Alabau M, 2001, PROC INT C TOOLS ART, P136, DOI 10.1109/ICTAI.2001.974458
[2]
ALABAU M, 2001, ALGOTEL 2001, P111
[3]
[Anonymous], 1989, GENETIC ALGORITHM SE
[4]
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[5]
Bellman R., 1957, DYNAMIC PROGRAMMING
[6]
COMELLAS F, 1998, ANTS 98 ANT COLONIES
[7]
COUPE JM, 1999, Patent No. 9902768
[8]
DORNE R, LG2IPEMAEERIE
[9]
FLEURENT C, 1995, ANN OPER RES, V63, P437
[10]
Glover F., 1993, Annals of Operations Research, V41, P3