Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
Authors:
- 1 April 1998
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 106 (2-3) , 457-488
Abstract
No abstract availableKeywords
This publication has 38 references indexed in Scilit:
- Massively parallel tabu search for the quadratic assignment problemAnnals of Operations Research, 1993
- CLASS: Computerized LAyout Solutions using Simulated annealingInternational Journal of Production Research, 1992
- A heuristic algorithm for the quadratic assignment formulation to the plant layout problemInternational Journal of Production Research, 1989
- Solving Quadratic Assignment Problems by ‘Simulated Annealing’IIE Transactions, 1987
- Facility Layout Optimization Using the Metropolis AlgorithmEnvironment and Planning B: Planning and Design, 1985
- An interactive model for the layout of buildingsApplied Mathematical Modelling, 1985
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problemNaval Research Logistics Quarterly, 1980
- An exact branch‐and‐bound procedure for the quadratic‐assignment problemNaval Research Logistics Quarterly, 1979
- Numerical investigations on quadratic assignment problemsNaval Research Logistics Quarterly, 1978
- Tree-search algorithms for quadratic assignment problemsNaval Research Logistics Quarterly, 1971