Author:
Misevičius Alfonsas,Verenė Dovilė
Abstract
In this paper, we present a hybrid genetic-hierarchical algorithm for the solution of the quadratic assignment problem. The main distinguishing aspect of the proposed algorithm is that this is an innovative hybrid genetic algorithm with the original, hierarchical architecture. In particular, the genetic algorithm is combined with the so-called hierarchical (self-similar) iterated tabu search algorithm, which serves as a powerful local optimizer (local improvement algorithm) of the offspring solutions produced by the crossover operator of the genetic algorithm. The results of the conducted computational experiments demonstrate the promising performance and competitiveness of the proposed algorithm.
Subject
General Physics and Astronomy
Reference140 articles.
1. The quadratic assignment problem;Burkard,1998
2. Assignment Problems;Burkard,2009
3. The Quadratic Assignment Problem: Theory and Algorithms;Çela,1998
4. The Quadratic Assignment Problem
5. Assignment Problems and the Location of Economic Activities
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献