Answers are grounded in this paper and cite their sources.
Linear and dynamic programming formulations are introduced for optimizing the placement of distributed best management practices (BMPs) at the watershed scale. The results of linear programming optimization of infiltration-based stormwater management BMPs are compared with the results of genetic algorithm (GA)optimization using a nonlinear distributed model. Additionally, linear and dynamic programming optimization of sediment-trapping BMPs are compared with GA optimization using a nonlinear distributed model. The results indicate that the solution to stormwater peak-flow reduction is influenced primarily by distributed-flow arrival time, and a linear programming analog to a nonlinear optimization model can efficiently reproduce much of the same solution structure. Linear and dynamic programming solutions to the storm sediment-management problem indicate natural sediment trapping is an important consideration, and a solution to the sediment-management-optimization problem can be efficiently found using a dynamic programming formulation.
No takes yet. Share an insight, caveat, or question.
Limbrunner et al. (2013) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: