Related Experiment Video
Updated: Aug 24, 2025

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
Published on: December 9, 2012
Comparison of parallel optimization algorithms on computationally expensive groundwater remediation designs
Min Pang1, Christine A Shoemaker2
1State Key Laboratory of Hydrology-Water Resources and Hydraulic Engineering, Hohai University, Nanjing, China; Yangtze Institute for Conservation and Development, Hohai University, Nanjing, China; College of Hydrology and Water Resources, Hohai University, Nanjing, China.
Parallel optimization significantly speeds up groundwater remediation design. The parallel stochastic radial basis function (p-SRBF) algorithm efficiently finds cost-effective solutions for contaminated aquifer cleanup.
Area of Science:
- Environmental Science
- Computational Science
- Optimization
Background:
- Contaminated groundwater poses global risks to human health and ecosystems.
- Groundwater remediation is vital but often hindered by high costs and computationally intensive design processes.
- Efficient planning requires evaluating numerous management decisions, demanding significant computational resources.
Purpose of the Study:
- To evaluate the performance of a novel parallel surrogate-based optimization algorithm, parallel stochastic radial basis function (p-SRBF), for groundwater remediation design.
- To assess the efficiency and effectiveness of p-SRBF compared to other parallel optimization algorithms on real-world contaminated aquifer problems.
- To demonstrate the potential of p-SRBF in accelerating cost-effective groundwater remediation planning.
Main Methods:
- Application of the parallel stochastic radial basis function (p-SRBF) algorithm to two superfund site case problems (Umatilla and Blaine Aquifers).
- Comparison of p-SRBF with genetic algorithm, mesh adaptive direct search, and asynchronous parallel pattern search optimization.
- Evaluation based on solution quality, computational cost reduction, and robustness across multiple trials using parallel computing up to 64 cores.
Main Results:
- p-SRBF achieved exceptional (superlinear) speedup with 4-16 cores and excellent speedup up to 64 cores, maintaining 80% efficiency.
- p-SRBF outperformed other algorithms, finding the optimal solution for both Umatilla and Blaine cases and reducing computational budget by at least 50%.
- Statistical analysis confirmed p-SRBF's superior performance over alternative methods at a 5% significance level.
Conclusions:
- p-SRBF is a highly effective and efficient algorithm for computationally demanding groundwater remediation design problems.
- The algorithm offers significant speedup and cost reduction, making it a promising tool for environmental management.
- This study advances theoretical and practical approaches to real-world groundwater cleanup strategies.
Related Concept Videos
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Fast Decoupled and DC Powerflow
Typical Model Studies
Design Example: Design of an Irrigation Channel
Design Example: Analyzing Capacity Contours for Flood Risk Assessment
Optimizing Chromatographic Separations
Band broadening refers to spreading solute bands as they travel through the column. This broadening can impact resolution. Plate height (H) represents the length required for one theoretical plate. A lower plate height corresponds to...

