A Hybrid Genetic-Hierarchical Algorithm for the Quadratic Assignment Problem

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.

Automated Graph Genetic Algorithm based Puzzle Validation for Faster Game Design

“…3) Hybrid Approach to Find Feasible Solutions: Note, that solutions produced by recombination and mutation do not necessarily result in feasible ones, since those operations are not guaranteed to satisfy the challenge constraints. As an extra step before accepting them, we repair those solutions by a process we call 'healing' to ensure that the final offspring solution is feasible, or valid [13], [16].…”

The Color Mix Problem

“…The principle of the used algorithm is similar to that of the hybrid genetic algorithm [15] (for more complete information on the functioning of genetic algorithms, the reader is referred to [16]), where global explorative/diversified search of the genetic operators is in teamwork with the local exploitative/intensified search. The exploitative search, in particular, is performed by the iterated hierarchical tabu search procedure (see Section 3.4.1).…”

Economic optimization scheduling of multi‐microgrid based on improved genetic algorithm

“…Evolutionary algorithms such as genetic algorithm (GA) [10][11][12][13], particle swarm optimization (PSO) [14][15][16][17], and gravitational search algorithm [18][19][20][21][22][23] show some advantages in solving the scheduling problem of microgrid. Liu et al [24] aimed to achieve optimal economic cost by establishing a micro-grid dispatching model with distributed energy, which takes into account the impact of grid connection and incorporates an adaptive weight strategy and Levy flight trajectory to enhance WOA's global search capability.…”

“…Evolutionary algorithms such as genetic algorithm (GA) [10–13], particle swarm optimization (PSO) [14–17], and gravitational search algorithm [18–23] show some advantages in solving the scheduling problem of microgrid. Liu et al.…”