Solving the Quadratic Assignment Problem using the Swallow Swarm Optimization Problem

In recent years, there is a growing interest in swarm intelligent algorithms inspired by the observation of the natural behavior of swarm to define a computational method, which may resolve the hardest combinatorial optimization problems. The Quadratic Assignment Problem is one of the well-known combinatorial problems, which simulate with the assignment problem in several domains such as the industrial domain. This paper proposes an adaptation of a recent algorithm called the swallow swarm optimization to solve the Quadratic Assignment Problem; this algorithm is characterized by a hierarchy of search who allow it to search in a totality of research space. The obtained results in solving some benchmark instances from QAPLIB are compared with those obtained from other know metaheuristics in other to evaluate the performance of the proposed adaptation.