Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances

DOI10.1016/J.COR.2013.10.007zbMath1348.90516OpenAlexW1991005923MaRDI QIDQ336931

Mohamed Saifullah Hussin, Thomas Stützle

Publication date: 10 November 2016

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

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

zbMATH Keywords

Quadratic Assignment ProblemSimulated AnnealingTabu Search

Mathematics Subject Classification ID

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

Related Items (9)

Effect of transformations of numerical parameters in automatic algorithm configuration ⋮ Anytime Pareto local search ⋮ A biased random key genetic algorithm for the field Technician scheduling problem ⋮ Fast simulated annealing for single-row equidistant facility layout ⋮ A methodology to exploit profit allocation in logistics joint distribution network optimization ⋮ A landscape-based analysis of fixed temperature and simulated annealing ⋮ Selection hyper-heuristics for the multi and many-objective quadratic assignment problem ⋮ An improved discrete PSO for tugboat assignment problem under a hybrid scheduling rule in container terminal ⋮ Revisiting simulated annealing: a component-based analysis

Uses Software

• HAS-QAP

Cites Work

• Unnamed Item
• Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem
• Comparison of the performance of modern heuristics for combinatorial optimization on real data
• An improved annealing scheme for the QAP
• A survey for the quadratic assignment problem
• Simulated annealing and tabu search in the long run: A comparison on QAP tasks
• The quadratic assignment problem. Theory and algorithms
• Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
• Ant colonies for the quadratic assignment problem
• Tabu Search Applied to the Quadratic Assignment Problem
• Comparison of iterative searches for the quadratic assignment problem
• The Reactive Tabu Search

This page was built for publication: Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances