Heuristics for biquadratic assignment problems and their computational comparison

Heuristics for biquadratic assignment problems and their computational comparison

0.00 Avg rating0 Votes
Article ID: iaor19981440
Country: Netherlands
Volume: 83
Issue: 2
Start Page Number: 283
End Page Number: 300
Publication Date: Jun 1995
Journal: European Journal of Operational Research
Authors: ,
Keywords: programming: integer, optimization: simulated annealing, heuristics
Abstract:

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 effort to cope with the problem is trying to derive heuristics which solve it suboptimally and which, possibly, yield a good trade off 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 tabu search. We implement these heuristics as C codes and analyze their performances.

Reviews

Required fields are marked *. Your email address will not be published.