Adaptive memories for the Quadratic Assignment Problems
Éric D. Taillard, Luca Maria Gambardella · SUPSI ARIS · 1997
The paper proposes, compares and analyses different memory- based meta-heuristics for the quadratic assignment problem (QAP). Two of these methods (FANT and GDH) are new while two others (HAS-QAP and GTSH) are among the best for structured QAP instances. These methods are based on ant systems and genetic algorithms and they are presented under a unified general scheme, called adaptive memory programming (AMP). However, they use different types of memory and different improving procedures. Two new memoryless methods (VNS-QAP and RVNS-QAP) based on variable neighbourhood search are also proposed and compared with adaptive memory procedures.