A comparison of nature inspired algorithms for the quadratic assignment problem

被引:12
|
作者
Chmiel, W. [1 ]
Kadluczka, P. [1 ]
Kwiecien, J. [1 ]
Filipowicz, B. [1 ]
机构
[1] AGH Univ Sci & Technol, 30 Mickiewicza Ave, PL-30059 Krakow, Poland
关键词
permutation problem; quadratic assignment problem; ant algorithm; bees algorithm; BRANCH;
D O I
10.1515/bpasts-2017-0056
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper presents an application of the ant algorithm and bees algorithm in optimization of QAP problem as an example of NP-hard optimization problem. The experiments with two types of algorithms: the bees algorithm and the ant algorithm were performed for the test instances of the quadratic assignment problem from QAPLIB, designed by Burkard, Karisch and Rendl. On the basis of the experiments results, an influence of particular elements of algorithms, including neighbourhood size and neighbourhood search method, will be determined.
引用
收藏
页码:513 / 522
页数:10
相关论文
共 50 条