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

DOI10.1016/J.COR.2013.10.007MaRDI QIDQ336931zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem
• Simulated annealing and tabu search in the long run: A comparison on QAP tasks
• Tabu Search Applied to the Quadratic Assignment Problem
• scientific article; zbMATH DE number 1532439
• A tabu search algorithm for the quadratic assignment problem

Cites work

• scientific article; zbMATH DE number 1302195 (Why is no real title available?)
• A survey for the quadratic assignment problem
• An improved annealing scheme for the QAP
• Ant colonies for the quadratic assignment problem
• Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem
• Comparison of iterative searches for the quadratic assignment problem
• Comparison of the performance of modern heuristics for combinatorial optimization on real data
• Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
• Simulated annealing and tabu search in the long run: A comparison on QAP tasks
• Tabu Search Applied to the Quadratic Assignment Problem
• The Reactive Tabu Search
• The quadratic assignment problem. Theory and algorithms

Cited in

(11)

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

Describes a project that uses

Uses Software

• HAS-QAP

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

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