Solving the Quadratic Assignment Problem using the Swallow Swarm Optimization Problem
Safaa Bouzidi1, Morad Bouzidi2, Mohammed Essaid Riffi3

1Safaa Bouzidi, Ph.D in Chouaib Doukkali University, Morocco.
2Morad Bouzidi, Researcher; Computer Science from Chouaib Doukkali University, Morocco.
3Mohammed Essaid RIFFI, Professor, Computer Science, Chouaib Doukkali University, Morocco.
Manuscript received on July 20, 2019. | Revised Manuscript received on August 10, 2019. | Manuscript published on August 30, 2019. | PP: 3116-3120 | Volume-8 Issue-6, August 2019. | Retrieval Number: F9132088619/2019©BEIESP | DOI: 10.35940/ijeat.F9132.088619
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (

Abstract: 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.
Keywords: Combinatorial optimization problem, metaheuristic, Swarm Intelligent, Swallow Swarm Optimization, Quadratic Assignment problem.