Abstract: We uses a dynamic and adaptive ant algorithm to solve the quadratic as signment problem (QAP), and presented a 3-opt algorithm to the problem for the local optimization of the solution. The results from the ex periments on different QAP instances show that this algorithm is able to find go od solutions quickly. Especially, the a lgorithm is able to solve the large QAP instance preferably, but the ancient alg orithm is only able to solve the small QAP instances.

Key words: dynamic adaptive, ant algorithm, quadratic assignment problem