A Dynamic and Adaptive Ant Algorithm Applied to Quadratic Assignment Problems

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

A Dynamic and Adaptive Ant Algorithm Applied to Quadratic Assignment Problems

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

Computing Science

Research output: Contribution to journal › Article › peer-review

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	Chinese
Pages (from-to)	477-480
Journal	Journal of Jilin University (Science Edition)
Volume	43
Issue number	4
Publication status	Published - 2005

Bibliographical note

In Chinese with English abstract

Access to Document

http://en.cnki.com.cn/Article_en/CJFDTOTAL-JLDX200504017.htm

Cite this

@article{56b2e421958f4a34bf4dc2487adf61fc,

title = "A Dynamic and Adaptive Ant Algorithm Applied to Quadratic Assignment Problems",

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.",

author = "Congying Lv and Zhezhou Yu and Chunguang Zhou and Kangping Wang and Wei Pang",

note = "In Chinese with English abstract",

year = "2005",

language = "Chinese",

volume = "43",

pages = "477--480",

journal = "Journal of Jilin University (Science Edition)",

issn = "1671-5489",

number = "4",

}

TY - JOUR

T1 - A Dynamic and Adaptive Ant Algorithm Applied to Quadratic Assignment Problems

AU - Lv, Congying

AU - Yu, Zhezhou

AU - Zhou, Chunguang

AU - Wang, Kangping

AU - Pang, Wei

N1 - In Chinese with English abstract

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

M3 - Article

SN - 1671-5489

VL - 43

SP - 477

EP - 480

JO - Journal of Jilin University (Science Edition)

JF - Journal of Jilin University (Science Edition)

IS - 4

ER -