Solving Quadratic Assignment Problem by Using Meta-heuristic Search Method

Abstract

While analytical solutions to Quadratic Assignment Problems (QAP) have indeed been since a long time, the expanding use of Evolutionary Algorithms (EAs) for similar issues gives a framework for dealing with QAP with an extraordinarily broad scope. The study's key contribution is that it normalizes all of the criteria into a single scale, regardless of their measurement systems or the requirements of minimum or maximum, relieving the researchers of the exhaustively quantifying the quality criteria. A tabu search algorithm for quadratic assignment problems (TSQAP) is proposed, which combines the limitations of tabu search with a discrete assignment problem. The effectiveness of the proposed technique has been compared to well-established alternatives, and its operating principle is illustrated with a numerical example. After repeating the solution of each issue (8) once and recording the algorithm results, it showed its agreement, once from a total (375) repetition of the experiment while the number of times the Artificial Bee Colony (ABC) arrived (2) as for the Firefly (FA) Algorithm giving (117), also Genetic (GA) and Particle Swarm (PSO) gives (120) and the Tabu Search algorithm (174). The proposed technique (TSQAP) is shown to yield a superior solution with low computing complexity. MATLAB was used to generate all of the findings (R2020b).

Keywords

• Tabu Search, Quadratic Assignment Problems, Assignment Problems.