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 条
  • [31] Comparative Study of Inhomogeneous Simulated Annealing Algorithms for Quadratic Assignment Problem
    Ma, Zuoling
    Wang, Lijin
    Lin, Song
    Zhong, Yiwen
    2018 11TH INTERNATIONAL CONGRESS ON IMAGE AND SIGNAL PROCESSING, BIOMEDICAL ENGINEERING AND INFORMATICS (CISP-BMEI 2018), 2018,
  • [32] Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
    Drezner, Zvi
    COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (03) : 717 - 736
  • [33] Analyzing the performance of hybrid evolutionary algorithms for the multiobjective quadratic assignment problem
    Garrett, Deon
    Dasgupta, Dipankar
    2006 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-6, 2006, : 1695 - +
  • [34] A hybrid algorithm combining lexisearch and genetic algorithms for the quadratic assignment problem
    Ahmed, Zakir Hussain
    COGENT ENGINEERING, 2018, 5 (01):
  • [35] Sequential and parallel path-relinking algorithms for the quadratic assignment problem
    James, T
    Rego, C
    Glover, F
    IEEE INTELLIGENT SYSTEMS, 2005, 20 (04) : 58 - 65
  • [36] Comparison of Two Diversification Methods to Solve the Quadratic Assignment Problem
    Abdelkafi, Omar
    Idoumghar, Lhassane
    Lepagnot, Julien
    INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, ICCS 2015 COMPUTATIONAL SCIENCE AT THE GATES OF NATURE, 2015, 51 : 2703 - 2707
  • [37] A comparison of different metaheuristics for the quadratic assignment problem in accelerated systems
    Kumar, Manoj
    Sahu, Aryabartta
    Mitra, Pinaki
    APPLIED SOFT COMPUTING, 2021, 100
  • [38] Nature-Inspired Optimization Algorithms Applied for Solving Charging Station Placement Problem: Overview and Comparison
    Sanchari Deb
    Xiao-Zhi Gao
    Kari Tammi
    Karuna Kalita
    Pinakeswar Mahanta
    Archives of Computational Methods in Engineering, 2021, 28 : 91 - 106
  • [39] Nature-Inspired Optimization Algorithms Applied for Solving Charging Station Placement Problem: Overview and Comparison
    Deb, Sanchari
    Gao, Xiao-Zhi
    Tammi, Kari
    Kalita, Karuna
    Mahanta, Pinakeswar
    ARCHIVES OF COMPUTATIONAL METHODS IN ENGINEERING, 2021, 28 (01) : 91 - 106
  • [40] Comparison of Nature Inspired Algorithms Applied in Student Courses Recommendation
    Sobecki, Janusz
    COMPUTATIONAL COLLECTIVE INTELLIGENCE - TECHNOLOGIES AND APPLICATIONS, PT I, 2012, 7653 : 278 - 287