Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem
From MaRDI portal
Publication:1776955
DOI10.1016/j.ejor.2003.01.002zbMath1112.90360OpenAlexW2077138150MaRDI QIDQ1776955
Günter Radons, Engelbert Westkämper, Thomas Dunker
Publication date: 12 May 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2003.01.002
Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Discrete location and assignment (90B80)
Related Items (15)
Recent advances in dynamic facility layout research ⋮ The zone-based dynamic facility layout problem ⋮ A Monte Carlo simulation based heuristic procedure for solving dynamic line layout problems for facilities using conventional material handling devices ⋮ A survey for the quadratic assignment problem ⋮ A problem evolution algorithm with linear programming for the dynamic facility layout problem -- a general layout formulation ⋮ Novel integer linear programming models for the facility layout problem with fixed-size rectangular departments ⋮ A systematic study on meta-heuristic approaches for solving the graph coloring problem ⋮ Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem ⋮ Combining Wang-Landau sampling algorithm and heuristics for solving the unequal-area dynamic facility layout problem ⋮ Collaborative optimization of workshop layout and scheduling ⋮ Multi-level departments-to-offices assignment with different room types ⋮ Integrating facility layout design and aisle structure in manufacturing systems: formulation and exact solution ⋮ A combined average-case and worst-case analysis for an integrated hub location and revenue management problem ⋮ A mathematical model and algorithms for the aircraft hangar maintenance scheduling problem ⋮ Heuristics for the dynamic facility layout problem with unequal-area departments
Cites Work
- A parametric approach to solving bicriterion shortest path problems
- Solutions for the constrained dynamic facility layout problem
- An interactive layout heuristic based on hexagonal adjacency graphs
- Flexible machine layout design for dynamic and uncertain production environments
- Genetic search and the dynamic facility layout problem
- Solution procedures for the dynamic facility layout problem
- Genetic search and the dynamic layout problem
- Strategic Interpolative Design of Dynamic Manufacturing Systems Layouts
- The Dynamics of Plant Layout
- Preprocessing for static and dynamic facility layout problems
- A Tabu-Search Heuristic for the Dynamic Plant Layout Problem
- A coevolutionary algorithm for a facility layout problem
- Facility layout design in a changing environment
- Adaptive Penalty Methods for Genetic Optimization of Constrained Combinatorial Problems
- A simulated annealing algorithm for dynamic layout problem
This page was built for publication: Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem
