First Adaptation of Hunting Search Algorithm for the Quadratic Assignment Problem

被引:0
|
作者
Agharghor, Amine [1 ]
Riffi, Mohammed Essaid [1 ]
机构
[1] Chouaib Doukkali Univ, Fac Sci, Dept Comp Sci, Lab LAROSERIE, El Jadida, Morocco
来源
EUROPE AND MENA COOPERATION ADVANCES IN INFORMATION AND COMMUNICATION TECHNOLOGIES | 2017年 / 520卷
关键词
Hunting search algorithm; Quadratic assignment problem; Combinatorial optimization; Meta-heuristic; Evolutionary algorithm;
D O I
10.1007/978-3-319-46568-5_27
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Quadratic assignment problem is one of the basic combinatorial optimization problems NP-hard. This paper aims to present a new algorithm for solving the quadratic assignment problem: Hunting Search algorithm. It is a metaheuristic inspired by the method of group hunting of predatory animals. To show the performance of this algorithm, it has been checked on a set of seventeen instances of QAPLib and it gave good results.
引用
收藏
页码:263 / 267
页数:5
相关论文
共 50 条