From theory to application: investigating the generalizability of facility layout problems using a deep reinforcement learning approach
摘要
Generalization is a critical requirement for reinforcement learning (RL) models applied in production planning tasks such as facility layout optimization. This study investigates whether a single trained RL agent can generate efficient layouts across a diverse set of facility layout problems without retraining. To achieve this, we develop a scalable modeling approach using fixed-size image-based state representation and a static, masked action space, enabling consistent input–output dimensions regardless of layout size. The agent is trained using Proximal Policy Optimization (PPO) on a subset of layout instances and evaluated on unseen problem configurations that differ in machine count and flow matrix. Material handling cost (MHC) is used as the primary performance metric, calculated as the weighted sum of Euclidean distances between machine pairs. Our results show that the trained agent significantly outperforms initial random layouts across most test cases, demonstrating meaningful generalization. This approach offers practical benefits for scalable deployment in industrial environments where retraining for each new layout instance is often infeasible. This work establishes a foundation for adaptive, data-driven facility planning using deep reinforcement learning.