An experimental study of variable depth search algorithms for the quadratic assignment problem

this paper introduces a new variable depth search method for the quadratic assignment problem. the new method considers the cost of edges assignment as the criterion to decide which vertices to exchange during local search moves. it also presents the results of an extensive experimental study that compares the performance of local search and variable depth search algorithms for the quadratic assignment problem. the investigation presented here contributes to a better understanding of the potential of these techniques, which are widely used as intensification tools in more sophisticated heuristic methods, such as evolutionary algorithms. different algorithms presented in the literature were implemented and compared to the proposed methods. the results of a computational experiment with 161 benchmark instances are reported. different statistical tests are applied in order to analyze the results provided by the experiments.