Efficient, parallelized global optimization of groundwater pumping in a regional aquifer with land subsidence...

The design of groundwater exploitation schedules with constraints on pumping-induced land subsidence is a computationally intensive task. Physical process-based groundwater flow and land subsidence simulations are high-dimensional, nonlinear, dynamic and computationally demanding, as they require solving large systems of partial differential equations (PDEs). This work is the first application of a parallelized surrogate-based global optimization algorithm to mitigate land subsidence issues by controlling the pumping schedule of multiple groundwater wellfields over space and time. The application was demonstrated in a 6500 km² region in China, involving a large-scale coupled groundwater flow-land subsidence model that is computationally expensive in terms of computational resources, including runtime and CPU memory for one single evaluation. In addition, the optimization problem contains 50 decision variables and up to 13 constraints, which adds to the computational effort, thus an efficient optimization is required. The results show that parallel DYSOC (dynamic search with surrogate-based constrained optimization) can achieve an approximately 100% parallel efficiency when upscaling computing resources. Compared with two other widely used optimization algorithms, DYSOC is 2-6 times faster, achieving computational cost savings of at least 50%. The findings demonstrate that the integration of surrogate constraints and dynamic search process can aid in the exploration and exploitation of the search space and accelerate the search for optimal solutions to complicated problems.