Reliable Emergency Facility Location Planning Under Complex Polygonal Barriers and Facility Failure Risks

Emergency facility location and layout are critical to the efficiency of emergency rescue and resource allocation. However, practical emergency scenarios are plagued by two key challenges: the risk of facility failure due to various uncertain factors and the presence of complex polygonal barriers (including convex and concave polygons) that hinder transportation. Existing studies often overlook concave polygonal barriers or fail to prioritize time satisfaction, a core demand in emergency response. To address these gaps, this paper proposes a reliable emergency facility location optimization model with the objective of maximizing time satisfaction, considering constraints such as capacity, cost, and demand. The model integrates three key methods: a convex hull algorithm to convert concave barriers into convex ones for simplified calculation, a path optimization algorithm to find the shortest bypass routes around barriers, and an Artificial Ecosystem Optimization (AEO) algorithm to solve the nonlinear programming model. Through numerical experiments (single-facility, multi-facility, and medium-scale scenarios) and a practical case study in the Meknès region of Morocco for ambulance deployment, the feasibility and effectiveness of the model and algorithms are verified. The results show that the model achieves high time satisfaction (all above 0.8, with most exceeding 0.9) and efficiently optimizes facility locations and resource allocation. Sensitivity analysis indicates that increased failure risk parameters (α and θ) lead to a gradual decrease in average time satisfaction. This research provides a systematic mathematical model and practical method for emergency facility location decision-making, effectively addressing the challenges of complex barriers and facility failure.