Genetic search and the dynamic layout problem
From MaRDI portal
Publication:1977622
DOI10.1016/S0305-0548(99)00052-0zbMath0955.90052MaRDI QIDQ1977622
Jaydeep Balakrishnan, Chun Hung Cheng
Publication date: 17 May 2000
Published in: Computers \& Operations Research (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Marketing, advertising (90B60)
Related Items (14)
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 ⋮ A Monte Carlo simulation based heuristic procedure for solving dynamic line layout problems for facilities using conventional material handling devices ⋮ A novel meta-heuristic algorithm for multi-objective dynamic facility layout problem ⋮ Simulated annealing heuristics for the dynamic facility layout problem ⋮ Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem ⋮ A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem ⋮ Mitigation of risk in facility layout design for single and multi-period problems ⋮ A simulated annealing algorithm for dynamic layout problem ⋮ A tabu search heuristic for the dynamic space allocation problem ⋮ Hybrid ant systems for the dynamic facility layout problem ⋮ An extended discrete particle swarm optimization algorithm for the dynamic facility layout problem ⋮ A genetic algorithm approach for regrouping service sites
Cites Work
This page was built for publication: Genetic search and the dynamic layout problem
