DocumentCode :
2443518
Title :
Resolution of quadratic assignment problems using an evolutionary algorithm
Author :
Horng, Jorng-Tzong ; Chen, Chien-Chin ; Liu, Baw-Jhiune ; Kao, Cheng-Yen
Author_Institution :
Dept. of Comput. Sci. & Inf. Eng., Nat. Central Univ., Jungli, Taiwan
Volume :
2
fYear :
2000
fDate :
2000
Firstpage :
902
Abstract :
This investigation presents evolution strategies to solve quadratic assignment problems. The proposed algorithm applies family competition and clustering to enhance the solution quality. Several problems obtained from QAPLIB (Burkard et al., 1991) were tested and experimental results were compared with other approaches in the literature. Experimental results also show that the proposed algorithm is promising
Keywords :
evolutionary computation; operations research; clustering; evolutionary algorithm; family competition; quadratic assignment problems; Clustering algorithms; Computer science; Evolutionary computation; Information science; Mathematical model; NP-complete problem; Production; Testing; Traveling salesman problems; Wiring;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Evolutionary Computation, 2000. Proceedings of the 2000 Congress on
Conference_Location :
La Jolla, CA
Print_ISBN :
0-7803-6375-2
Type :
conf
DOI :
10.1109/CEC.2000.870736
Filename :
870736
Link To Document :
بازگشت