Combining Wang-Landau sampling algorithm and heuristics for solving the unequal-area dynamic facility layout problem
From MaRDI portal
Publication:1683146
DOI10.1016/j.ejor.2017.04.002zbMath1375.90166OpenAlexW2604392299MaRDI QIDQ1683146
Dawen Wang, Kun He, Yu Xue, Jing-Fa Liu
Publication date: 6 December 2017
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.04.002
global optimizationgroup decision makingheuristic strategiesdynamic facility layoutunequal-areaWang-Landau sampling algorithm
Nonconvex programming, global optimization (90C26) Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
A continuous districting model focusing on intra‐ and inter‐zonal squared distances and its Voronoi‐based heuristic, An integrated dynamic facility layout and job shop scheduling problem: a hybrid NSGA-II and local search algorithm
Cites Work
- A biased random-key genetic algorithm for the unequal area facility layout problem
- Applying ant system for solving unequal area facility layout problems
- Heuristics for the dynamic facility layout problem with unequal-area departments
- Algorithms for robust single and multiple period layout planning for manufacturing systems
- Flexible machine layout design for dynamic and uncertain production environments
- Optimal facility layout design
- Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem
- A New Mathematical-Programming Framework for Facility-Layout Design
- A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem
- Strategic Interpolative Design of Dynamic Manufacturing Systems Layouts
- Enhanced Model Formulations for Optimal Facility Layout
- The Dynamics of Plant Layout
- A simulated annealing algorithm for dynamic layout problem