Extensions of a tabu search adaptation to the quadratic assignment problem

From MaRDI portal
Publication:1342101

DOI10.1016/0305-0548(94)90015-9zbMath0812.90098OpenAlexW2038422702MaRDI QIDQ1342101

Jadranka Skorin-Kapov

Publication date: 15 May 1995

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

Full work available at URL: https://doi.org/10.1016/0305-0548(94)90015-9



Related Items

An extreme point algorithm for a local minimum solution to the quadratic assignment problem, Massively parallel tabu search for the quadratic assignment problem, Simulated annealing and tabu search: Lessons from a line search, A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows, A study of diversification strategies for the quadratic assignment problem, A survey for the quadratic assignment problem, Tabu search algorithm for flexible flow path design of unidirectional automated-guided vehicle systems, Detailed layout planning for irregularly-shaped machines with transportation path design, Location and layout planning. A survey, Expected part delays as a secondary layout criterion in automated manufacturing systems, Metaheuristics: A bibliography, An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems, FACOPT: A user friendly FACility layout OPTimization system., Improved tabu search heuristics for the dynamic space allocation problem, A hybrid metaheuristic for the quadratic assignment problem, An efficient tabu search procedure for the \(p\)-median problem, Heuristics for the dynamic facility layout problem with unequal-area departments, A tabu search heuristic for the dynamic space allocation problem, An improved tabu search heuristic for solving facility layout design problems, Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation


Uses Software


Cites Work