Metaheuristic algorithms for the quadratic assignment problem
MetadataShow full item record
This paper presents two meta-heuristic algorithms to solve the quadratic assignment problem. The iterated greedy algorithm has two main components, which are destruction and construction procedures. The algorithm starts from an initial solution and then i
[email protected] by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..