A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem
From MaRDI portal
Publication:3055216
DOI10.1080/00207540802376323zbMath1198.90271OpenAlexW2029464531MaRDI QIDQ3055216
Publication date: 7 November 2010
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540802376323
Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Recent advances in dynamic facility layout research, The zone-based dynamic facility layout problem, A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem: a robust optimization approach, Combining Wang-Landau sampling algorithm and heuristics for solving the unequal-area dynamic facility layout problem, A novel meta-heuristic algorithm for multi-objective dynamic facility layout problem, Mathematical modeling of optimal multi fuzzy locations of facilities based on the assumed step distance among them in a convex set
Cites Work
- Optimization by Simulated Annealing
- The facility layout problem
- Genetic search and the dynamic facility layout problem
- Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
- Future paths for integer programming and links to artificial intelligence
- Genetic search and the dynamic layout problem
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle
- Simulated annealing heuristics for the dynamic facility layout problem
- Hybrid ant systems for the dynamic facility layout problem
- An adaptive tabu-simulated annealing for concave cost transportation problems
- The Dynamics of Plant Layout
- A Tabu-Search Heuristic for the Dynamic Plant Layout Problem
- Jointly solving the group scheduling and machining speed selection problems: A hybrid tabu search and simulated annealing approach
- New heuristic for the dynamic layout problem
- A simulated annealing algorithm for dynamic layout problem