SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration

DOI10.1080/00207540802555744zbMath1197.90281MaRDI QIDQ3163728

Alberto Márquez, James H. Curry, Wei-Hang Zhu

Publication date: 26 October 2010

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540802555744

zbMATH Keywords

tabu search; quadratic assignment problem; SIMD; desktop parallel computing; graphics hardware acceleration

Mathematics Subject Classification ID

90B80: Discrete location and assignment

Related Items

Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems

Uses Software

• QAPLIB

Cites Work

• A survey for the quadratic assignment problem
• Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
• QAPLIB - a quadratic assignment problem library
• A greedy genetic algorithm for the quadratic assignment problem
• Massively parallel tabu search for the quadratic assignment problem
• Ant colony optimization for solving an industrial layout problem
• Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
• COSEARCH: A parallel cooperative metaheuristic
• A New Genetic Algorithm for the Quadratic Assignment Problem
• Tabu Search—Part I
• Comparison of iterative searches for the quadratic assignment problem
• An improved tabu search heuristic for solving facility layout design problems
• Quadratic assignment problem QAP with adaptable material handling devices
• Solving the facility and layout and location problem by ant-colony optimization-meta heuristic