Algoritmo guloso adaptativo e aleatório para o problema quadrático de alocação

Abstract

The Quadratic Assignment Problem (QAP) is an NP-hard problem. Despite the continuous effort in the formulation of new heuristics, optimal solutions are not generally known yet, for instances of order n > 25. A GRASP-type heuristic developed by Li, Pardalos and Resende [LPR94] showed itself to be very efficient and this fact motivated the authors to propose a perfectioning in its local search reducing the number of iterations.

Combinatorial Optimization; Metaheuristic; Quadratic Assignment Problem