A study of diversification strategies for the quadratic assignment problem
From MaRDI portal
Publication:1342106
DOI10.1016/0305-0548(94)90018-3zbMath0814.90060OpenAlexW2132842198MaRDI QIDQ1342106
James P. Kelly, Fred Glover, Manuel Laguna
Publication date: 11 January 1995
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(94)90018-3
simulated annealingtabu searchgenetic algorithmsquadratic assignmentheuristic searchdiversification strategies
Quadratic programming (90C20) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
Massively parallel tabu search for the quadratic assignment problem, Genetic algorithms and tabu search: Hybrids for optimization, A survey for the quadratic assignment problem, A molecular structure matching problem, Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem, TSP ejection chains, Solving the damper placement problem via local search heuristics, Location and layout planning. A survey, Diversification strategies in tabu search algorithms for the maximum clique problem, Metaheuristics: A bibliography, Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem, Scheduling using tabu search methods with intensification and diversification, Solving the multiple competitive facilities location problem, Diversification strategies in local search for a nonbifurcated network loading problem, Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
Uses Software
Cites Work
- Quadratic assignment problems
- Algorithms for assignment problems on an array processor
- A parallel tabu search algorithm for large traveling salesman problems
- Extensions of a tabu search adaptation to the quadratic assignment problem
- Applying tabu search with influential diversification to multiprocessor scheduling
- Solving the maximum clique problem using a tabu search approach
- Assignment Problems and the Location of Economic Activities
- Tabu Search Applied to the Quadratic Assignment Problem
- P-Complete Approximation Problems
- Bandwidth Packing: A Tabu Search Approach
