Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem

DOI10.1016/j.cor.2006.05.004zbMath1278.90463OpenAlexW1985109028MaRDI QIDQ2456632

Zvi Drezner

Publication date: 19 October 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2006.05.004

zbMATH Keywords

tabu searchgenetic algorithmsquadratic assignmentmemetic algorithmssimple tabu

Mathematics Subject Classification ID

Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (20)

A multi-parent genetic algorithm for the quadratic assignment problem ⋮ Facility layout problem with QAP formulation under scenario-based uncertainty ⋮ Taking advantage of symmetry in some quadratic assignment problems ⋮ SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration ⋮ AN EFFICIENT AND PRACTICALLY ROBUST HYBRID METAHEURISTIC ALGORITHM FOR SOLVING FUZZY BUS TERMINAL LOCATION PROBLEMS ⋮ Fast simulated annealing for single-row equidistant facility layout ⋮ On the unboundedness of facility layout problems ⋮ Biologically inspired parent selection in genetic algorithms ⋮ 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 ⋮ An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems ⋮ An implementation of the iterated tabu search algorithm for the quadratic assignment problem ⋮ Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study ⋮ Exact algorithms for the solution of the grey pattern quadratic assignment problem ⋮ An experimental study of variable depth search algorithms for the quadratic assignment problem ⋮ Effective formulation reductions for the quadratic assignment problem ⋮ An ejection chain algorithm for the quadratic assignment problem ⋮ Combining and solving sequence dependent traveling salesman and quadratic assignment problems in PCB assembly ⋮ Computing minimal doubly resolving sets of graphs ⋮ Two effective hybrid metaheuristic algorithms for minimization of multimodal functions

Uses Software

• HAS-QAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved annealing scheme for the QAP
• A thermodynamically motivated simulation procedure for combinatorial optimization problems
• A distance based rule for removing population members in genetic algorithms
• Ranking scalar products to improve bounds for the quadratic assignment problem
• Simulated jumping
• A genetic approach to the quadratic assignment problem
• The quadratic assignment problem. Theory and algorithms
• A greedy genetic algorithm for the quadratic assignment problem
• A tabu search algorithm for the quadratic assignment problem
• Solving large quadratic assignment problems on computational grids
• The extended concentric tabu for the quadratic assignment problem
• Compounded genetic algorithms for the quadratic assignment problem
• A New Genetic Algorithm for the Quadratic Assignment Problem
• Ant colonies for the quadratic assignment problem
• The Backboard Wiring Problem: A Placement Algorithm
• Assignment Problems and the Location of Economic Activities
• Tabu Search Applied to the Quadratic Assignment Problem
• Comparison of iterative searches for the quadratic assignment problem
• The Reactive Tabu Search
• Defining tabu list size and aspiration criterion within tabu search methods
• Gender-Specific Genetic Algorithms^*

This page was built for publication: Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem