Compounded genetic algorithms for the quadratic assignment problem

DOI10.1016/J.ORL.2004.11.001zbMATH Open1195.90090OpenAlexW1992562824MaRDI QIDQ2488198FDOQ2488198

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

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

Cites Work

• Title not available (Why is that?)
• The quadratic assignment problem. Theory and algorithms
• Comparison of iterative searches for the quadratic assignment problem
• A new genetic algorithm for the quadratic assignment problem
• A greedy genetic algorithm for the quadratic assignment problem
• The extended concentric tabu for the quadratic assignment problem
• Ranking scalar products to improve bounds for the quadratic assignment problem

Cited In (13)

• Efficient genetic algorithms using simple genes exchange local search policy for the quadratic assignment problem
• Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
• A survey for the quadratic assignment problem
• A new genetic representation for quadratic assignment problem
• Linear programming system identification: the general nonnegative parameters case
• Mapping the convergence of genetic algorithms
• Biologically inspired parent selection in genetic algorithms
• Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
• A genetic approach to the quadratic assignment problem
• Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
• Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
• An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems
• Facility layout problem with QAP formulation under scenario-based uncertainty

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2488198)