The complex formation mechanism and numerous influencing factors of urban waterlogging disasters make the identification of their risk an essential matter. This paper proposes a framework for identifying urban waterlogging risk that combines multi-source data fusion with hydrodynamics (MDF-H). The framework consists of a source data layer, a model parameter layer, and a calculation layer. Using multi-source data fusion technology, we processed urban meteorological information, geographic information, and municipal engineering information in a unified computation-oriented manner to form a deep fusion of a globalized multi-data layer. In conjunction with the hydrological analysis results, the irregular sub-catchment regions are divided and utilized as calculating containers for the localized runoff yield and flow concentration. Four categories of source data, meteorological data, topographic data, urban underlying surface data, and municipal and traffic data, with a total of 12 factors, are considered the model input variables to define a real-time and comprehensive runoff coefficient. The computational layer consists of three calculating levels: total study area, sub-catchment, and grid. The surface runoff inter-regional connectivity is realized at all levels of the urban road network when combined with hydrodynamic theory. A two-level drainage capacity assessment model is proposed based on the drainage pipe volume density. The final result is the extent and depth of waterlogging in the study area, and a real-time waterlogging distribution map is formed. It demonstrates a mathematical study and an effective simulation of the horizontal transition of rainfall into the surface runoff in a large-scale urban area. The proposed method was validated by the sudden rainstorm event in Futian District, Shenzhen, on 11 April 2019. The average accuracy for identifying waterlogging depth was greater than 95%. The MDF-H framework has the advantages of precise prediction, rapid calculation speed, and wide applicability to large-scale regions.

Natural disasters (e.g., floods, earthquakes) significantly impact citizens, economies, and the environment worldwide. Due to their sudden onset, devastating effects, and high uncertainty, it is crucial for emergency departments to take swift action to minimize losses. Among these actions, planning the locations of relief supply distribution centers and dynamically allocating supplies is paramount, as governments must prioritize citizens’ safety and basic living needs following disasters. To address this challenge, this paper develops a three-layer emergency logistics network to manage the flow of emergency materials, from warehouses to transfer stations to disaster sites. A bi-objective, multi-period stochastic integer programming model is proposed to solve the emergency location, distribution, and allocation problem under uncertainty, focusing on three key decisions: transfer station selection, upstream emergency material distribution, and downstream emergency material allocation. We introduce a multi-armed bandit algorithm, named the Geometric Greedy algorithm, to optimize transfer station planning while accounting for subsequent dynamic relief supply distribution and allocation in a stochastic environment. The new algorithm is compared with two widely used multi-armed bandit algorithms: the $ϵ$-Greedy algorithm and the Upper Confidence Bound (UCB) algorithm. A case study in the Futian District of Shenzhen, China, demonstrates the practicality of our model and algorithms. The results show that the Geometric Greedy algorithm excels in both computational efficiency and convergence stability. This research offers valuable guidelines for emergency departments in optimizing the layout and flow of emergency logistics networks.

The increasing impact of urban floods, driven by global climate change and the growing frequency of extreme weather events, poses significant threats to public safety, disrupts infrastructure, and hampers economic development. This paper presents a two-stage model for shortest path planning and dynamic dispatching of rescue forces (firefighters and fire engines) in response to urban floods caused by extreme rainfall. In the first stage, a path selection model for rescue vehicles is developed, supported by an efficient customized A* algorithm to determine worst-case travel times from fire stations to flood sites. A preference-based version of the algorithm is also introduced, incorporating driver preferences into path selection. In the second stage, rescue forces are dynamically allocated based on demand at flooded locations, which is estimated using population density and real-time flood depth data. The travel times derived in the first stage serve as inputs to a bi-objective dynamic dispatch model that utilizes real-time flood data to optimize emergency response. By integrating path planning with rescue force dispatching, this study provides essential support for effective flood response operations.