This article presents a flood risk analysis model that considers the spatially heterogeneous nature of flood events. The basic concept of this approach is to generate a large sample of flood events that can be regarded as temporal extrapolation of flood events. These are combined with cumulative flood impact indicators, such as building damages, to finally derive time series of damages for risk estimation. Therefore, a multivariate modeling procedure that is able to take into account the spatial characteristics of flooding, the regionalization method top-kriging, and three different impact indicators are combined in a model chain. Eventually, the expected annual flood impact (e.g., expected annual damages) and the flood impact associated with a low probability of occurrence are determined for a study area. The risk model has the potential to augment the understanding of flood risk in a region and thereby contribute to enhanced risk management of, for example, risk analysts and policymakers or insurance companies. The modeling framework was successfully applied in a proof-of-concept exercise in Vorarlberg (Austria). The results of the case study show that risk analysis has to be based on spatially heterogeneous flood events in order to estimate flood risk adequately.
The Flexible Job-Shop Scheduling Problem with Workers (FJSSP-W) introduces human workers into the production environment. This comes with additional complexity as well as potential sources of uncertainty. In addition to machine breakdowns, the FJSSP-W introduces stochastic processing times, emulating inconsistencies in worker behavior, as well as worker unavailability. While well-optimized schedules for the FJSSP-W can be obtained using efficient approaches, like Constraint Programming, such algorithms usually cannot handle uncertainties during optimization, and their solutions must be adjusted afterwards. Thus, the solution quality deteriorates significantly when the resulting schedules are exposed to the uncertainty simulations that more closely reflect real-world scenarios. However, Genetic Algorithms can incorporate the uncertainty simulations directly in their optimization process and have the potential to find robust scheduling solutions on the first attempt. This paper compares state-of-the-art Constraint Programming approaches with a Genetic Algorithm variant in terms of their robustness and performance loss on 27 noisy FJSSP-W benchmark instances. It compares the effects on service level, number of conflicts, and idle time in the found solutions. Even subsequently optimizing buffers in the Constraint Programming solutions, the Genetic Algorithm shows clear advantages in noisy conditions.