A survey of meta-heuristic solution methods for the quadratic assignment problem

zbMATH Open1211.90109MaRDI QIDQ5453776FDOQ5453776

Authors: Shahin Gelareh, Hasan Mishmast Nehi 

Publication date: 3 April 2008

Full work available at URL: http://www.m-hikari.com/ams/ams-password-2007/ams-password45-48-2007/nehiAMS45-48-2007.pdf

Recommendations

• A survey 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 heuristic method for the quadratic assignment problem
• scientific article; zbMATH DE number 1302195
• A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem

zbMATH Keywords

Quadratic Assignment ProblemGenetic AlgorithmsNeural NetworksAnt Colony OptimizationMeta-HeuristicNP-Hard problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)

Cited In (3)

• Embedding signed graphs in the line
• Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
• Title not available (Why is that?)

Uses Software

• QAPLIB
• ZRAM

This page was built for publication: A survey of meta-heuristic solution methods for the quadratic assignment problem

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