Metaheuristic Algorithms for the Quadratic Assignment Problem

Abstract

This paper presents two meta-heuristic algorithms to solve the quadratic assignment problem. The iterated greedy algorithm has two main components, hich are destruction and construction procedures. The algorithm starts from an initial solution and then it