A New Genetic Algorithm for the Quadratic Assignment Problem

From MaRDI portal
Revision as of 19:31, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2884562

DOI10.1287/ijoc.15.3.320.16076zbMath1238.90108OpenAlexW2123478933MaRDI QIDQ2884562

Zvi Drezner

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




Related Items (29)

Taking advantage of symmetry in some quadratic assignment problemsSIMD tabu search for the quadratic assignment problem with graphics hardware accelerationThe extended concentric tabu for the quadratic assignment problemPlanning personnel retraining: column generation heuristicsA cooperative parallel tabu search algorithm for the quadratic assignment problemA survey for the quadratic assignment problemAssignment problems: a golden anniversary surveyThe service allocation problem at the Gioia Tauro maritime terminalNew heuristic algorithms for solving the planar \(p\)-median problemA hybrid method integrating an elite genetic algorithm with tabu search for the quadratic assignment problemNew variable-length data compression scheme for solution representation of meta-heuristicsSolving the planar \(p\)-Median problem by variable neighborhood and concentric searchesAn efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problemsA Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAPAn implementation of the iterated tabu search algorithm for the quadratic assignment problemDeriving Convergence of Vehicle Routing Problems using a Fictitious Play ApproachExtensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problemExperimental analysis of crossover and mutation operators on the quadratic assignment problemBackbone analysis and algorithm design for the quadratic assignment problemMapping the convergence of genetic algorithmsRepulsive assignment problemCompounded genetic algorithms for the quadratic assignment problemIterated local search for the quadratic assignment problemAn ejection chain algorithm for the quadratic assignment problemQuadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu searchDirectional approach to gradual cover: the continuous caseOn the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problemA Supervised Learning Approach Involving Active Subspaces for an Efficient Genetic Algorithm in High-Dimensional Optimization ProblemsRecent 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