A Dynamic and Adaptive Ant Algorithm Applied to Quadratic Assignment Problems

Congying Lv, Zhezhou Yu, Chunguang Zhou, Kangping Wang, Wei Pang

Research output: Contribution to journalArticlepeer-review


We use a dynamic and adaptive ant algorithm to solve the quadratic assignment problem (QAP), and presented a 3-opt algorithm to the problem for the local optimization of the solution. The results from the experiments on different QAP instances show that this algorithm is able to find good solutions quickly. Especially, the algorithm is able to solve the large QAP instance preferably, but the ancient algorithm is only able to solve the small QAP instances.
Original languageChinese
Pages (from-to)477-480
JournalJournal of Jilin University (Science Edition)
Issue number4
Publication statusPublished - 2005

Bibliographical note

In Chinese with English abstract

Cite this