Mathematical Programming for Optimal Evacuation in Industrial Facilities

This paper presents an optimization framework for determining safe and efficient evacuation paths in complex industrial facilities. The proposed approach models the evacuation process through a timed flow network that captures both the structural characteristics of the layout and the temporal evolution of emergency conditions. The formulation accommodates real-time updates, enabling dynamic re-routing when certain areas or connections become inaccessible. Computational experiments on large-scale instances demonstrate the scalability of the model and its ability to provide complete evacuation plans under increasing demand. The results confirm predictable relationships between population size, time horizon, and evacuation completion, supporting its use as a decision support tool for both strategic planning and operational response.