Hybrid population-based algorithms for the bi-objective quadratic assignment problem

Hybrid population-based algorithms for the bi-objective quadratic assignment problem

0.00 Avg rating0 Votes
Article ID: iaor20062888
Country: Netherlands
Volume: 5
Issue: 1
Start Page Number: 111
End Page Number: 137
Publication Date: Apr 2006
Journal: Journal of Mathematical Modelling and Algorithms
Authors: , ,
Keywords: quadratic assignment, ant system, tabu search
Abstract:

We present variants of an ant colony optimization (MO-ACO) algorithm and of an evolutionary algorithm (SPEA2) for tackling multi-objective combinatorial optimization problems, hybridized with an iterative improvement algorithm and the robust tabu search algorithm. The performance of the resulting hybrid stochastic local search (SLS) algorithms is experimentally investigated for the bi-objective quadratic assignment problem (bQAP) and compared against repeated applications of the underlying local search algorithms for several scalarizations. The experiments consider structured and unstructured bQAP instances with various degrees of correlation between the flow matrices. We do a systematic experimental analysis of the algorithms using outperformance relations and the attainment functions methodology to assess differences in the performance of the algorithms. The experimental results show the usefulness of the hybrid algorithms if the available computation time is not too limited and identify SPEA2 hybridized with very short tabu search runs as the most promising variant.

Reviews

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