Compounded genetic algorithms for the quadratic assignment problem

DOI10.1016/j.orl.2004.11.001zbMath1195.90090OpenAlexW1992562824MaRDI QIDQ2488198

Zvi Drezner

Publication date: 25 August 2005

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2004.11.001

zbMATH Keywords

Genetic algorithmQuadratic assignmentCompounded approach

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (9)

Facility layout problem with QAP formulation under scenario-based uncertainty ⋮ A survey for the quadratic assignment problem ⋮ Biologically inspired parent selection in genetic algorithms ⋮ An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems ⋮ Linear programming system identification: the general nonnegative parameters case ⋮ Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem ⋮ Mapping the convergence of genetic algorithms ⋮ Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search ⋮ Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods

Cites Work

• Unnamed Item
• Ranking scalar products to improve bounds for the quadratic assignment problem
• The quadratic assignment problem. Theory and algorithms
• A greedy genetic algorithm for the quadratic assignment problem
• The extended concentric tabu for the quadratic assignment problem
• A New Genetic Algorithm for the Quadratic Assignment Problem
• Comparison of iterative searches for the quadratic assignment problem

This page was built for publication: Compounded genetic algorithms for the quadratic assignment problem