A New Genetic Algorithm for the Quadratic Assignment Problem
From MaRDI portal
Publication:2884562
DOI10.1287/ijoc.15.3.320.16076zbMath1238.90108OpenAlexW2123478933MaRDI QIDQ2884562
Publication date: 30 May 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.15.3.320.16076
Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (29)
Taking advantage of symmetry in some quadratic assignment problems ⋮ SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration ⋮ The extended concentric tabu for the quadratic assignment problem ⋮ Planning personnel retraining: column generation heuristics ⋮ A cooperative parallel tabu search algorithm for the quadratic assignment problem ⋮ A survey for the quadratic assignment problem ⋮ Assignment problems: a golden anniversary survey ⋮ The service allocation problem at the Gioia Tauro maritime terminal ⋮ New heuristic algorithms for solving the planar \(p\)-median problem ⋮ A hybrid method integrating an elite genetic algorithm with tabu search for the quadratic assignment problem ⋮ New variable-length data compression scheme for solution representation of meta-heuristics ⋮ Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches ⋮ An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems ⋮ A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP ⋮ An implementation of the iterated tabu search algorithm for the quadratic assignment problem ⋮ Deriving Convergence of Vehicle Routing Problems using a Fictitious Play Approach ⋮ Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem ⋮ Experimental analysis of crossover and mutation operators on the quadratic assignment problem ⋮ Backbone analysis and algorithm design for the quadratic assignment problem ⋮ Mapping the convergence of genetic algorithms ⋮ Repulsive assignment problem ⋮ Compounded genetic algorithms for the quadratic assignment problem ⋮ Iterated local search for the quadratic assignment problem ⋮ An ejection chain algorithm for the quadratic assignment problem ⋮ Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search ⋮ Directional approach to gradual cover: the continuous case ⋮ On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem ⋮ A Supervised Learning Approach Involving Active Subspaces for an Efficient Genetic Algorithm in High-Dimensional Optimization Problems ⋮ Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
This page was built for publication: A New Genetic Algorithm for the Quadratic Assignment Problem