Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem
From MaRDI portal
Publication:614047
DOI10.1016/j.orl.2010.09.009zbMath1202.90176arXiv1010.0157OpenAlexW2146707341MaRDI QIDQ614047
Publication date: 23 December 2010
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.0157
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances ⋮ Fast simulated annealing for single-row equidistant facility layout ⋮ Revisiting simulated annealing: a component-based analysis ⋮ An experimental study of variable depth search algorithms for the quadratic assignment problem
Uses Software
Cites Work
- An improved annealing scheme for the QAP
- 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
- Simulated annealing and tabu search in the long run: A comparison on QAP tasks
- QAPLIB - a quadratic assignment problem library
- The quadratic assignment problem. Theory and algorithms
- Recent advances in the solution of quadratic assignment problems
- A tabu search algorithm for the quadratic assignment problem
- Solving large quadratic assignment problems on computational grids
- Probability distribution of solution time in GRASP: an experimental investigation
- Assignment Problems and the Location of Economic Activities
- Tabu Search Applied to the Quadratic Assignment Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem
