A comparison of nature inspired algorithms for the quadratic assignment problem

Bulletin of the Polish Academy of Sciences. Technical Sciences

P. Kad?uczkaAGH University of Science and Technology, 30 Mickiewicza Ave., 30-059 Krakow, PolandOther articles by this author:De Gruyter OnlineGoogle Scholar¹  W. ChmielCorresponding authorAGH University of Science and Technology, 30 Mickiewicza Ave., 30-059 Krakow, PolandEmailOther articles by this author:De Gruyter OnlineGoogle Scholar¹  J. Kwiecie?AGH University of Science and Technology, 30 Mickiewicza Ave., 30-059 Krakow, PolandOther articles by this author:De Gruyter OnlineGoogle Scholar¹  B. FilipowiczAGH University of Science and Technology, 30 Mickiewicza Ave., 30-059 Krakow, PolandOther articles by this author:De Gruyter OnlineGoogle Scholar¹ 

[1] AGH University of Science and Technology, 30 Mickiewicza Ave., 30-059 Krakow, Poland

关键词: Keywords: permutation problem;    quadratic assignment problem;    ant algorithm;    bees algorithm;   

DOI  :  10.1515/bpasts-2017-0056

学科分类：工程和技术（综合）

来源: Polska Akademia Nauk * Centrum Upowszechniania Nauki / Polish Academy of Sciences, Center for the Advancement of Science

【 摘 要 】

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.

【 授权许可】

Unknown