An evolutionary algorithm for the biobjective QAP

被引:5
作者
Borgulya, Istvan [1 ]
机构
[1] Univ Pecs, Fac Business & Econ, H-7621 Pecs, Hungary
来源
COMPUTATIONAL INTELLIGENCE, THEORY AND APPLICATION | 2006年
关键词
multi-objective optimization; EC-memory method; QAP; evolutionary algorithm;
D O I
10.1007/3-540-34783-6_55
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper we present a new method for the biobjective quadratic assignment problem. This method is a modified version of an earlier multi-objective evolutionary algorithm. It uses a special truncation selection, and the descendents are derived from the parents by mutation based on an EC-memory method. This EC-memory method is an extended version of an earlier method, and we can use on the more value discrete space. The quality of the results of our algorithm is better than the results of some stochastic local search, or ACO algorithms.
引用
收藏
页码:577 / 586
页数:10
相关论文
共 15 条
[1]  
[Anonymous], SOFT COMPUTING SYSTE
[2]  
[Anonymous], P 7 INT C GEN ALG
[3]  
Baluja S., 1995, MACH LEARN, P38
[4]  
Borgulya I, 2005, CENT EUR J OPER RES, V13, P233
[5]  
CARBONARO A, 2003, NAT COMP SER, P539
[6]  
Day RO, 2005, LECT NOTES COMPUT SC, V3448, P91
[7]  
Deb K., 2001, Multi-Objective Optimization using Evolutionary Algorithms
[8]  
GOLDBERG DE, 1989, GENETIC ALGORITHM SE
[9]  
Knowles J, 2003, LECT NOTES COMPUT SC, V2632, P295
[10]  
López-Ibáñez M, 2004, LECT NOTES COMPUT SC, V3172, P214