Application of markov decision processes to the frequency assignment problem

被引:7
作者
Greff, JY
Idoumghar, L
Schott, R
机构
[1] TDF C2R, F-57078 Metz, France
[2] LORIA, Vandoeuvre Les Nancy, France
[3] IECN, Vandoeuvre Les Nancy, France
关键词
D O I
10.1080/08839510490497058
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents an original algorithm, based on Markov decision processes (MDPs) (Bellman 1957), that is used to solve the frequency assignment problem in the field of radio broadcasting. The results obtained by this algorithm are compared to the best known results obtained by hybrid genetic algorithm (Alabau et al. 2002a), ant colony paradigms (Comellas and Ozon 1998), and the best operating solution in the field of radio broadcasting in France.1
引用
收藏
页码:761 / 773
页数:13
相关论文
共 15 条
[1]   New hybrid genetic algorithms for the frequency assignment problem [J].
Alabau, M ;
Idoumghar, L ;
Schott, R .
IEEE TRANSACTIONS ON BROADCASTING, 2002, 48 (01) :27-34
[2]  
ALABAU M, 2002, P 13 C FRANC REC FOR, P241
[3]  
[Anonymous], 1999, PROC C EVOL COMPUT C
[4]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[5]  
Bellman R., 1957, DYNAMIC PROGRAMMING
[6]  
COMELLAS F, 1998, P 1 INT WORKSH ANT C
[7]  
DONGARRA J, 1994, P 2 OBJ OR NUM C, P214
[8]  
FLEURENT C, 1995, ANN OPER RES, V63, P437
[9]   Bounded-parameter markov decision processes [J].
Givan, R ;
Leach, S ;
Dean, T .
ARTIFICIAL INTELLIGENCE, 2000, 122 (1-2) :71-109
[10]  
GLOVER F, 1993, ANN OPERATIONS RES