An Improved Hybrid Genetic Algorithm for the Quadratic Assignment Problem

Author(s):  
Seyda Melis Turkkahraman ◽  
Dindar Oz
2019 ◽  
Vol 48 (2) ◽  
pp. 335-356
Author(s):  
Evelina Stanevičienė ◽  
Alfonsas Misevičius ◽  
Armantas Ostreika

In this paper, we present the results of the extensive computational experiments with the hybrid genetic algorithm (HGA) for solving the grey pattern quadratic assignment problem (GP-QAP). The experiments are on the basis of the component-based methodology where the important algorithmic ingredients (features) of HGA are chosen and carefully examined. The following components were investigated: initial population, selection of parents, crossover procedures, number of offspring per generation, local improvement, replacement of population, population restart). The obtained results of the conducted experiments demonstrate how the methodical redesign (reconfiguration) of particular components improves the overall performance of the hybrid genetic algorithm.


2006 ◽  
Vol 2006 ◽  
pp. 1-16 ◽  
Author(s):  
Zvi Drezner ◽  
George A. Marcoulides

This paper examines the convergence of genetic algorithms using a cluster-analytic-type procedure. The procedure is illustrated with a hybrid genetic algorithm applied to the quadratic assignment problem. Results provide valuable insight into how population members are selected as the number of generations increases and how genetic algorithms approach stagnation after many generations.


Entropy ◽  
2021 ◽  
Vol 23 (1) ◽  
pp. 108
Author(s):  
Alfonsas Misevičius ◽  
Dovilė Verenė

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.


Sign in / Sign up

Export Citation Format

Share Document