An improved tabu search heuristic for solving facility layout design problems
From MaRDI portal
Publication:4230253
DOI10.1080/00207549608905045zbMath0929.90019OpenAlexW2150158501MaRDI QIDQ4230253
No author found.
Publication date: 1 March 1999
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207549608905045
Applications of mathematical programming (90C90) Production models (90B30) Combinatorial optimization (90C27)
Related Items
SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration ⋮ Tabu search algorithm for flexible flow path design of unidirectional automated-guided vehicle systems ⋮ Two-level modified simulated annealing based approach for solving facility layout problem ⋮ Improved tabu search heuristics for the dynamic space allocation problem ⋮ Mitigation of risk in facility layout design for single and multi-period problems ⋮ Heuristics for the dynamic facility layout problem with unequal-area departments ⋮ A tabu search heuristic for the dynamic space allocation problem
Cites Work
- KBSS: A knowledge-based system for scheduling in automated manufacturing
- Quadratic assignment problems
- An improved annealing scheme for the QAP
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach
- The facility layout problem
- Experimental analysis of simulated annealing based algorithms for the layout problem
- Simulated annealing for machine layout problems in the presence of zoning constraints
- A distance assignment approach to the facility layout problem
- Extensions of a tabu search adaptation to the quadratic assignment problem
- The Quadratic Assignment Problem
- Techniques for Facilities Layout: Deciding which Pairs of Activities Should be Adjacent
- A Perturbation Scheme to Improve Hillier’s Solution to the Facilities Layout Problem
- The Backboard Wiring Problem: A Placement Algorithm
- Assignment Problems and the Location of Economic Activities
- A heuristic algorithm for the quadratic assignment formulation to the plant layout problem
- Tabu Search Applied to the Quadratic Assignment Problem
- P-Complete Approximation Problems
- An exact branch-and-bound procedure for the quadratic-assignment problem
- An n‐step, 2‐variable search algorithm for the component placement problem
- Tree-search algorithms for quadratic assignment problems
This page was built for publication: An improved tabu search heuristic for solving facility layout design problems
