Heuristics for Biquadratic Assignment Problems and Their Computational Comparison Heuristics for Biquadratic Assignment Problems and Their Computational Comparison

The biquadratic assignment problem (BiQAP) is a generalization of the quadratic assignment problem (QAP). As for any hard optimization problem also for BiQAP, a reasonable eeort to cope with the problem is trying to derive heuristics which solve it suboptimally and which, possibly, yield a good trade oo between the solution quality and the time and memory requirements. In this paper we describe several heuristics for BiQAPs, in particular pair exchange algorithms (improvement methods) and variants of simulated annealing and taboo search. We implement these heuristics as C codes and analize their performance .