A greedy randomized adaptive search procedure for the quadratic assignment problem

Abstract

A greedy randomized adaptive search procedure (GRASP) is a randomized heuristic that has been shown to quickly produce good quality solutions for a wide variety of combinatorial optimization problems. In this paper, we describe a GRASP for the quadratic assignment problem. We review basic concepts of GRASP: construction and local search algorithms. The implementation of GRASP for the quadratic assignment problem is described in detail. Computational experience on a large set of standard test problems (QAPLIB) is presented