An implementation of the iterated tabu search algorithm for the quadratic assignment problem

DOI10.1007/S00291-011-0274-ZzbMATH Open1244.90129OpenAlexW2058029809MaRDI QIDQ443828FDOQ443828

Authors: Alfonsas Misevičius 

Publication date: 13 August 2012

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-011-0274-z

Recommendations

• A tabu search algorithm for the quadratic assignment problem
• Solving the quadratic assignment problem by the repeated iterated tabu search method
• Tabu Search Applied to the Quadratic Assignment Problem
• Extensions of a tabu search adaptation to the quadratic assignment problem
• An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems

zbMATH Keywords

heuristicsquadratic assignment problemmeta-heuristicstabu searchiterated tabu search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Cites Work

• QAPLIB - a quadratic assignment problem library
• Ant colonies for the quadratic assignment problem
• Tabu Search—Part I
• Assignment Problems and the Location of Economic Activities
• Title not available (Why is that?)
• Comparison of iterative searches for the quadratic assignment problem
• P-Complete Approximation Problems
• 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
• Record breaking optimization results using the ruin and recreate principle
• Iterated local search for the quadratic assignment problem
• Tabu Search—Part II
• Title not available (Why is that?)
• A cooperative parallel tabu search algorithm for the quadratic assignment problem
• A new genetic algorithm for the quadratic assignment problem
• Title not available (Why is that?)
• The Reactive Tabu Search
• Title not available (Why is that?)
• Title not available (Why is that?)
• Very large-scale neighborhood search for the quadratic assignment problem
• Algorithms for assignment problems on an array processor
• Optimizing simulated annealing schedules with genetic programming
• A tabu search algorithm for the quadratic assignment problem
• The extended concentric tabu for the quadratic assignment problem
• Combining simulated annealing with local search heuristics
• Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
• A hybrid metaheuristic for the quadratic assignment problem
• Title not available (Why is that?)

Cited In (12)

• Solving the quadratic assignment problem
• A penalty-based multi-objectivization approach for single objective optimization
• A hybrid method integrating an elite genetic algorithm with tabu search for the quadratic assignment problem
• Title not available (Why is that?)
• \(L_p\)-norm regularization algorithms for optimization over permutation matrices
• Taking advantage of symmetry in some quadratic assignment problems
• Extensions of a tabu search adaptation to the quadratic assignment problem
• Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles
• Iterated local search for the quadratic assignment problem
• Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
• An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems
• Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem

Uses Software

• QAPLIB
• Tabu search
• HAS-QAP

This page was built for publication: An implementation of the iterated tabu search algorithm for the quadratic assignment problem

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