Abstract
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 language | English |
|---|---|
| Pages (from-to) | 477-480 |
| Number of pages | 4 |
| Journal | Journal of Jilin University (Science Edition) |
| Volume | 43 |
| Issue number | 4 |
| Publication status | Published - 26 Jul 2005 |