Applying an extended guided local search to the quadratic assignment problem
From MaRDI portal
Publication:1861943
DOI10.1023/A:1021857607524zbMath1026.90057OpenAlexW2166580144MaRDI QIDQ1861943
Patrick Mills, John A. Ford, Edward P. K. Tsang
Publication date: 10 March 2003
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1021857607524
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (11)
Ant colony optimization for solving an industrial layout problem ⋮ A guided local search metaheuristic for the team orienteering problem ⋮ A quadra-directional decomposition heuristic for a two-dimensional, non-equidistant machine-cell location problem ⋮ A survey for the quadratic assignment problem ⋮ A penalty-based multi-objectivization approach for single objective optimization ⋮ An iterated local search algorithm for a place scheduling problem ⋮ A survey on optimization metaheuristics ⋮ Towards a practical engineering tool for rostering ⋮ Experimental analysis of crossover and mutation operators on the quadratic assignment problem ⋮ Assignment problems with changeover cost ⋮ Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem
Uses Software
This page was built for publication: Applying an extended guided local search to the quadratic assignment problem
