Date of Award


Degree Type


Degree Name

Doctor of Philosophy


Industrial Engineering

Major Professor

Anahita Khojandi

Committee Members

Xueping Li, Jon Mitchel Hathaway, Oleg Shylo


Increased urbanization, infrastructure degradation, and climate change threaten to overwhelm stromwater systems across the nation, rendering them ineffective. Green Infrastructure (GI) practices are low cost, low regret strategies that can contribute to urban runoff management. However, questions remain as to how to best distribute GI practices through urban watersheds given the precipitation uncertainty and the hydrological responses to them.First, we develop a two-stage stochastic robust programming model to determine the optimal placement of GI practices across a set of candidate locations in a watershed to minimize the total expected runoff under medium-term precipitation uncertainties. We develop a systemic approach to downscale the existing daily precipitation projections into hourly units and efficiently estimate the corresponding hydrological responses. We conduct a case study for an urban watershed in a mid-sized city in the U.S., perform sensitivity analyses and provide insights.Second, we develop a mathematical model to optimally place GI practices when (re-)designing an urban area, subject to uncertainties in population growth and future precipitation. Specifically, we develop a finite-horizon Markov decision process model to determine the extent to which GI practices need to be incorporated in different parts of a given urban area to maximize their benefits, considering the dynamic changes in population density and precipitation. We conduct a case study, perform sensitivity analyses and provide insights.Finally, we consider a problem of scheduling maintenance crew following a storm event to efficiently maintain GI practices across a watershed to mitigate surface runoff due to future events. Specifically, we investigate a condition for which the polyhedron of the flow shop scheduling problem is integer-optimal. This condition is used to construct a column generation algorithm to solve the problem to optimality. The solution approach is boosted with a heuristic that sequentially solves a series of linear programming models to generate a quality initial solution. The solution approach is also integrated with a commercial solver, which results in significant computational savings. Computational experiments show that the developed algorithm can efficiently solve test problems to near-optimality.

Files over 3MB may be slow to open. For best results, right-click and select "save as..."