<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Water</journal-id>
<journal-title>Frontiers in Water</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Water</abbrev-journal-title>
<issn pub-type="epub">2624-9375</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/frwa.2025.1606096</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Water</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Stochastic multi-objective optimization for flood control in multi-reservoir systems: an adaptive Progressive Hedging approach with scenario clustering</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name><surname>Argoubi</surname> <given-names>Majdi</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/3012211/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/project-administration/"/>
<role content-type="https://credit.niso.org/contributor-roles/resources/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/formal-analysis/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name><surname>Mili</surname> <given-names>Khaled</given-names></name>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<xref ref-type="corresp" rid="c001"><sup>&#x0002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/2964786/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/data-curation/"/>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
</contrib>
</contrib-group>
<aff id="aff1"><sup>1</sup><institution>Department of Quantitative Methods, University of Sousse</institution>, <addr-line>Sousse</addr-line>, <country>Tunisia</country></aff>
<aff id="aff2"><sup>2</sup><institution>Department of Quantitative Methods, College of Business, King Faisal University</institution>, <addr-line>Al-Ahsa</addr-line>, <country>Saudi Arabia</country></aff>
<author-notes>
<fn fn-type="edited-by"><p>Edited by: Suvendu Roy, Khalisani Mahavidyalaya, India</p></fn>
<fn fn-type="edited-by"><p>Reviewed by: Cenk Sezen, Ondokuz May&#x00131;s University, T&#x000FC;rkiye</p>
<p>Yang Yunping, Tianjin Research Institute of Water Transport Engineering, China</p></fn>
<corresp id="c001">&#x0002A;Correspondence: Khaled Mili <email>Kmili&#x00040;kfu.edu.sa</email></corresp>
</author-notes>
<pub-date pub-type="epub">
<day>02</day>
<month>09</month>
<year>2025</year>
</pub-date>
<pub-date pub-type="collection">
<year>2025</year>
</pub-date>
<volume>7</volume>
<elocation-id>1606096</elocation-id>
<history>
<date date-type="received">
<day>04</day>
<month>04</month>
<year>2025</year>
</date>
<date date-type="accepted">
<day>14</day>
<month>08</month>
<year>2025</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x000A9; 2025 Argoubi and Mili.</copyright-statement>
<copyright-year>2025</copyright-year>
<copyright-holder>Argoubi and Mili</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/"><p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p></license>
</permissions>
<abstract>
<sec>
<title>Introduction</title>
<p>Flood-prone regions face growing challenges due to climate-induced variability, rapid urbanization, and competing demands on water infrastructure. Multi-reservoir systems play a critical role in mitigating flood damages, but climate change has intensified management complexity through increased hydroclimatic volatility and reduced reaction times for dam operators.</p>
</sec>
<sec>
<title>Methods</title>
<p>This study presents a stochastic multi-objective optimization framework that integrates ensemble-based inflow scenarios, high-resolution hydraulic simulations, and an adaptive version of the Progressive Hedging Algorithm enhanced by K-means scenario clustering. The approach was applied to Tunisia&#x00027;s Medjerda River basin, focusing on five interconnected reservoirs. The model balances downstream flood risk reduction with long-term water storage security by optimizing reservoir release policies across 1,000 synthetic inflow scenarios, reduced to 10 representative scenarios through clustering.</p>
</sec>
<sec>
<title>Results</title>
<p>The proposed method achieved robust performance with normalized objective values of 0.087 for storage security and 0.094 for flood control. More than 93% of simulated scenarios satisfied both storage and flood-related constraints, demonstrating superior reliability compared to traditional rule-based methods (60&#x02013;70%). The framework converged in 42 iterations with a computational time of 3.2 hours, representing a 6.7-fold reduction compared to full-scenario optimization while maintaining only 6&#x02013;7% performance degradation. Peak discharge reductions of 25&#x02013;30% were achieved through coordinated reservoir operations.</p>
</sec>
<sec>
<title>Discussion</title>
<p>The framework provides operationally feasible release policies that perform consistently across diverse flood conditions while significantly reducing computational costs. By combining hydrological realism with optimization scalability, this work supports the design of resilient and anticipatory flood management strategies in semi-arid regions, directly contributing to global efforts toward sustainable water governance (SDG 6), climate resilience (SDG 13), and disaster risk reduction in human settlements (SDG 11).</p>
</sec></abstract>
<kwd-group>
<kwd>stochastic multi-objective optimization</kwd>
<kwd>flood control</kwd>
<kwd>multi-reservoir systems</kwd>
<kwd>Progressive Hedging</kwd>
<kwd>scenario clustering</kwd>
<kwd>climate-resilient water management</kwd>
</kwd-group>
<contract-sponsor id="cn001">Deanship of Scientific Research, King Faisal University<named-content content-type="fundref-id">https://doi.org/10.13039/501100004686</named-content></contract-sponsor>
<counts>
<fig-count count="5"/>
<table-count count="5"/>
<equation-count count="31"/>
<ref-count count="46"/>
<page-count count="20"/>
<word-count count="11337"/>
</counts>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-at-acceptance</meta-name>
<meta-value>Water Resource Management</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec sec-type="intro" id="s1">
<title>1 Introduction</title>
<p>Extreme flood events pose significant risks to human settlements, infrastructure, and agricultural zones, particularly in semi-arid regions where rainfall is both intense and highly variable. Multi-reservoir systems play a critical role in mitigating flood damages by regulating river flows and storing excess water during peak inflows.</p>
<p>However, climate change has intensified these challenges. Global observations indicate a 10%&#x02013;20% increase in extreme precipitation events over recent decades, with Mediterranean regions experiencing a 15% rise in flood frequency since 1980 (<xref ref-type="bibr" rid="B19">IPCC, 2021</xref>). In Tunisia, recent decades have seen a shift toward shorter, more intense rainfall episodes, which overload reservoir inflow systems and reduce reaction time for dam operators. This increased hydroclimatic volatility complicates the management of interconnected reservoirs, especially when decision windows shrink from days to mere hours. Designing operational strategies for such systems is complex due to the spatial-temporal variability of hydrological processes and the conflicting objectives involved in reservoir management.</p>
<p>The economic consequences of inadequate flood management are substantial. Recent flood events in Mediterranean basins have caused damages exceeding &#x020AC;100 million per event, with the 2019 southeastern Spain floods alone resulting in &#x020AC;425 million in losses (<xref ref-type="bibr" rid="B9">European Environment Agency, 2021</xref>). These impacts underscore the urgent need for improved flood management strategies that can adapt to increasing hydrological uncertainty. In this context, this research aligns with the United Nations Sustainable Development Goals (SDGs), particularly SDG 6 (Clean Water and Sanitation), SDG 11 (Sustainable Cities and Communities), and SDG 13 (Climate Action), by promoting resilient water infrastructure and adaptive flood risk management under climate stress.</p>
<p>Flood-period reservoir operations must simultaneously address short-term emergency control&#x02013;by limiting downstream flood peaks&#x02013;and long-term sustainability concerns, such as preserving adequate water reserves for post-event water supply and energy production. These challenges are amplified in interconnected reservoir networks, where upstream decisions cascade through the system and affect downstream storage and flow dynamics. The complexity of such coordination is exemplified by historical events where uncoordinated reservoir releases have exacerbated downstream flooding despite individual reservoirs operating within design parameters (<xref ref-type="bibr" rid="B18">International Commission on Large Dams, 2018</xref>). Moreover, uncertainty in natural inflows caused by climate variability and forecast limitations further complicates the development of robust and effective control strategies. These dynamics require operational strategies that can rapidly adapt to unexpected inflow patterns, a task traditional static rules struggle to handle. The compound risk of simultaneous upstream inflows and downstream saturation makes multi-reservoir coordination under climate change stress a non-trivial challenge.</p>
<p>Traditional rule-based or deterministic optimization methods are often insufficient for managing such uncertainty, leading to either overly conservative or risk-prone operations. Studies have shown that conventional operating rules can result in 30%&#x02013;40% suboptimal performance under non-stationary conditions compared to adaptive strategies (<xref ref-type="bibr" rid="B12">Giuliani et al., 2021</xref>). As a result, there has been a growing shift toward stochastic optimization frameworks that explicitly incorporate inflow variability and assess performance across ensembles of hydrological scenarios. These frameworks enable the development of release policies that are not only feasible under a wide range of conditions but also balanced in their treatment of flood protection and water availability.</p>
<p>In this study, we focus on the Medjerda River basin in northern Tunisia, a flood-prone region whose water infrastructure is centered around a cascade of strategically interconnected reservoirs. The Medjerda system exemplifies the challenges facing semi-arid reservoir networks: it has experienced four major flood events in the past two decades (2003, 2007, 2009, 2018), each causing damages exceeding &#x020AC;50 million and affecting over 100,000 residents (<xref ref-type="bibr" rid="B36">United Nations Office for Disaster Risk Reduction, 2020</xref>). The system is highly sensitive to short-duration flood events due to its steep terrain and rapid runoff, while also facing long-term pressures from siltation and drought. The 2003 floods particularly highlighted coordination challenges, where sequential reservoir releases contributed to downstream peak flow amplification. These competing demands and demonstrated vulnerabilities make it an ideal testbed for evaluating advanced reservoir optimization methods.</p>
<p>We propose a novel stochastic multi-objective optimization model that aims to coordinate flood-season reservoir releases across the network. The framework integrates ensemble-based inflow modeling, hydraulic simulation of downstream water levels, and a scenario-based decomposition algorithm to generate robust and operationally viable control policies. The goal is to minimize flood risk at downstream control points while preserving storage security within each reservoir under a wide range of hydrological scenarios.</p>
<p>The remainder of this paper is organized as follows. Section 2 reviews related work on stochastic and multi-objective optimization for flood control. Section 3 presents the mathematical formulation, including system dynamics, objectives, and constraints. Section 4 introduces the proposed solution framework, which integrates adaptive Progressive Hedging with scenario clustering. Section 5 applies the method to the Medjerda reservoir system and analyzes the results. Section 6 discusses methodological contributions, practical implications, and limitations. Section 7 concludes the paper by summarizing key insights and outlining avenues for future research.</p>
</sec>
<sec id="s2">
<title>2 Literature review</title>
<p>Flood control in multi-reservoir systems under hydrological uncertainty represents one of the most challenging problems in water resources management. The complexity arises from the need to balance multiple conflicting objectives&#x02013;minimizing downstream flood risk while preserving storage for post-flood water supply, energy production, and irrigation demands&#x02013;all under conditions of uncertain and highly variable inflows. The increasing frequency and intensity of extreme weather events, driven by climate change, have amplified these challenges and motivated the development of sophisticated reservoir operation frameworks that integrate stochastic modeling, multi-objective optimization, and real-time decision support capabilities.</p>
<p>The explicit incorporation of inflow uncertainty into reservoir operation decisions has been a cornerstone of modern water management research. <xref ref-type="bibr" rid="B32">Schwanenberg et al. (2014)</xref> demonstrated the effectiveness of Sample Average Approximation (SAA) and scenario tree methods for flood mitigation at Brazil&#x00027;s Tres Marias reservoir, showing clear advantages over deterministic approaches in anticipating uncertain inflows. <xref ref-type="bibr" rid="B8">Draper (2001)</xref> advanced this field by proposing an implicit stochastic optimization framework with rolling-horizon implementation, which links short-term operational decisions through carryover storage values while avoiding unrealistic perfect foresight assumptions. These foundational approaches established the principle of prioritizing robustness over purely optimal but fragile solutions, a paradigm that continues to influence contemporary research.</p>
<p>Risk-aware multi-objective models have gained significant traction in addressing the inherent trade-offs between competing operational priorities. <xref ref-type="bibr" rid="B5">Chen et al. (2020)</xref> developed a pioneering real-time flood control model that integrates stochastic differential equations for risk assessment with the NSGA-III algorithm, effectively balancing upstream overtopping risks against downstream flood impacts. Building on these foundations, <xref ref-type="bibr" rid="B14">Guo et al. (2024)</xref> incorporated AI-generated ensemble flood forecasts and resilience indicators into a robust optimization framework, demonstrating how machine learning can enhance uncertainty representation. <xref ref-type="bibr" rid="B22">Liu and Luo (2019)</xref> extended this line of research by introducing reactive strategies within a dynamic multi-objective optimization model, enabling systems to adapt their operational priorities in response to evolving hydrological conditions.</p>
<p>The nonlinear, high-dimensional nature of multi-reservoir flood control problems has motivated extensive research into metaheuristic optimization algorithms. <xref ref-type="bibr" rid="B46">Zhang et al. (2019)</xref> applied the decomposition-based evolutionary algorithm MOEA/D-DE to flood operations at China&#x00027;s Ankang reservoir, achieving significant reductions in peak discharge while maintaining dam safety constraints. <xref ref-type="bibr" rid="B28">Moridi and Yazdi (2017)</xref> developed a more complex mixed-integer multi-objective model for coordinating flood control capacity and hydropower production across six reservoirs, solved using the &#x003B5;-constraint method. The diversity of algorithmic approaches reflects the complexity of the underlying optimization landscape, with <xref ref-type="bibr" rid="B29">Qi et al. (2016)</xref> introducing a memetic immune algorithm specifically designed for reservoir operation topologies, while <xref ref-type="bibr" rid="B24">Luo et al. (2015)</xref> proposed a hybrid PSO-EDA approach capable of learning inter-variable dependencies to improve convergence on complex Pareto fronts.</p>
<p>Contemporary research increasingly emphasizes the integration of machine learning techniques with traditional optimization approaches. <xref ref-type="bibr" rid="B45">Zanutto et al. (2025)</xref> developed reinforcement learning algorithms for processing multi-timescale forecast information in multipurpose reservoir operations, demonstrating improved reliability compared to conventional model predictive control approaches. <xref ref-type="bibr" rid="B11">Gegenleithner et al. (2024)</xref> advanced this integration further by proposing transformer-based deep reinforcement learning for multiobjective multihydropower reservoir optimization, achieving superior generalization capability compared to traditional evolutionary algorithms such as NSGA-III and MOEA/D. The coupling of optimization with real-time forecasting capabilities has emerged as a particularly promising research direction, with <xref ref-type="bibr" rid="B2">Becker et al. (2024)</xref> implementing moving-horizon ensemble forecast optimization to support adaptive decision-making, while <xref ref-type="bibr" rid="B27">Mohanty et al. (2025)</xref> developed coupled optimization frameworks that integrate hedging rules with detailed hydrodynamic modeling.</p>
<p>Research attention has increasingly focused on system-scale applications and emergency operational scenarios. <xref ref-type="bibr" rid="B39">Wang et al. (2022)</xref> addressed basin-wide coordination challenges by formulating a multi-objective optimization model for the coordinated operation of twelve major reservoirs in China&#x00027;s Yangtze River basin, highlighting both the potential and the computational challenges of these methods for large-scale, interconnected systems. <xref ref-type="bibr" rid="B1">Akbari et al. (2014)</xref> investigated emergency operation strategies for Iran&#x00027;s Abbaspour reservoir under damaged spillway conditions, combining short-term flood risk mitigation with long-term water supply objectives through a hybrid simulation-optimization framework. <xref ref-type="bibr" rid="B37">Uysal et al. (2018)</xref> demonstrated the practical application of Model Predictive Control enhanced by probabilistic inflow forecasts and scenario tree reduction techniques, showing improved flood control performance with reduced reliance on unnecessary spillway releases.</p>
<p>Progressive Hedging (PH), originally introduced by <xref ref-type="bibr" rid="B30">Rockafellar and Wets (1991)</xref>, has emerged as a robust technique for solving large-scale stochastic optimization problems through scenario-based decomposition. Its application to reservoir operations spans multiple contexts, including hydropower scheduling (<xref ref-type="bibr" rid="B40">Watkins and McKinney, 2000</xref>) and drought management (<xref ref-type="bibr" rid="B17">Huang et al., 2020</xref>). <xref ref-type="bibr" rid="B10">Gade et al. (2016)</xref> proposed adaptive penalty updates to accelerate convergence and improve solution stability, while <xref ref-type="bibr" rid="B41">Watson and Woodruff (2011)</xref> extended the method to enable parallel implementation for real-time operational contexts. Recent advances by <xref ref-type="bibr" rid="B42">Woodruff et al. (2023)</xref> introduced gradient-based methods for computing variable-dependent penalty parameters, achieving significant convergence improvements. <xref ref-type="bibr" rid="B6">Delikta&#x0015F; et al. (2024)</xref> further demonstrated the effectiveness of sample intelligence-based Progressive Hedging algorithms for facility location problems under uncertainty.</p>
<p>Parallel developments in scenario clustering have focused on reducing computational complexity while preserving solution quality. <xref ref-type="bibr" rid="B12">Giuliani et al. (2021)</xref> established theoretical foundations for intelligent scenario reduction techniques, while <xref ref-type="bibr" rid="B31">Schlenkrich and Parragh (2024)</xref> demonstrated practical applications of scenario reduction combined with advanced optimization methods for multi-stage problems. These approaches show promise for maintaining solution quality while dramatically reducing computational requirements.</p>
<p>The past five years have witnessed rapid progress in multi-objective optimization approaches for water resources management. <xref ref-type="bibr" rid="B38">Wang et al. (2023)</xref> introduced dynamic multi-objective optimization methods based on classification strategies, addressing the fundamental challenge of balancing population diversity with convergence in time-varying environments. <xref ref-type="bibr" rid="B43">Xu et al. (2024)</xref> developed hybrid artificial intelligence methods that combine deep learning with multi-objective optimization for reservoir development strategies, demonstrating the potential of integrated AI-optimization frameworks. Regional applications have also contributed important insights, with <xref ref-type="bibr" rid="B16">Hassan et al. (2021)</xref> presenting genetic algorithm approaches for multipurpose dam operation in Morocco, incorporating smoothing constraints to reduce policy fluctuations, while <xref ref-type="bibr" rid="B25">Mansouri et al. (2023)</xref> focused on simulation-optimization approaches for drought management in arid regions.</p>
<p>These recent developments collectively illustrate a clear shift toward integrated, adaptive, and AI-enhanced optimization methods for water resources management. These advances underscore the evolution toward practical, computation-ready frameworks&#x02013;yet several gaps remain, limiting their deployment in real-time flood control contexts.</p>
<p>Despite significant progress across multiple research fronts, several critical gaps limit the operational deployment of advanced stochastic optimization for multi-reservoir flood control. First, while scenario clustering and Progressive Hedging have been developed independently with demonstrated individual benefits, their systematic integration remains largely unexplored. Existing approaches typically either sacrifice computational efficiency through exhaustive scenario evaluation or compromise solution quality through oversimplified reduction techniques, creating a persistent trade-off between accuracy and tractability.</p>
<p>Second, recent improvements in Progressive Hedging focus primarily on single-objective optimization problems, with limited adaptation to contexts where trade-offs between risk mitigation and resource preservation must be dynamically managed. The specialized penalty adjustment mechanisms required for effective multi-objective optimization remain underdeveloped, particularly for applications where objective importance varies seasonally or in response to changing conditions.</p>
<p>Third, current stochastic approaches typically require prohibitive computational resources that prevent deployment in real-time flood management contexts where rapid decision support is essential. The scalability challenge becomes particularly acute for large-scale multi-reservoir systems where coordination complexity grows exponentially with system size, making traditional approaches impractical for operational use.</p>
<p>This study addresses these critical gaps through the first systematic integration of adaptive Progressive Hedging with intelligent scenario clustering, specifically designed for multi-reservoir flood control applications. The proposed framework bridges the computational tractability gap while maintaining solution robustness, enabling the transition from academic optimization concepts toward operational flood management tools. By combining established stochastic programming principles with novel algorithmic enhancements, our approach provides a comprehensive solution tailored to the urgent demands of climate-resilient water management under increasing uncertainty.</p>
</sec>
<sec id="s3">
<title>3 Mathematical model</title>
<sec>
<title>3.1 Problem formulation</title>
<p>This work addresses the problem of optimizing water release policies in a multi-reservoir system during flood events under uncertainty. A stochastic multi-objective optimization framework is developed to jointly manage two conflicting goals:</p>
<list list-type="bullet">
<list-item><p>Reducing downstream flood risk by regulating river levels at key control points;</p></list-item>
<list-item><p>Maintaining reservoir storage within operational bounds to avoid overtopping while ensuring post-flood water supply.</p></list-item>
</list>
<p>The system is modeled over a finite discrete time horizon. It incorporates:</p>
<list list-type="bullet">
<list-item><p>Spatially distributed reservoirs and downstream river monitoring points;</p></list-item>
<list-item><p>Temporally varying and stochastic inflows, modeled through a finite ensemble of inflow scenarios;</p></list-item>
<list-item><p>Operational constraints on reservoir storage capacities, release bounds, and system connectivity.</p></list-item>
</list>
<p>The decision variables are time-dependent reservoir releases. State variables include reservoir storage levels and river stages. The model evaluates policy robustness across inflow scenarios, enabling consistent performance under a wide range of flood conditions. The mathematical components&#x02013;variables, constraints, and objective functions&#x02013;are described in the following subsections.</p>
</sec>
<sec>
<title>3.2 Model components</title>
<p>The optimization framework is formulated over a discrete-time horizon and captures the dynamics of a multi-reservoir flood control system through a set of variables, stochastic inflows, and physical parameters:</p>
<p>Temporal and spatial structure. The system comprises <italic>M</italic> reservoirs and a finite planning horizon of <italic>T</italic> time steps <inline-formula><mml:math id="M1"><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>T</mml:mi></mml:mstyle></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mi>T</mml:mi></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:math></inline-formula> (e.g., 10-h intervals). Flood levels are monitored at a set of downstream control points <inline-formula><mml:math id="M2"><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>K</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>, where river stages <inline-formula><mml:math id="M3"><mml:msubsup><mml:mrow><mml:mi>h</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> [<italic>m</italic>] are evaluated for each <inline-formula><mml:math id="M4"><mml:mi>k</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>K</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>.</p>
<p>Decision and state variables. At each time <inline-formula><mml:math id="M5"><mml:mi>t</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>T</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula> and for each reservoir <italic>m</italic>&#x02208;{1, &#x02026;, <italic>M</italic>}, the decision variable <inline-formula><mml:math id="M6"><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> [<italic>m</italic><sup>3</sup>] denotes the volume released, while <inline-formula><mml:math id="M7"><mml:msubsup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> [<italic>m</italic><sup>3</sup>] represents the corresponding storage level. The variable <inline-formula><mml:math id="M8"><mml:msubsup><mml:mrow><mml:mi>h</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> captures river water level dynamics at control points.</p>
<p>Stochastic forcing. Natural inflows <inline-formula><mml:math id="M9"><mml:msubsup><mml:mrow><mml:mi>&#x003B7;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula>, defined over a discrete set of scenarios &#x003C9;&#x02208;&#x003A9;, account for hydrological uncertainty due to variable precipitation and runoff. These are generated via a scenario-based stochastic process introduced in the experimental design.</p>
<p>Cascade dynamics. For each reservoir <italic>m</italic>, total inflow is modeled as:</p>
<disp-formula id="E1"><mml:math id="M10"><mml:mrow><mml:msubsup><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:munder class="msub"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>A</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>m</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:munder></mml:mstyle><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x0002B;</mml:mo><mml:msubsup><mml:mrow><mml:mi>&#x003B7;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>
<p>where <inline-formula><mml:math id="M11"><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>A</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>m</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> denotes the set of direct upstream reservoirs discharging into <italic>m</italic>.</p>
<p>System constraints and physical limits. Each reservoir is constrained by a maximum capacity <inline-formula><mml:math id="M12"><mml:msubsup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">max</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>, a minimum security storage <inline-formula><mml:math id="M13"><mml:msubsup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">secu</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>, and admissible releases within <inline-formula><mml:math id="M14"><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mo class="qopname">min</mml:mo></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mo class="qopname">max</mml:mo></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>. At downstream points, water levels are evaluated against a desired threshold <inline-formula><mml:math id="M15"><mml:msubsup><mml:mrow><mml:mi>h</mml:mi></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">desired</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> and a flood warning threshold <inline-formula><mml:math id="M16"><mml:msubsup><mml:mrow><mml:mi>h</mml:mi></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">flood</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> to ensure regulatory compliance and flood mitigation.</p>
<p>These components define the structural and operational foundation of the system, supporting the formulation of multi-objective optimization goals and feasibility constraints discussed in subsequent sections.</p>
</sec>
<sec>
<title>3.3 Objective functions</title>
<p>The optimization model addresses two conflicting objectives: (i) maintaining sufficient reservoir storage after flood events, and (ii) minimizing downstream flood risk by regulating river levels. Each objective is evaluated over a set of stochastic inflow scenarios &#x003C9;&#x02208;&#x003A9;, and the overall performance is assessed through expectation.</p>
<p>(1) Reservoir storage security.</p>
<p>This objective ensures that post-flood storage levels remain above the minimum security threshold <inline-formula><mml:math id="M17"><mml:msubsup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">secu</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> for each reservoir. A quadratic penalty is applied to storage deficits across time and space. The expression is normalized with respect to the total potential deviation in the system:</p>
<disp-formula id="E2"><label>(1)</label><mml:math id="M18"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:mi>Q</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mstyle displaystyle="true"><mml:munder class="msub"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>T</mml:mi></mml:mstyle></mml:mrow></mml:mrow></mml:munder></mml:mstyle><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:msup><mml:mrow><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup><mml:mo>-</mml:mo><mml:msubsup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mtext class="textrm" mathvariant="normal">secu</mml:mtext></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#x000B7;</mml:mo><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:msup><mml:mrow><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mtext class="textrm" mathvariant="normal">max</mml:mtext></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup><mml:mo>-</mml:mo><mml:msubsup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mtext class="textrm" mathvariant="normal">secu</mml:mtext></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>This normalized formulation ensures comparability across reservoirs with different capacities.</p>
<p>(2) River level regulation.</p>
<p>This objective penalizes deviations of river stages <inline-formula><mml:math id="M19"><mml:msubsup><mml:mrow><mml:mi>h</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> from desired thresholds <inline-formula><mml:math id="M20"><mml:msubsup><mml:mrow><mml:mi>h</mml:mi></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">desired</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> at control points <inline-formula><mml:math id="M21"><mml:mi>k</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>K</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>. The penalty is scaled relative to the flood risk range, defined as the difference between the flood threshold and target level:</p>
<disp-formula id="E3"><label>(2)</label><mml:math id="M22"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mstyle displaystyle="true"><mml:munder class="msub"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>T</mml:mi></mml:mstyle></mml:mrow></mml:mrow></mml:munder></mml:mstyle><mml:mstyle displaystyle="true"><mml:munder class="msub"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>K</mml:mi></mml:mstyle></mml:mrow></mml:mrow></mml:munder></mml:mstyle><mml:msup><mml:mrow><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>h</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mo>-</mml:mo><mml:msubsup><mml:mrow><mml:mi>h</mml:mi></mml:mrow><mml:mrow><mml:mtext class="textrm" mathvariant="normal">desired</mml:mtext></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#x000B7;</mml:mo><mml:mstyle displaystyle="true"><mml:munder class="msub"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>K</mml:mi></mml:mstyle></mml:mrow></mml:mrow></mml:munder></mml:mstyle><mml:msup><mml:mrow><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>h</mml:mi></mml:mrow><mml:mrow><mml:mtext class="textrm" mathvariant="normal">flood</mml:mtext></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mo>-</mml:mo><mml:msubsup><mml:mrow><mml:mi>h</mml:mi></mml:mrow><mml:mrow><mml:mtext class="textrm" mathvariant="normal">desired</mml:mtext></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>This approach prioritizes control points with narrow safety margins and higher flood sensitivity.</p>
<sec>
<title>3.3.1 Stochastic multi-objective formulation</title>
<p>The model seeks to minimize the expected values of the two objectives over all inflow scenarios:</p>
<disp-formula id="E4"><label>(3)</label><mml:math id="M23"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mstyle displaystyle="true"><mml:munder class="msub"><mml:mrow><mml:mo class="qopname">min</mml:mo></mml:mrow><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>r</mml:mtext></mml:mstyle></mml:mrow></mml:munder></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mstyle mathvariant="double-struck"><mml:mi>E</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>Q</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mstyle mathvariant="double-struck"><mml:mi>E</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>This multi-objective structure captures the trade-off between short-term flood protection and long-term water availability. In practice, the problem can be solved using scalarization (e.g., weighted sums) or Pareto-front exploration to support informed decision-making under uncertainty.</p>
</sec>
</sec>
<sec>
<title>3.4 System constraints</title>
<p>The model is subject to a set of deterministic constraints that govern the physical behavior of the reservoir network and ensure operational feasibility. These constraints apply to all time steps <inline-formula><mml:math id="M24"><mml:mi>t</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>T</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>, reservoirs <italic>m</italic> &#x0003D; 1, &#x02026;, <italic>M</italic>, and inflow scenarios &#x003C9;&#x02208;&#x003A9;.</p>
<p>(a) Mass balance. Reservoir storage levels evolve over time according to the continuity equation, which conserves water volume between time steps:</p>
<disp-formula id="E5"><label>(4)</label><mml:math id="M25"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x0002B;</mml:mo><mml:msubsup><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>-</mml:mo><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mtext>&#x02003;</mml:mtext><mml:mtext class="textrm" mathvariant="normal">with&#x000A0;</mml:mtext><mml:msubsup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup><mml:mtext class="textrm" mathvariant="normal">&#x000A0;given.</mml:mtext></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>(b) Storage bounds. To prevent overtopping and ensure post-flood availability, each reservoir&#x00027;s storage must stay within its operational range:</p>
<disp-formula id="E6"><label>(5)</label><mml:math id="M26"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mtext class="textrm" mathvariant="normal">secu</mml:mtext></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x02264;</mml:mo><mml:msubsup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x02264;</mml:mo><mml:msubsup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mtext class="textrm" mathvariant="normal">max</mml:mtext></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>(c) Release constraints. Releases from each reservoir are bounded to reflect infrastructure capacities and operational limits:</p>
<disp-formula id="E7"><label>(6)</label><mml:math id="M27"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mo class="qopname">min</mml:mo></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x02264;</mml:mo><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x02264;</mml:mo><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mo class="qopname">max</mml:mo></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>(d) Inflow routing. The total inflow to a reservoir includes upstream releases and local (natural) inflows:</p>
<disp-formula id="E8"><label>(7)</label><mml:math id="M28"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:munder class="msub"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>A</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>m</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:munder></mml:mstyle><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x0002B;</mml:mo><mml:msubsup><mml:mrow><mml:mi>&#x003B7;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>Here, <inline-formula><mml:math id="M29"><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>A</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>m</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> denotes the set of reservoirs directly upstream of reservoir <italic>m</italic>, enabling the routing of flows through the network.</p>
<p>(e) River level estimation. Downstream river stages <inline-formula><mml:math id="M30"><mml:msubsup><mml:mrow><mml:mi>h</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> at each control point <inline-formula><mml:math id="M31"><mml:mi>k</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>K</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula> are computed externally using the HEC-RAS hydraulic model (<xref ref-type="bibr" rid="B3">Brunner, 2016</xref>). This model takes reservoir release sequences as inputs and simulates unsteady flow in open channels based on the one-dimensional Saint-Venant equations, widely used for river hydraulics and flood routing (<xref ref-type="bibr" rid="B4">Chaudhry, 2007</xref>):</p>
<list list-type="bullet">
<list-item><p>Continuity:</p></list-item>
</list>
<disp-formula id="E9"><label>(8)</label><mml:math id="M32"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mfrac><mml:mrow><mml:mi>&#x02202;</mml:mi><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x02202;</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:mfrac><mml:mo>&#x0002B;</mml:mo><mml:mfrac><mml:mrow><mml:mi>&#x02202;</mml:mi><mml:mi>Q</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x02202;</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:mfrac><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<list list-type="bullet">
<list-item><p>Momentum:</p></list-item>
</list>
<disp-formula id="E10"><label>(9)</label><mml:math id="M33"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mfrac><mml:mrow><mml:mi>&#x02202;</mml:mi><mml:mi>Q</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x02202;</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:mfrac><mml:mo>&#x0002B;</mml:mo><mml:mfrac><mml:mrow><mml:mi>&#x02202;</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x02202;</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:mfrac><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:msup><mml:mrow><mml:mi>Q</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:mfrac></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:mi>g</mml:mi><mml:mi>A</mml:mi><mml:mfrac><mml:mrow><mml:mi>&#x02202;</mml:mi><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x02202;</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:mfrac><mml:mo>&#x0002B;</mml:mo><mml:mi>g</mml:mi><mml:mi>Q</mml:mi><mml:mo>|</mml:mo><mml:mi>Q</mml:mi><mml:mo>|</mml:mo><mml:mfrac><mml:mrow><mml:msup><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mi>A</mml:mi><mml:msup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn><mml:mo>/</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:mfrac><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>In these equations, <italic>A</italic> is the cross-sectional area, <italic>Q</italic> is the discharge, <italic>H</italic> is the water surface elevation, <italic>R</italic> is the hydraulic radius, <italic>n</italic> is Manning&#x00027;s roughness coefficient, <italic>x</italic> is the longitudinal distance, and <italic>t</italic> is time.</p>
<p>HEC-RAS solves these equations using an implicit finite-difference scheme over a predefined river network geometry (<xref ref-type="bibr" rid="B35">U.S. Army Corps of Engineers, 2025</xref>). The resulting water levels <inline-formula><mml:math id="M34"><mml:msubsup><mml:mrow><mml:mi>h</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> are then passed back to the optimization model to evaluate flood risk via the objective function <italic>L</italic><sup>&#x003C9;</sup>.</p>
<p>This modular coupling enables high-resolution hydraulic simulation without embedding complex flow physics inside the optimization loop, while remaining flexible for integration with alternative solvers like TELEMAC (<xref ref-type="bibr" rid="B13">Goutal and Maurel, 2007</xref>) or MIKE 11 (<xref ref-type="bibr" rid="B7">DHI Water and Environment, 2017</xref>), which offer similar functionalities for unsteady open channel flow modeling.</p>
</sec>
<sec>
<title>3.5 Stochastic inflow modeling</title>
<p>To capture the uncertainty inherent in flood-period hydrology, natural inflows <inline-formula><mml:math id="M35"><mml:msubsup><mml:mrow><mml:mi>&#x003B7;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> are modeled as stochastic variables. This reflects variability in both rainfall events and catchment response, which directly influence reservoir inputs during extreme weather conditions. The stochastic inflow process is constructed through a combination of univariate extreme value modeling and multivariate scenario generation.</p>
<sec>
<title>3.5.1 Marginal distribution modeling</title>
<p>For each reservoir <italic>m</italic> and time step <italic>t</italic>, the marginal distribution of natural inflows is modeled using the Gumbel distribution, widely adopted in hydrological extremes analysis (<xref ref-type="bibr" rid="B20">Jenkinson, 1955</xref>; <xref ref-type="bibr" rid="B33">Stedinger et al., 1993</xref>). This choice is suitable for simulating flood scenarios due to its capacity to reproduce the statistical properties of annual maxima and high flow events. The probability density function is expressed as:</p>
<disp-formula id="E11"><label>(10)</label><mml:math id="M36"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x003B7;</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>;</mml:mo><mml:mi>&#x003BC;</mml:mi><mml:mo>,</mml:mo><mml:mi>&#x003B2;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>&#x003B2;</mml:mi></mml:mrow></mml:mfrac><mml:mo class="qopname">exp</mml:mo><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:mi>x</mml:mi><mml:mo>-</mml:mo><mml:mi>&#x003BC;</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x003B2;</mml:mi></mml:mrow></mml:mfrac><mml:mo>-</mml:mo><mml:mo class="qopname">exp</mml:mo><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:mi>x</mml:mi><mml:mo>-</mml:mo><mml:mi>&#x003BC;</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x003B2;</mml:mi></mml:mrow></mml:mfrac></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>Here, &#x003BC; and &#x003B2; are the location and scale parameters of the distribution. These parameters are calibrated individually for each reservoir using historical inflow records, typically through maximum likelihood estimation (MLE) or method of moments (<xref ref-type="bibr" rid="B26">Martins and Stedinger, 1984</xref>).</p>
</sec>
<sec>
<title>3.5.2 Multivariate scenario generation</title>
<p>To preserve spatial dependencies between reservoirs, a multivariate scenario generation approach is employed (<xref ref-type="bibr" rid="B44">Yates et al., 2005</xref>). Let &#x003BC;<sub><italic>t</italic></sub> denote the vector of expected inflows at time <italic>t</italic>, and let &#x003A3; be the covariance matrix representing the inter-reservoir dependencies derived from historical joint inflow data.</p>
<p>For each scenario &#x003C9;&#x02208;&#x003A9;, a correlated inflow vector <inline-formula><mml:math id="M37"><mml:msubsup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mi>&#x003B7;</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> is sampled using Cholesky decomposition (<xref ref-type="bibr" rid="B21">Lerman, 1980</xref>):</p>
<disp-formula id="E12"><label>(11)</label><mml:math id="M38"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mstyle mathvariant="bold-italic"><mml:mi>&#x003B7;</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003BC;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x0002B;</mml:mo><mml:mi>L</mml:mi><mml:mo>&#x000B7;</mml:mo><mml:msubsup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>z</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow></mml:msubsup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>L</italic> is the lower triangular matrix such that &#x003A3; &#x0003D; <italic>LL</italic><sup>&#x022A4;</sup>, and <inline-formula><mml:math id="M39"><mml:msubsup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>z</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> is a vector drawn from the standard multivariate normal distribution <inline-formula><mml:math id="M40"><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>N</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mi>I</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula>. This ensures that the synthetic inflow trajectories match both the marginal distributions and the spatial correlation structure observed in real data.</p>
</sec>
<sec>
<title>3.5.3 Scenario set construction</title>
<p>A total of |&#x003A9;| &#x0003D; 1, 000 inflow scenarios are generated, each covering a 60-day period with a temporal resolution of 10 h. These scenarios form the stochastic input space for the optimization model, enabling evaluation of release strategies under a wide spectrum of plausible flood conditions.</p>
</sec>
</sec>
<sec>
<title>3.6 Optimization framework and scenario evaluation</title>
<p>The optimization model is developed within an open-loop framework, in which all inflow scenarios are assumed to be fully known at the time of decision-making. This formulation yields a static release policy <bold>r</bold> defined over the entire planning horizon, independent of real-time feedback. While more conservative than closed-loop (adaptive) approaches, the open-loop structure is computationally efficient and suitable for offline planning applications where inflow forecasts are uncertain or unavailable.</p>
<p>A finite ensemble of inflow scenarios &#x003A9; &#x0003D; {&#x003C9;<sub>1</sub>, &#x003C9;<sub>2</sub>, &#x02026;, &#x003C9;<sub>|&#x003A9;|</sub>} is generated using the stochastic inflow model described in the previous section. For each candidate policy <bold>r</bold>, the reservoir system is simulated across all scenarios &#x003C9;&#x02208;&#x003A9;, and the corresponding objective values <italic>Q</italic><sup>&#x003C9;</sup> and <italic>L</italic><sup>&#x003C9;</sup> are evaluated.</p>
<p>The expected system performance is then defined as the mean of these values over the full scenario ensemble:</p>
<disp-formula id="E13"><label>(12)</label><mml:math id="M41"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mstyle mathvariant="double-struck"><mml:mi>E</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>Q</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mo>|</mml:mo><mml:mo>&#x003A9;</mml:mo><mml:mo>|</mml:mo></mml:mrow></mml:mfrac><mml:mstyle displaystyle="true"><mml:munder class="msub"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mo>&#x003A9;</mml:mo></mml:mrow></mml:munder></mml:mstyle><mml:msup><mml:mrow><mml:mi>Q</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:mtext>&#x02003;</mml:mtext><mml:msub><mml:mrow><mml:mstyle mathvariant="double-struck"><mml:mi>E</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mo>|</mml:mo><mml:mo>&#x003A9;</mml:mo><mml:mo>|</mml:mo></mml:mrow></mml:mfrac><mml:mstyle displaystyle="true"><mml:munder class="msub"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mo>&#x003A9;</mml:mo></mml:mrow></mml:munder></mml:mstyle><mml:msup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow></mml:msup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>This expectation-based formulation ensures that the resulting policy is not only feasible under uncertainty, but also robust in the sense that it minimizes average performance losses over a broad spectrum of hydrological realizations. Moreover, the use of multiple scenarios enables a comprehensive exploration of the trade-offs between flood control and storage retention, supporting the identification of Pareto-optimal operating strategies.</p>
<p>To reduce sampling error and ensure statistical representativeness, the scenario set &#x003A9; is constructed to preserve key probabilistic characteristics of the inflow process, including marginal distributions, spatial covariance structure, and temporal variability.</p>
</sec>
</sec>
<sec id="s4">
<title>4 Solution approach: adaptive Progressive Hedging with scenario clustering for multi-objective reservoir optimization</title>
<p>Building upon the need for robust reservoir operation strategies under hydrological uncertainty, we propose an enhanced solution framework based on the Progressive Hedging Algorithm (PHA). PHA is a scenario-based decomposition method particularly suited for large-scale stochastic programs with non-anticipativity constraints, where decisions must remain consistent across uncertain future realizations (<xref ref-type="bibr" rid="B30">Rockafellar and Wets, 1991</xref>; <xref ref-type="bibr" rid="B41">Watson and Woodruff, 2011</xref>).</p>
<p>In our context, each inflow scenario &#x003C9;&#x02208;&#x003A9; defines a subproblem in which a scenario-specific release policy <bold>r</bold><sup>&#x003C9;</sup> is optimized to minimize a weighted sum of the normalized objectives: the storage deviation <italic>Q</italic><sup>&#x003C9;</sup> and the river level deviation <italic>L</italic><sup>&#x003C9;</sup>:</p>
<disp-formula id="E14"><label>(13)</label><mml:math id="M42"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>r</mml:mtext></mml:mstyle></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mo>&#x003BB;</mml:mo><mml:msup><mml:mrow><mml:mi>Q</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>r</mml:mtext></mml:mstyle></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>-</mml:mo><mml:mo>&#x003BB;</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:msup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>r</mml:mtext></mml:mstyle></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where &#x003BB;&#x02208;[0, 1] is a scalarization parameter controlling the trade-off between post-flood storage security and downstream flood risk mitigation.</p>
<p>The classical PHA is extended in two key ways: (i) an adaptive penalty adjustment mechanism that improves convergence and robustness, and (ii) a scenario clustering step that reduces the effective number of subproblems and enhances scalability.</p>
<sec>
<title>4.1 Step-by-step procedure</title>
<sec>
<title>4.1.1 Scenario clustering</title>
<p>Solving a subproblem for every inflow scenario &#x003C9;&#x02208;&#x003A9; is computationally expensive, especially when each scenario encodes a full multivariate time series. To reduce dimensionality, we apply K-means clustering to group similar inflow trajectories and extract a reduced set of representative scenarios &#x003A9;&#x02032; (<xref ref-type="bibr" rid="B34">Steinschneider and Brown, 2015</xref>; <xref ref-type="bibr" rid="B15">Gupta et al., 2020</xref>).</p>
<p>Rather than clustering directly on raw time series data, we extract hydrologically meaningful summary features for each scenario, namely:</p>
<list list-type="bullet">
<list-item><p>Peak inflow magnitude (maximum value),</p></list-item>
<list-item><p>Time-to-peak (temporal index of the maximum),</p></list-item>
<list-item><p>Cumulative inflow volume (integrated inflow over time),</p></list-item>
<list-item><p>Intra-horizon variability (standard deviation).</p></list-item>
</list>
<p>These features are standardized to ensure scale invariance. K-means is then applied in the standardized feature space, and the centroid of each cluster is selected to form &#x003A9;&#x02032;&#x02282;&#x003A9;. The number of clusters (typically between 5 and 15) is chosen to strike a balance between scenario diversity and computational efficiency.</p>
<p>This approach retains the diversity of hydrological behavior while enabling stable and tractable optimization.</p>
</sec>
<sec>
<title>4.1.2 Initialization</title>
<p>For each representative scenario &#x003C9;&#x02208;&#x003A9;&#x02032;, a scenario-specific release policy <inline-formula><mml:math id="M43"><mml:mrow><mml:msubsup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>r</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula> is initialized, often as a flat release vector or based on historical averages. A global consensus policy <inline-formula><mml:math id="M44"><mml:mrow><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>r</mml:mtext></mml:mstyle></mml:mrow><mml:mo>&#x00304;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is initialized as the mean of the initial scenario policies. The initial penalty parameter &#x003C1;<sub>0</sub> is set (e.g., &#x003C1;<sub>0</sub> &#x0003D; 100) and is dynamically updated in subsequent iterations.</p>
<p>Solving Scenario Subproblems : At each iteration <italic>k</italic>, the algorithm solves the following penalized subproblem in parallel for all scenarios &#x003C9;&#x02208;&#x003A9;&#x02032;:</p>
<disp-formula id="E15"><label>(14)</label><mml:math id="M45"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>r</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mo class="qopname">arg</mml:mo><mml:mstyle displaystyle="true"><mml:munder class="msub"><mml:mrow><mml:mo class="qopname">min</mml:mo></mml:mrow><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>r</mml:mtext></mml:mstyle></mml:mrow></mml:munder></mml:mstyle><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>r</mml:mtext></mml:mstyle></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003C1;</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>|</mml:mo><mml:mo>|</mml:mo><mml:mstyle mathvariant="bold"><mml:mtext>r</mml:mtext></mml:mstyle><mml:mo>-</mml:mo><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>r</mml:mtext></mml:mstyle></mml:mrow><mml:mo class="qopname">&#x00304;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>|</mml:mo><mml:msup><mml:mrow><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>The penalty term encourages alignment with the shared policy <inline-formula><mml:math id="M46"><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>r</mml:mtext></mml:mstyle></mml:mrow><mml:mo>&#x00304;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> while still allowing some exploration.</p>
</sec>
<sec>
<title>4.1.3 Integration of hydraulic model outputs</title>
<p>After each scenario-specific policy <bold>r</bold><sup>&#x003C9;</sup> is updated, it is passed to an external hydraulic simulator (HEC-RAS) that returns the resulting river level trajectories <inline-formula><mml:math id="M47"><mml:msubsup><mml:mrow><mml:mi>h</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>. These outputs are used to compute <italic>L</italic><sup>&#x003C9;</sup>(<bold>r</bold>), which feeds back into the subproblem cost. This decoupled model ensures high-fidelity simulation without embedding full hydraulic equations into the optimization process.</p>
</sec>
<sec>
<title>4.1.4 Consensus update</title>
<p>The new consensus policy is computed as the average of updated scenario policies:</p>
<disp-formula id="E16"><label>(15)</label><mml:math id="M48"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>r</mml:mtext></mml:mstyle></mml:mrow><mml:mo>&#x00304;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mo>|</mml:mo><mml:msup><mml:mrow><mml:mo>&#x003A9;</mml:mo></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msup><mml:mo>|</mml:mo></mml:mrow></mml:mfrac><mml:mstyle displaystyle="true"><mml:munder class="msub"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi><mml:mo>&#x02208;</mml:mo><mml:msup><mml:mrow><mml:mo>&#x003A9;</mml:mo></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:munder></mml:mstyle><mml:msubsup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>r</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow></mml:msubsup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>This step gradually aligns the scenario-specific solutions toward a non-anticipative policy.</p>
</sec>
<sec>
<title>4.1.5 Adaptive penalty adjustment</title>
<p>To enhance convergence, the penalty coefficient &#x003C1; is updated based on the variance of the scenario-specific decisions:</p>
<disp-formula id="E17"><label>(16)</label><mml:math id="M49"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>&#x003C1;</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003C1;</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>&#x000B7;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x0002B;</mml:mo><mml:mi>&#x003B1;</mml:mi><mml:mo>&#x000B7;</mml:mo><mml:mtext class="textrm" mathvariant="normal">Var</mml:mtext><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>r</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>The adaptation rate &#x003B1; is a hyperparameter (typically between 0.1 and 0.5), selected via sensitivity analysis. This update strengthens non-anticipativity as consensus improves, while maintaining flexibility in early iterations.</p>
</sec>
<sec>
<title>4.1.6 Convergence criterion</title>
<p>The algorithm terminates once the policies across all scenarios converge sufficiently to the consensus:</p>
<disp-formula id="E18"><mml:math id="M50"><mml:mrow><mml:mo>|</mml:mo><mml:mo>|</mml:mo><mml:msubsup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>r</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow></mml:msubsup><mml:mo>-</mml:mo><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>r</mml:mtext></mml:mstyle></mml:mrow><mml:mo>&#x00304;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>|</mml:mo><mml:mo>|</mml:mo><mml:mo>&#x0003C;</mml:mo><mml:mi>&#x003F5;</mml:mi><mml:mo>,</mml:mo><mml:mtext>&#x02003;</mml:mtext><mml:mo>&#x02200;</mml:mo><mml:mi>&#x003C9;</mml:mi><mml:mo>&#x02208;</mml:mo><mml:msup><mml:mrow><mml:mo>&#x003A9;</mml:mo></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></disp-formula>
<p>At convergence, the policy <inline-formula><mml:math id="M51"><mml:mover accent="true"><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>r</mml:mtext></mml:mstyle></mml:mrow><mml:mo>&#x00304;</mml:mo></mml:mover></mml:math></inline-formula> constitutes a robust, scenario-agnostic release schedule optimized under inflow uncertainty.</p>
</sec>
</sec>
<sec>
<title>4.2 Implementation and workflow</title>
<p>The complete solution procedure is summarized in <xref ref-type="fig" rid="F6">Algorithm 1</xref>, which formalizes the iterative structure of the Adaptive Progressive Hedging method with scenario clustering. The corresponding computational pipeline is visualized in <xref ref-type="fig" rid="F1">Figure 1</xref>.</p>
<fig position="float" id="F6">
<label>Algorithm 1</label>
<caption><p>Adaptive progressive hedging with scenario clustering.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frwa-07-1606096-g0006.tif"/>
</fig>
<fig position="float" id="F1">
<label>Figure 1</label>
<caption><p>Workflow of the proposed adaptive Progressive Hedging framework with K-means scenario clustering and hydraulic simulation.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frwa-07-1606096-g0001.tif">
<alt-text>Flowchart depicting a process for generating a final release policy. The steps include generating inflow scenarios, extracting features and clustering via K-means, selecting representative scenarios, initializing PHA variables, solving subproblems with penalties, evaluating simulations via HEC-RAS, updating consensus and penalties, and checking for convergence. If convergence is achieved, the final release policy is output; otherwise, the process loops back.</alt-text>
</graphic>
</fig>
<p>The workflow begins with the generation of a large ensemble of inflow scenarios &#x003C9;&#x02208;&#x003A9; based on the stochastic inflow modeling process described in the previous section. Each scenario represents a multivariate inflow trajectory across all reservoirs over the simulation horizon.</p>
<p>To reduce computational complexity while preserving hydrological diversity, we apply K-means clustering to a transformed feature space. For each scenario, a vector of hydrologically relevant features is computed&#x02013;such as peak inflow, time-to-peak, cumulative volume, and standard deviation&#x02013;and standardized prior to clustering. One representative scenario (typically the centroid) is selected per cluster, forming the reduced scenario set &#x003A9;&#x02032; &#x02282; &#x003A9;.</p>
<p>The optimization process is initialized by assigning an initial release policy <inline-formula><mml:math id="M52"><mml:msubsup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>r</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> to each representative scenario, typically using a flat or heuristically-informed baseline. A global consensus policy <inline-formula><mml:math id="M53"><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>r</mml:mtext></mml:mstyle></mml:mrow><mml:mo>&#x00304;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> is computed as the average of the scenario-specific policies. The penalty coefficient &#x003C1;<sub>0</sub> is initialized to a fixed value and will evolve over the iterations to control inter-scenario coherence.</p>
<p>Each iteration of the PHA loop involves solving all scenario subproblems in parallel. For each &#x003C9;&#x02208;&#x003A9;&#x02032;, the release policy <bold>r</bold><sup>&#x003C9;</sup> is optimized using a penalized objective that balances individual scenario performance with proximity to the shared consensus policy. Once a candidate solution is obtained, it is passed to an external hydraulic simulation model (HEC-RAS) to evaluate downstream river levels and compute the flood penalty <italic>L</italic><sup>&#x003C9;</sup>. This ensures high-resolution evaluation of flood risk without embedding hydraulic equations directly into the optimization model.</p>
<p>After solving all subproblems, the consensus policy <inline-formula><mml:math id="M54"><mml:mover accent="true"><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>r</mml:mtext></mml:mstyle></mml:mrow><mml:mo>&#x00304;</mml:mo></mml:mover></mml:math></inline-formula> is updated by averaging the scenario-specific policies, and the penalty parameter &#x003C1; is adaptively increased based on the variance across scenario solutions. This feedback mechanism enforces stronger agreement as the algorithm converges.</p>
<p>The loop continues until all scenario-specific policies are sufficiently close to the consensus, as defined by a convergence threshold &#x003F5;. Upon termination, the final consensus policy <inline-formula><mml:math id="M55"><mml:mover accent="true"><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>r</mml:mtext></mml:mstyle></mml:mrow><mml:mo>&#x00304;</mml:mo></mml:mover></mml:math></inline-formula> represents a robust and non-anticipative reservoir release strategy optimized under uncertainty, incorporating both upstream storage targets and downstream flood constraints.</p>
</sec>
<sec>
<title>4.3 Algorithmic complexity and stability analysis</title>
<p>This section provides a theoretical foundation for understanding the computational characteristics, convergence properties, and scalability behavior of the proposed adaptive Progressive Hedging framework with scenario clustering.</p>
<sec>
<title>4.3.1 Time complexity analysis</title>
<p>The overall computational complexity can be decomposed into two main phases: scenario clustering and iterative Progressive Hedging optimization.</p>
<sec>
<title>4.3.1.1 Scenario clustering phase</title>
<p>The K-means clustering procedure operates on the original scenario set &#x003A9; to produce the reduced set &#x003A9;&#x02032;. The complexity is dominated by distance calculations and centroid updates:</p>
<disp-formula id="E19"><label>(17)</label><mml:math id="M64"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>C</mml:mi></mml:mstyle></mml:mrow></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>l</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>O</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:mo>&#x003A9;</mml:mo><mml:mo>|</mml:mo><mml:mo>&#x000B7;</mml:mo><mml:mi>F</mml:mi><mml:mo>&#x000B7;</mml:mo><mml:mo>|</mml:mo><mml:msup><mml:mrow><mml:mo>&#x003A9;</mml:mo></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msup><mml:mo>|</mml:mo><mml:mo>&#x000B7;</mml:mo><mml:msub><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mi>m</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>F</italic> is the feature dimension (4 hydrological features), |&#x003A9;&#x02032;| is the number of clusters, and <italic>I</italic><sub><italic>kmeans</italic></sub> is the number of K-means iterations. For typical values (|&#x003A9;| &#x0003D; 1, 000, |&#x003A9;&#x02032;| &#x0003D; 10, <italic>F</italic> &#x0003D; 4, <italic>I</italic><sub><italic>kmeans</italic></sub> &#x0003D; 50), this represents less than 1% of total computational cost.</p>
</sec>
<sec>
<title>4.3.1.2 Progressive Hedging iterations</title>
<p>Each PH iteration requires solving |&#x003A9;&#x02032;| quadratic programming subproblems in parallel. For each scenario &#x003C9;&#x02208;&#x003A9;&#x02032;, the subproblem involves optimizing over <italic>n</italic> &#x0003D; <italic>T</italic>&#x000D7;<italic>M</italic> decision variables subject to <inline-formula><mml:math id="M65"><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>O</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mi>M</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> constraints. Using interior-point methods, each subproblem has complexity <inline-formula><mml:math id="M66"><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>O</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mi>M</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mo>.</mml:mo><mml:mn>5</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
</sec>
<sec>
<title>4.3.1.3 Overall time complexity</title>
<p>With <italic>K</italic> iterations required for convergence, the total time complexity is:</p>
<disp-formula id="E20"><label>(18)</label><mml:math id="M67"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>C</mml:mi></mml:mstyle></mml:mrow></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>O</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:mo>&#x003A9;</mml:mo><mml:mo>|</mml:mo><mml:mo>&#x000B7;</mml:mo><mml:mi>F</mml:mi><mml:mo>&#x000B7;</mml:mo><mml:mo>|</mml:mo><mml:msup><mml:mrow><mml:mo>&#x003A9;</mml:mo></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msup><mml:mo>|</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>O</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>K</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mo>|</mml:mo><mml:msup><mml:mrow><mml:mo>&#x003A9;</mml:mo></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msup><mml:mo>|</mml:mo><mml:mo>&#x000D7;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mi>M</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mo>.</mml:mo><mml:mn>5</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>For our case study parameters, the dominant term yields approximately <inline-formula><mml:math id="M68"><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>O</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>4</mml:mn><mml:mo>.</mml:mo><mml:mn>2</mml:mn><mml:mo>&#x000D7;</mml:mo><mml:mn>1</mml:mn><mml:msup><mml:mrow><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mn>8</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> operations, providing theoretical justification for observed computational requirements.</p>
</sec>
</sec>
<sec>
<title>4.3.2 Space complexity analysis</title>
<sec>
<title>4.3.2.1 Memory requirements</title>
<p>The algorithm&#x00027;s memory footprint comprises three main components:</p>
<disp-formula id="E21"><label>(19)</label><mml:math id="M69"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>S</mml:mi></mml:mstyle></mml:mrow></mml:mrow><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>O</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:msup><mml:mrow><mml:mo>&#x003A9;</mml:mo></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msup><mml:mo>|</mml:mo><mml:mo>&#x000D7;</mml:mo><mml:mi>T</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mi>M</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mtext>&#x02003;</mml:mtext><mml:mtext class="textrm" mathvariant="normal">(scenario storage)</mml:mtext></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E22"><label>(20)</label><mml:math id="M70"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>S</mml:mi></mml:mstyle></mml:mrow></mml:mrow><mml:mrow><mml:mi>v</mml:mi><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mi>a</mml:mi><mml:mi>b</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>O</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:msup><mml:mrow><mml:mo>&#x003A9;</mml:mo></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msup><mml:mo>|</mml:mo><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x000D7;</mml:mo><mml:mi>T</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mi>M</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mtext>&#x02003;</mml:mtext><mml:mtext class="textrm" mathvariant="normal">(decision variables)</mml:mtext></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E23"><label>(21)</label><mml:math id="M71"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>S</mml:mi></mml:mstyle></mml:mrow></mml:mrow><mml:mrow><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>u</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>O</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:mo>&#x003A9;</mml:mo><mml:mo>|</mml:mo><mml:mo>&#x000D7;</mml:mo><mml:mi>F</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mtext>&#x02003;</mml:mtext><mml:mtext class="textrm" mathvariant="normal">(clustering features)</mml:mtext></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>Total space complexity:</p>
<disp-formula id="E24"><label>(22)</label><mml:math id="M72"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>S</mml:mi></mml:mstyle></mml:mrow></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>O</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:msup><mml:mrow><mml:mo>&#x003A9;</mml:mo></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msup><mml:mo>|</mml:mo><mml:mo>&#x000D7;</mml:mo><mml:mi>T</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mi>M</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mo>|</mml:mo><mml:mo>&#x003A9;</mml:mo><mml:mo>|</mml:mo><mml:mo>&#x000D7;</mml:mo><mml:mi>F</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>This linear scaling in both reduced scenario count and problem dimensions ensures memory requirements remain manageable even for large-scale applications.</p>
</sec>
</sec>
<sec>
<title>4.3.3 Convergence theory and stability</title>
<sec>
<title>4.3.3.1 Theoretical convergence guarantees</title>
<p>Under standard Progressive Hedging assumptions&#x02013;convexity of scenario subproblems and boundedness of the feasible region&#x02013;the algorithm converges to the optimal solution. For reservoir optimization, these conditions are satisfied because:</p>
<list list-type="bullet">
<list-item><p>Quadratic penalty terms ensure strict convexity of augmented subproblems,</p></list-item>
<list-item><p>Physical reservoir constraints define compact feasible regions,</p></list-item>
<list-item><p>Hydraulic simulation provides Lipschitz-continuous objective evaluations.</p></list-item>
</list>
</sec>
<sec>
<title>4.3.3.2 Convergence rate</title>
<p>Progressive Hedging exhibits linear convergence under regularity conditions:</p>
<disp-formula id="E25"><label>(23)</label><mml:math id="M73"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mo>|</mml:mo><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>r</mml:mtext></mml:mstyle></mml:mrow><mml:mo>&#x00304;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>r</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msup><mml:mo>|</mml:mo><mml:mo>|</mml:mo><mml:mo>&#x02264;</mml:mo><mml:mi>&#x003B3;</mml:mi><mml:mo>|</mml:mo><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>r</mml:mtext></mml:mstyle></mml:mrow><mml:mo>&#x00304;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>r</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msup><mml:mo>|</mml:mo><mml:mo>|</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where &#x003B3; &#x0003C; 1 is the convergence factor and <bold>r</bold><sup>&#x0002A;</sup> is the optimal consensus policy. The adaptive penalty mechanism typically achieves faster convergence by dynamically adjusting penalty parameters based on solution variance.</p>
</sec>
<sec>
<title>4.3.3.3 Numerical stability</title>
<p>The algorithm&#x00027;s stability is enhanced by several design features:</p>
<list list-type="bullet">
<list-item><p>Scenario clustering reduces condition numbers by eliminating redundant constraints,</p></list-item>
<list-item><p>Adaptive penalty bounds prevent numerical overflow during convergence,</p></list-item>
<list-item><p>L2-norm penalty terms ensure well-conditioned quadratic subproblems,</p></list-item>
<list-item><p>Hydraulic simulation decoupling isolates numerical sensitivities.</p></list-item>
</list>
</sec>
</sec>
<sec>
<title>4.3.4 Theoretical scalability properties</title>
<sec>
<title>4.3.4.1 Scaling with system size</title>
<p>The complexity dependence on reservoir count <italic>M</italic> appears in the (<italic>T</italic>&#x000D7;<italic>M</italic>)<sup>2.5</sup> term. However, the scenario-based decomposition structure and typical sparsity patterns in reservoir networks suggest more favorable practical scaling, closer to <inline-formula><mml:math id="M74"><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>O</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>M</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>.</mml:mo><mml:mn>2</mml:mn><mml:mo>-</mml:mo><mml:mn>1</mml:mn><mml:mo>.</mml:mo><mml:mn>5</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> for realistic topologies.</p>
</sec>
<sec>
<title>4.3.4.2 Scenario set scaling</title>
<p>The clustering phase scales linearly with |&#x003A9;|, while optimization cost depends only on |&#x003A9;&#x02032;|. This design ensures computational cost grows slowly with ensemble size, enabling the use of large scenario ensembles without proportional cost increases.</p>
</sec>
<sec>
<title>4.3.4.3 Parallel scalability</title>
<p>The scenario decomposition structure enables theoretical parallel efficiency up to |&#x003A9;&#x02032;| processors, with each scenario subproblem solved independently. Beyond this point, load balancing and communication overhead determine practical efficiency limits.</p>
</sec>
<sec>
<title>4.3.4.4 Algorithmic complexity bounds</title>
<p>For well-conditioned problems typical in reservoir operation, the following complexity bounds apply:</p>
<disp-formula id="E26"><label>(24)</label><mml:math id="M75"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mtext class="textrm" mathvariant="normal">Best case:</mml:mtext><mml:mtext>&#x02003;</mml:mtext><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>O</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:msup><mml:mrow><mml:mo>&#x003A9;</mml:mo></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msup><mml:mo>|</mml:mo><mml:mo>&#x000D7;</mml:mo><mml:mi>T</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mi>M</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mo class="qopname">log</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>/</mml:mo><mml:mi>&#x003F5;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E27"><label>(25)</label><mml:math id="M76"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mtext class="textrm" mathvariant="normal">Worst case:</mml:mtext><mml:mtext>&#x02003;</mml:mtext><mml:mrow><mml:mstyle mathvariant="script"><mml:mi>O</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:msup><mml:mrow><mml:mo>&#x003A9;</mml:mo></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msup><mml:mo>|</mml:mo><mml:mo>&#x000D7;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mi>M</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where &#x003F5; is the convergence tolerance. The adaptive penalty mechanism typically achieves performance closer to the best-case bound.</p>
<p>This theoretical analysis provides the mathematical foundation for understanding the algorithm&#x00027;s computational behavior and guides parameter selection for optimal performance across different problem scales and computational environments.</p>
</sec>
</sec>
</sec>
<sec>
<title>4.4 Reservoir network and system structure</title>
<p>The study focuses on the Medjerda reservoir system in northern Tunisia, which constitutes the backbone of the country&#x00027;s surface water infrastructure. The Medjerda River&#x02013;originating in northeastern Algeria and flowing 484 km eastward to the Mediterranean&#x02013;supplies over 80% of Tunisia&#x00027;s surface water resources. The region&#x00027;s semi-arid climate is marked by high spatiotemporal variability in rainfall, with frequent heavy downpours capable of triggering significant flood events, such as those recorded in 1969, 1973, 1986, 2003, 2007, and 2009.</p>
<p>The hydrographic network comprises five interconnected reservoirs organized in a mixed parallel-serial topology, as illustrated in <xref ref-type="fig" rid="F2">Figure 2</xref>: Ben Metir and Bou Heurtma operate in parallel and discharge into Kasseb. Kasseb and Mellegue, in turn, converge toward the terminal reservoir, Sidi Salem.</p>
<fig position="float" id="F2">
<label>Figure 2</label>
<caption><p>Schematic layout of the reservoir system: Ben Metir and Bou Heurtma flow into Kasseb; Kasseb and Mellegue discharge into Sidi Salem. Arrows indicate reservoir releases and external inflows.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frwa-07-1606096-g0002.tif">
<alt-text>Flowchart illustrating a network of nodes. At the top are &#x0201C;Ben Metir&#x0201D; and &#x0201C;Bou Heurtma,&#x0201D; connecting to &#x0201C;Kasseb.&#x0201D; &#x0201C;Bou Heurtma&#x0201D; also connects to &#x0201C;Mellegue.&#x0201D; &#x0201C;Kasseb&#x0201D; and &#x0201C;Mellegue&#x0201D; both direct to &#x0201C;Sidi Salem.&#x0201D; Each connection is labeled with variables and small arrows show the flow direction.</alt-text>
</graphic>
</fig>
<p>Each reservoir receives localized natural inflows <inline-formula><mml:math id="M77"><mml:msubsup><mml:mrow><mml:mi>&#x003B7;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>, representing stochastic runoff contributions during storm events. The controlled variables <inline-formula><mml:math id="M78"><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> represent operator-managed releases, routed downstream following the network&#x00027;s hydraulic structure. In the diagram, solid arrows indicate operational flows, while dashed arrows represent stochastic inflows.</p>
<p>Among these, Sidi Salem is the largest and most strategic reservoir in Tunisia. It accounts for over 51% of the total active storage capacity in the system and alone receives roughly 44.5% of the annual natural inflow. Its role is central to flood control, multi-seasonal water supply, and hydropower production. In addition to regulating excess flows from the three upstream reservoirs (Kasseb, Bou Heurtma, Mellegue), it supplies water to major demand zones, including Greater Tunis and central Tunisia. However, the reservoir is also subject to siltation, which poses long-term sustainability concerns for both flood mitigation and water supply.</p>
<p>The objective of the optimization framework is to coordinate reservoir operations across this complex network to achieve two goals: reduce the risk of downstream flooding along the Medjerda floodplain and preserve sufficient storage in all reservoirs, particularly Sidi Salem, to meet post-event and seasonal water demands.</p>
</sec>
<sec>
<title>4.5 Data and inflow scenario generation</title>
<p>Reservoir storage, release, and network topology data are based on historical records provided by Tunisia&#x00027;s national water agency. However, in order to assess system performance under uncertain flood conditions, natural inflows are synthetically generated using a probabilistic approach.</p>
<sec>
<title>4.5.1 Inflow scenario generation</title>
<p>Natural inflow trajectories were generated synthetically using a Gumbel distribution, which is appropriate for modeling extreme hydrological events. The distribution parameters were calibrated to approximate the historical inflow characteristics for each reservoir, as summarized in <xref ref-type="table" rid="T1">Table 1</xref>.</p>
<table-wrap position="float" id="T1">
<label>Table 1</label>
<caption><p>Key characteristics of the reservoirs in the Sidi Salem system.</p></caption>
<table frame="box" rules="all">
<thead>
<tr>
<th valign="top" align="left" rowspan="2"><bold>Reservoir</bold></th>
<th valign="top" align="center"><bold>Annual inflow</bold></th>
<th valign="top" align="center"><bold>Min inflow</bold></th>
<th valign="top" align="center"><bold>Storage capacity</bold></th>
<th valign="top" align="center"><bold>Max release</bold></th>
</tr>
<tr>
<th valign="top" align="center"><bold>(Mm<sup>3</sup>)</bold></th>
<th valign="top" align="center"><bold>(Mm<sup>3</sup>)</bold></th>
<th valign="top" align="center"><bold>(Mm<sup>3</sup>)</bold></th>
<th valign="top" align="center"><bold>(m<sup>3</sup>/s)</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Mellegue</td>
<td valign="top" align="center">117,250</td>
<td valign="top" align="center">36,200</td>
<td valign="top" align="center">147,540</td>
<td valign="top" align="center">5,400</td>
</tr>
<tr>
<td valign="top" align="left">Ben Metir</td>
<td valign="top" align="center">41,187</td>
<td valign="top" align="center">3,740</td>
<td valign="top" align="center">57,630</td>
<td valign="top" align="center">610</td>
</tr>
<tr>
<td valign="top" align="left">Kasseb</td>
<td valign="top" align="center">46,288</td>
<td valign="top" align="center">7,840</td>
<td valign="top" align="center">69,620</td>
<td valign="top" align="center">460</td>
</tr>
<tr>
<td valign="top" align="left">Sidi Salem</td>
<td valign="top" align="center">120,789</td>
<td valign="top" align="center">8,388</td>
<td valign="top" align="center">1,098,000</td>
<td valign="top" align="center">2,500</td>
</tr>
<tr>
<td valign="top" align="left">Bou Heurtma</td>
<td valign="top" align="center">447,000</td>
<td valign="top" align="center">94,288</td>
<td valign="top" align="center">762,000</td>
<td valign="top" align="center">5,260</td>
</tr></tbody>
</table>
</table-wrap>
<p>To account for spatial dependence between upstream catchments, multivariate inflow vectors were produced using Cholesky decomposition of a manually defined covariance matrix. This method preserves both the marginal distributions and the cross-correlations between inflows at different reservoirs.</p>
<p>A total of 1,000 inflow scenarios were created, each simulating a 60-day winter flood season, discretized into 144 time steps (10-h intervals). To reduce computational complexity while maintaining diversity, the full ensemble was reduced to a representative subset of |&#x003A9;&#x02032;| &#x0003D; 10 scenarios using K-means clustering. Clustering was applied not to the raw time series but to hydrologically relevant features extracted from each scenario: peak inflow magnitude, time to peak, cumulative volume, and intra-period standard deviation. All features were standardized to ensure scale invariance prior to clustering. Details of the clustering methodology are presented in Section 4.</p>
</sec>
<sec>
<title>4.5.2 Hydraulic routing and river level evaluation</title>
<p>Flood risk downstream of Sidi Salem is evaluated using a hydraulic routing model implemented in HEC-RAS. For each scenario &#x003C9; and corresponding release strategy <bold>r</bold><sup>&#x003C9;</sup>, the model simulates unsteady river flow and computes the resulting stage levels <inline-formula><mml:math id="M79"><mml:msubsup><mml:mrow><mml:mi>h</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> at key downstream control points.</p>
<p>The HEC-RAS model is used in a decoupled manner as a black-box simulator. This allows the optimization process to remain modular while benefiting from high-fidelity hydrodynamic simulations. The resulting river stages are then used to evaluate the river-level deviation term <italic>L</italic><sup>&#x003C9;</sup> in the objective function.</p>
</sec>
<sec>
<title>4.5.3 Simulation setup and objective weighting</title>
<p>The simulation horizon spans 60 days, covering the winter flood season from December to January, with a temporal resolution of 10 h, resulting in 144 time steps. The optimization is initialized with a uniform release policy and executed using the Adaptive Progressive Hedging algorithm with scenario clustering, as detailed in Section 4.</p>
<p>Unless otherwise specified, |&#x003A9;&#x02032;| &#x0003D; 10 representative scenarios are used for optimization. The objective function uses a scalarization parameter &#x003BB; &#x0003D; 0.5 to give equal weight to flood mitigation and reservoir storage objectives.</p>
<p>All simulations are implemented in Python, with parallel computation across scenarios to improve efficiency. The entire workflow is executed on a high-performance computing platform.</p>
</sec>
</sec>
</sec>
<sec id="s5">
<title>5 Results and analysis</title>
<p>This section presents the outcomes of applying the proposed optimization framework to the Sidi Salem multi-reservoir system, over a synthetic 60-day winter flood period. The goal is to evaluate the method&#x00027;s ability to balance flood mitigation and reservoir storage management under hydrological uncertainty.</p>
<sec>
<title>5.1 Performance of the adaptive PHA framework</title>
<p>The Adaptive Progressive Hedging Algorithm (PHA) with scenario clustering was executed using a reduced set of 10 representative inflow scenarios (|&#x003A9;&#x02032;| &#x0003D; 10), extracted from an original ensemble of 1,000. The algorithm converged in an average of 42 iterations, requiring &#x0007E;3.2 h on a parallel computing platform with 16 cores.</p>
<p>The resulting consensus release policy <inline-formula><mml:math id="M80"><mml:mover accent="true"><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>r</mml:mtext></mml:mstyle></mml:mrow><mml:mo>&#x00304;</mml:mo></mml:mover></mml:math></inline-formula> achieved the following expected (normalized) objective values:</p>
<list list-type="bullet">
<list-item><p>Storage security deviation: &#x1D53C;[<italic>Q</italic><sup>&#x003C9;</sup>] &#x0003D; 0.087,</p></list-item>
<list-item><p>River level deviation: &#x1D53C;[<italic>L</italic><sup>&#x003C9;</sup>] &#x0003D; 0.094.</p></list-item>
</list>
<p>These results indicate a robust and well-balanced solution. More than 93% of the simulated scenarios respected both storage and flood-related constraints, confirming the framework&#x00027;s ability to handle uncertainty while preserving system resilience.</p>
<sec>
<title>5.1.1 Interpretation of performance metrics</title>
<p>The normalized objective values around 0.09 suggest that the system operates within a 9% deviation from ideal conditions. This level of performance is significant given the stochastic nature of inflows and the dual objectives involved. The 93% constraint satisfaction rate substantially outperforms traditional rule-based methods, which typically achieve only 60&#x02013;70% reliability under comparable uncertainty conditions (<xref ref-type="bibr" rid="B23">Loucks and Van Beek, 2005</xref>).</p>
<p>The balanced performance between storage security (&#x1D53C;[<italic>Q</italic><sup>&#x003C9;</sup>] &#x0003D; 0.087) and flood control (&#x1D53C;[<italic>L</italic><sup>&#x003C9;</sup>] &#x0003D; 0.094) underscores the effectiveness of the multi-objective formulation.</p>
</sec>
</sec>
<sec>
<title>5.2 Comparison with alternative strategies</title>
<p>To assess the benefits of each methodological enhancement, three framework variants were compared:</p>
<list list-type="order">
<list-item><p>Adaptive PHA with clustering: full implementation of the proposed method.</p></list-item>
<list-item><p>Static PHA with clustering: constant penalty coefficient &#x003C1; &#x0003D; 100.</p></list-item>
<list-item><p>Adaptive PHA without clustering: full 1,000-scenario solution without dimensionality reduction.</p></list-item>
</list>
<p>As summarized in <xref ref-type="table" rid="T2">Table 2</xref>, adaptive penalty adjustment improves both convergence and objective performance. Full-scenario optimization offers marginally better outcomes at significantly greater computational cost, while scenario clustering provides an efficient compromise.</p>
<table-wrap position="float" id="T2">
<label>Table 2</label>
<caption><p>Comparison of optimization strategies.</p></caption>
<table frame="box" rules="all">
<thead>
<tr>
<th valign="top" align="left"><bold>Method</bold></th>
<th valign="top" align="center"><bold>&#x1D53C;[<italic>Q</italic><sup>&#x003C9;</sup>]</bold></th>
<th valign="top" align="center"><bold>&#x1D53C;[<italic>L</italic><sup>&#x003C9;</sup>]</bold></th>
<th valign="top" align="center"><bold>Runtime (h)</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Adaptive PHA &#x0002B; clustering</td>
<td valign="top" align="center">0.087</td>
<td valign="top" align="center">0.094</td>
<td valign="top" align="center">3.2</td>
</tr>
<tr>
<td valign="top" align="left">Static PHA &#x0002B; clustering</td>
<td valign="top" align="center">0.103</td>
<td valign="top" align="center">0.114</td>
<td valign="top" align="center">2.9</td>
</tr>
<tr>
<td valign="top" align="left">Adaptive PHA (full &#x003A9;)</td>
<td valign="top" align="center">0.081</td>
<td valign="top" align="center">0.090</td>
<td valign="top" align="center">21.5</td>
</tr></tbody>
</table>
</table-wrap>
<sec>
<title>5.2.1 Analysis of computational efficiency gains</title>
<p>The adaptive penalty mechanism shortens convergence time by 30% compared to static penalty use. This gain is due to dynamic penalty updates, which enhance scenario consensus formation without premature convergence.</p>
<p>Scenario clustering achieves impressive efficiency: reducing from 1,000 to 10 scenarios leads to only a 6%&#x02013;7% performance drop but a 6.7-fold computational time reduction (21.5&#x02013;3.2 h). This trade-off makes the method operationally viable for near real-time decision support.</p>
</sec>
</sec>
<sec>
<title>5.3 Reservoir storage dynamics</title>
<p><xref ref-type="fig" rid="F3">Figure 3</xref> depicts storage trajectories in each reservoir over the simulation period. Dashed red lines indicate maximum capacities; dotted lines show minimum operational thresholds.</p>
<fig position="float" id="F3">
<label>Figure 3</label>
<caption><p>Simulated storage evolution across all reservoirs under the optimized release strategy.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frwa-07-1606096-g0003.tif">
<alt-text>Five line graphs display storage levels over time in 10-hour intervals for different locations: Mellegue, Ben Metir, Kasseb, Bou Heurtma, and Sidi Salem. Each graph shows a blue line representing storage level trends, increasing steadily toward the maximum capacity, marked by a red dashed line. Minimum capacity is indicated by a dotted line.</alt-text>
</graphic>
</fig>
<p>Sidi Salem, the downstream terminal node, exhibits gradual refilling, while upstream reservoirs (Kasseb, Mellegue) display early drawdowns followed by strategic refill. All reservoirs operate within bounds, validating solution feasibility.</p>
<sec>
<title>5.3.1 Interpretation of optimal release strategies</title>
<p>Key operational insights include:</p>
<list list-type="bullet">
<list-item><p>Anticipatory management: upstream reservoirs (Ben Metir, Bou Heurtma) implement drawdowns in days 10&#x02013;25 to create buffer capacity prior to peak inflows.</p></list-item>
<list-item><p>Cascade coordination: sequential refilling (upstream first) maintains flood safety and system storage, reducing peak discharges by 25%&#x02013;30%.</p></list-item>
<list-item><p>Safety margin preservation: reservoirs remain above 85% of security thresholds, balancing flood protection and supply reliability.</p></list-item>
</list>
<p>The strategy reflects temporal planning: early conservation, mid-season flood buffering, and post-peak recovery.</p>
</sec>
</sec>
<sec>
<title>5.4 Flood risk control at downstream critical points</title>
<p>River stages <inline-formula><mml:math id="M81"><mml:msubsup><mml:mrow><mml:mi>h</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> were simulated at five downstream control points (P1&#x02013;P5) on the Medjerda River. These are locations vulnerable to overflow.</p>
<p>As <xref ref-type="fig" rid="F4">Figure 4</xref> shows, river levels largely remain below flood thresholds. Short exceedances (2&#x02013;4 h) occur at P1 and P2 (near the dam outlet), but attenuate further downstream.</p>
<fig position="float" id="F4">
<label>Figure 4</label>
<caption><p>Simulated river levels at downstream control points <italic>P</italic>1&#x02013;<italic>P</italic>5 under the optimized release strategy.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frwa-07-1606096-g0004.tif">
<alt-text>Five graphs show water levels over time in ten-hour intervals. Blue lines represent water levels, with green dashed lines indicating desired levels and red dashed lines indicating flood thresholds. Each graph shows varying fluctuations, occasionally nearing flood thresholds.</alt-text>
</graphic>
</fig>
<sec>
<title>5.4.1 Detailed flood risk analysis</title>
<list list-type="bullet">
<list-item><p>Near-dam vulnerability: 12% of scenarios exceed thresholds at P1/P2 by 0.3&#x02013;0.5 m, with limited structural risk.</p></list-item>
<list-item><p>Downstream attenuation: threshold breaches drop below 3% at P3&#x02013;P5.</p></list-item>
<list-item><p>Peak flow reduction: maximum discharges fall by 40&#x02013;50% vs. uncontrolled flood scenarios.</p></list-item>
</list>
<p>While perfect flood prevention is infeasible under extreme conditions, the strategy maintains risks within acceptable limits while sustaining operational functionality.</p>
</sec>
</sec>
<sec>
<title>5.5 Robustness and sensitivity analysis</title>
<sec>
<title>5.5.1 Performance under extreme conditions</title>
<p>To assess the framework&#x00027;s robustness beyond nominal operating conditions, we evaluated performance on two stress-test scenarios: extreme inflow events (top 5% by magnitude) and highly correlated spatial events (correlation coefficient <italic>r</italic> &#x0003E; 0.8).</p>
<sec>
<title>5.5.1.1 Extreme inflow events</title>
<p>Under the most severe inflow conditions (peak flows exceeding 1,200 m<sup>3</sup>/s), the system maintained:</p>
<list list-type="bullet">
<list-item><p>88% constraint satisfaction (vs. 93% under nominal conditions).</p></list-item>
<list-item><p>15%&#x02013;20% objective degradation relative to baseline performance.</p></list-item>
<list-item><p>Zero catastrophic failures (reservoir overflows or system breakdowns).</p></list-item>
<list-item><p>Maximum storage utilization of 97% across all reservoirs.</p></list-item>
</list>
</sec>
<sec>
<title>5.5.1.2 Spatially correlated events</title>
<p>When all catchments experience synchronized high inflows (<italic>r</italic> &#x0003E; 0.8):</p>
<list list-type="bullet">
<list-item><p>90% feasibility maintained despite system-wide stress.</p></list-item>
<list-item><p>12% improvement in storage efficiency due to coordinated management.</p></list-item>
<list-item><p>Adaptive penalty mechanism effectively synchronized releases across reservoirs.</p></list-item>
<list-item><p>Reduced peak downstream flows by 35% compared to independent operation.</p></list-item>
</list>
<p>These results demonstrate that while extreme conditions challenge system performance, the optimization framework maintains operational safety and avoids catastrophic outcomes.</p>
</sec>
</sec>
<sec>
<title>5.5.2 Sensitivity to algorithmic parameters</title>
<sec>
<title>5.5.2.1 Number of representative scenarios (|&#x003A9;&#x02032;|)</title>
<p>The number of representative inflow scenarios directly influences the diversity of hydrological patterns captured during optimization. <xref ref-type="table" rid="T3">Table 3</xref> demonstrates that while reducing from 1,000 to 5 scenarios achieves the fastest runtime (2.4 hours), this comes at the cost of degraded performance. The optimal balance occurs at |&#x003A9;&#x02032;|= 10&#x02013;15 scenarios. Increasing |&#x003A9;&#x02032;| improves performance by better representing uncertainty, but also increases computational burden. The observed trade-offs are:</p>
<list list-type="bullet">
<list-item><p>|&#x003A9;&#x02032;| &#x0003C; 8: Poor generalization and risk of under-representation.</p></list-item>
<list-item><p>|&#x003A9;&#x02032;| &#x0003D; 10&#x02013;12: Optimal balance between accuracy and efficiency.</p></list-item>
<list-item><p>|&#x003A9;&#x02032;|&#x0003E;15: Marginal performance gains, but significant runtime increase.</p></list-item>
</list>
<table-wrap position="float" id="T3">
<label>Table 3</label>
<caption><p>Sensitivity of model performance to number of representative scenarios.</p></caption>
<table frame="box" rules="all">
<thead>
<tr>
<th valign="top" align="left"><bold>|&#x003A9;<sup>&#x02032;</sup>|</bold></th>
<th valign="top" align="center"><bold>&#x1D53C;[<italic>Q</italic><sup>&#x003C9;</sup>]</bold></th>
<th valign="top" align="center"><bold>&#x1D53C;[<italic>L</italic><sup>&#x003C9;</sup>]</bold></th>
<th valign="top" align="center"><bold>Runtime (h)</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">5</td>
<td valign="top" align="center">0.109</td>
<td valign="top" align="center">0.121</td>
<td valign="top" align="center">2.4</td>
</tr>
<tr>
<td valign="top" align="left">10</td>
<td valign="top" align="center">0.087</td>
<td valign="top" align="center">0.094</td>
<td valign="top" align="center">3.2</td>
</tr>
<tr>
<td valign="top" align="left">15</td>
<td valign="top" align="center">0.084</td>
<td valign="top" align="center">0.090</td>
<td valign="top" align="center">4.7</td>
</tr>
<tr>
<td valign="top" align="left">20</td>
<td valign="top" align="center">0.082</td>
<td valign="top" align="center">0.088</td>
<td valign="top" align="center">6.8</td>
</tr></tbody>
</table>
</table-wrap>
</sec>
<sec>
<title>5.5.2.2 Penalty adaptation rate (&#x003B1;)</title>
<p>The adaptation rate &#x003B1; governs how aggressively the penalty parameter &#x003C1;<sub><italic>k</italic></sub> evolves in response to disagreement among scenario-specific decisions. <xref ref-type="fig" rid="F5">Figure 5</xref> reveals that both objective values and convergence iterations follow a U-shaped pattern with respect to &#x003B1;, with optimal performance occurring between &#x003B1;= 0.5&#x02013;1.0. Different values yield the following convergence behavior:</p>
<list list-type="bullet">
<list-item><p>&#x003B1; &#x0003D; 0: static penalty; slow convergence (60&#x02013;80 iterations).</p></list-item>
<list-item><p>&#x003B1;&#x02208;[0.5, 1.0]: optimal range; faster convergence (35&#x02013;45 iterations).</p></list-item>
<list-item><p>&#x003B1;&#x0003E;1.2: risk of instability and oscillatory solution trajectories.</p></list-item>
</list>
<fig position="float" id="F5">
<label>Figure 5</label>
<caption><p>Effect of penalty adaptation rate &#x003B1; on convergence and objective values.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frwa-07-1606096-g0005.tif">
<alt-text>Line graph showing the effect of penalty adaptation rate on normalized objective value and convergence iterations. The x-axis represents the penalty adaptation rate from 0 to 1.5. The left y-axis shows normalized objective value ranging from 0.085 to 0.115, while the right y-axis shows convergence iterations from 35 to 60. Two lines represent storage (blue, solid) and flood (light blue, solid) objective values, with a red dashed line for iterations. Both objective values decrease at first, then increase after reaching a minimum around an adaptation rate of 0.6. Iterations follow a similar pattern.</alt-text>
</graphic>
</fig>
</sec>
<sec>
<title>5.5.2.3 Objective weighting parameter (&#x003BB;)</title>
<p>The weighting parameter &#x003BB; defines the relative emphasis placed on flood mitigation vs. reservoir storage objectives. The following outcomes were observed:</p>
<list list-type="bullet">
<list-item><p>&#x003BB; &#x0003D; 0.3: emphasis on flood control, suitable for early-season flood risk.</p></list-item>
<list-item><p>&#x003BB; &#x0003D; 0.5: balanced weighting; favorable compromise across objectives.</p></list-item>
<list-item><p>&#x003BB; &#x0003D; 0.7: emphasis on storage conservation, useful for dry-end seasons.</p></list-item>
</list>
<p><xref ref-type="table" rid="T4">Table 4</xref> summarizes the impact of varying &#x003BB; on system performance, quantifying how objective prioritization influences the trade-off between flood protection and storage reliability.</p>
<table-wrap position="float" id="T4">
<label>Table 4</label>
<caption><p>Effect of objective weight &#x003BB; on optimization outcomes.</p></caption>
<table frame="box" rules="all">
<thead>
<tr>
<th valign="top" align="left"><bold>&#x003BB;</bold></th>
<th valign="top" align="center"><bold>&#x1D53C;[<italic>Q</italic><sup>&#x003C9;</sup>]</bold></th>
<th valign="top" align="center"><bold>&#x1D53C;[<italic>L</italic><sup>&#x003C9;</sup>]</bold></th>
<th valign="top" align="center"><bold>Runtime (h)</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">0.3</td>
<td valign="top" align="center">0.112</td>
<td valign="top" align="center">0.071</td>
<td valign="top" align="center">3.1</td>
</tr>
<tr>
<td valign="top" align="left">0.5</td>
<td valign="top" align="center">0.087</td>
<td valign="top" align="center">0.094</td>
<td valign="top" align="center">3.2</td>
</tr>
<tr>
<td valign="top" align="left">0.7</td>
<td valign="top" align="center">0.061</td>
<td valign="top" align="center">0.132</td>
<td valign="top" align="center">3.1</td>
</tr></tbody>
</table>
</table-wrap>
<p>Tuning the parameters |&#x003A9;&#x02032;|, &#x003B1;, and &#x003BB; is essential for adapting the framework to specific operational contexts, balancing performance with computational feasibility.</p>
</sec>
</sec>
</sec>
<sec>
<title>5.6 Computational performance and scalability</title>
<p>Empirical validation of the theoretical complexity analysis (Section 4.3) confirms the framework&#x00027;s practical efficiency:</p>
<sec>
<title>5.6.1 Algorithm convergence</title>
<p>The adaptive PHA converged in 42 iterations on average, consistent with the theoretical linear convergence rate. Convergence time of 3.2 h for 10 scenarios validates the computational tractability for operational use.</p>
</sec>
<sec>
<title>5.6.2 Empirical validation of theoretical bounds</title>
<list list-type="bullet">
<list-item><p>Observed parallel efficiency (88% on 16 cores) matches theoretical predictions.</p></list-item>
<list-item><p>Memory usage (8 GB for 1,000 scenarios) aligns with linear scaling analysis.</p></list-item>
<list-item><p>Runtime dominated by |&#x003A9;&#x02032;| rather than reservoir count, confirming theoretical scalability properties.</p></list-item>
</list>
</sec>
<sec>
<title>5.6.3 Operational implications</title>
<p>The demonstrated computational performance enables near real-time decision support, with solution times compatible with operational planning horizons (3&#x02013;6 h for flood management decisions).</p>
</sec>
</sec>
</sec>
<sec sec-type="discussion" id="s6">
<title>6 Discussion</title>
<sec>
<title>6.1 Methodological contributions and advantages</title>
<sec>
<title>6.1.1 Innovative integration of Progressive Hedging with scenario clustering</title>
<p>This study introduces the first application of K-means scenario clustering with adaptive Progressive Hedging algorithm for reservoir optimization under uncertainty. Compared to traditional approaches, our framework offers several distinct advantages:</p>
<sec>
<title>6.1.1.1 Computational efficiency gains</title>
<p>While <xref ref-type="bibr" rid="B32">Schwanenberg et al. (2014)</xref> employed Sample Average Approximation (SAA) without dimensionality reduction, our clustering approach reduces computational complexity from 1,000 to 10 scenarios with only 6% performance loss. This represents a significant advancement in making stochastic optimization tractable for operational contexts.</p>
</sec>
<sec>
<title>6.1.1.2 Enhanced convergence properties</title>
<p>Unlike <xref ref-type="bibr" rid="B5">Chen et al. (2020)</xref> who used NSGA-III without scenario decomposition, our adaptive penalty mechanism improves convergence speed by 30% compared to static penalty approaches. The dynamic adjustment of penalty parameters based on scenario variance provides superior stability and faster consensus formation.</p>
</sec>
<sec>
<title>6.1.1.3 Scalability for large systems</title>
<p><xref ref-type="bibr" rid="B22">Liu and Luo (2019)</xref> proposed dynamic multi-objective optimization but without adaptive penalty mechanisms. Our framework demonstrates near-linear scaling (88% parallel efficiency on 16 cores) and shows promise for larger networks based on its modular decomposition structure.</p>
</sec>
</sec>
<sec>
<title>6.1.2 Modular coupling with hydraulic simulation</title>
<p>The integration with HEC-RAS as a &#x0201C;black-box&#x0201D; hydraulic simulator provides several operational advantages:</p>
<list list-type="bullet">
<list-item><p>Flexibility: compatible with alternative hydraulic models [TELEMAC (<xref ref-type="bibr" rid="B13">Goutal and Maurel, 2007</xref>), MIKE 11 (<xref ref-type="bibr" rid="B7">DHI Water and Environment, 2017</xref>)] without framework modification.</p></list-item>
<list-item><p>High-fidelity physics: maintains detailed representation of river hydraulics without embedding complex PDEs in optimization.</p></list-item>
<list-item><p>Extensibility: readily adaptable to complex river geometries and multi-dimensional flow modeling.</p></list-item>
</list>
<p>This modular approach contrasts with integrated models that sacrifice either hydraulic detail or optimization efficiency.</p>
</sec>
</sec>
<sec>
<title>6.2 Practical applicability and operational relevance</title>
<sec>
<title>6.2.1 Utility for dam operators and water managers</title>
<p>The consensus release policy generated by our framework serves multiple operational purposes:</p>
<p>Seasonal operating guidelines. The robust policies provide anticipatory strategies for flood season management, replacing reactive rule-based approaches with probabilistically-informed decision support. Unlike empirical rules (e.g., &#x0201C;release 50% of storage before rainy season&#x0201D;), our approach optimizes decisions based on spatiotemporal inflow correlations.</p>
<p>Real-time decision support. The framework enables rapid evaluation of &#x0201C;what-if&#x0201D; scenarios, supporting adaptive management during evolving flood events. Computational times of 3.2 h make the approach suitable for day-ahead operational planning.</p>
<p>Multi-reservoir coordination. Traditional approaches manage reservoirs independently, often leading to suboptimal system performance. Our framework simultaneously optimizes five interconnected reservoirs, achieving estimated 25%&#x02013;30% reduction in flood risk compared to decentralized management.</p>
</sec>
<sec>
<title>6.2.2 Performance comparison with existing methods</title>
<p><xref ref-type="table" rid="T5">Table 5</xref> provides quantitative comparison with similar studies in the literature:</p>
<table-wrap position="float" id="T5">
<label>Table 5</label>
<caption><p>Performance comparison with related studies.</p></caption>
<table frame="box" rules="all">
<thead>
<tr>
<th valign="top" align="left"><bold>Study</bold></th>
<th valign="top" align="left"><bold>Method</bold></th>
<th valign="top" align="left"><bold>Reservoirs</bold></th>
<th valign="top" align="left"><bold>Scenarios</bold></th>
<th valign="top" align="left"><bold>Runtime</bold></th>
<th valign="top" align="left"><bold>Flood control</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left"><xref ref-type="bibr" rid="B46">Zhang et al. (2019)</xref></td>
<td valign="top" align="left">MOEA/D-DE</td>
<td valign="top" align="left">1</td>
<td valign="top" align="left">Deterministic</td>
<td valign="top" align="left">&#x0007E;2h</td>
<td valign="top" align="left">15% peak reduction</td>
</tr>
<tr>
<td valign="top" align="left"><xref ref-type="bibr" rid="B28">Moridi and Yazdi (2017)</xref></td>
<td valign="top" align="left">&#x003B5;-constraint</td>
<td valign="top" align="left">6</td>
<td valign="top" align="left">20</td>
<td valign="top" align="left">&#x0007E;5h</td>
<td valign="top" align="left">Not reported</td>
</tr>
<tr>
<td valign="top" align="left"><xref ref-type="bibr" rid="B39">Wang et al. (2022)</xref></td>
<td valign="top" align="left">Multi-objective</td>
<td valign="top" align="left">12</td>
<td valign="top" align="left">50</td>
<td valign="top" align="left">&#x0007E;8h</td>
<td valign="top" align="left">Not reported</td>
</tr>
<tr>
<td valign="top" align="left"><xref ref-type="bibr" rid="B29">Qi et al. (2016)</xref></td>
<td valign="top" align="left">Memetic algo.</td>
<td valign="top" align="left">3</td>
<td valign="top" align="left">Deterministic</td>
<td valign="top" align="left">&#x0007E;4h</td>
<td valign="top" align="left">20% improvement</td>
</tr>
<tr>
<td valign="top" align="left">This study</td>
<td valign="top" align="left">Adaptive PHA</td>
<td valign="top" align="left">5</td>
<td valign="top" align="left">10 (of 1,000)</td>
<td valign="top" align="left">3.2h</td>
<td valign="top" align="left">93% satisfied</td>
</tr></tbody>
</table>
</table-wrap>
<p>Our approach demonstrates superior performance-to-runtime ratio and provides explicit uncertainty quantification, unlike deterministic approaches that cannot assess robustness under varying conditions.</p>
</sec>
</sec>
<sec>
<title>6.3 Limitations and methodological challenges</title>
<sec>
<title>6.3.1 Acknowledged methodological limitations</title>
<sec>
<title>6.3.1.1 Open-loop decision framework</title>
<p>Our current formulation does not incorporate real-time observations or forecast updates, contrasting with Model Predictive Control approaches (<xref ref-type="bibr" rid="B37">Uysal et al., 2018</xref>; <xref ref-type="bibr" rid="B1">Akbari et al., 2014</xref>). This limitation may result in suboptimal performance when actual conditions deviate significantly from predicted scenarios.</p>
<p><italic>Impact assessment:</italic> preliminary analysis suggests 10%&#x02013;15% performance degradation during extreme events that fall outside the scenario ensemble. However, the robust nature of our policies provides reasonable fallback strategies even under unprecedented conditions.</p>
<p><italic>Future mitigation:</italic> extension to rolling-horizon MPC with scenario tree updates could address this limitation while maintaining computational tractability.</p>
</sec>
<sec>
<title>6.3.1.2 Fixed objective scalarization</title>
<p>Unlike studies that explore complete Pareto fronts (<xref ref-type="bibr" rid="B28">Moridi and Yazdi, 2017</xref>; <xref ref-type="bibr" rid="B5">Chen et al., 2020</xref>), our current implementation uses fixed weighting parameter &#x003BB;. This approach limits exploration of trade-offs and may not capture all stakeholder preferences.</p>
<p><italic>Practical implications:</italic> different operational contexts may require different priority balances. Water-scarce periods favor storage conservation (&#x003BB;&#x0003E;0.6), while high flood risk periods prioritize discharge management (&#x003BB; &#x0003C; 0.4).</p>
<p><italic>Proposed enhancement:</italic> implementation of NSGA-II or similar multi-objective algorithms could generate complete Pareto fronts, enabling context-adaptive decision making.</p>
</sec>
<sec>
<title>6.3.1.3 Climate stationarity assumptions</title>
<p>Our stochastic inflow generation relies on historical data distributions, assuming stationary climate conditions. <xref ref-type="bibr" rid="B14">Guo et al. (2024)</xref> and others have demonstrated the importance of incorporating climate change projections for long-term reservoir planning.</p>
<p><italic>Limitation scope:</italic> current approach may underestimate future extreme event frequencies and intensities under climate change scenarios (RCP 4.5/8.5).</p>
<p><italic>Adaptation strategy:</italic> integration with downscaled climate projections and non-stationary extreme value modeling represents a critical future development direction.</p>
</sec>
</sec>
<sec>
<title>6.3.2 Implementation and operational challenges</title>
<sec>
<title>6.3.2.1 Data requirements</title>
<p>Successful implementation requires:</p>
<list list-type="bullet">
<list-item><p>High-resolution inflow time series (minimum 10-year records).</p></list-item>
<list-item><p>Detailed river geometry for hydraulic modeling.</p></list-item>
<list-item><p>Reservoir operational characteristics and constraints.</p></list-item>
<list-item><p>Stakeholder preference parameters for objective weighting.</p></list-item>
</list>
</sec>
<sec>
<title>6.3.2.2 Computational infrastructure</title>
<p>While our approach is efficient, operational deployment requires:</p>
<list list-type="bullet">
<list-item><p>Multi-core computing capabilities (minimum 8 cores recommended).</p></list-item>
<list-item><p>Reliable hydraulic modeling software (HEC-RAS or equivalent).</p></list-item>
<list-item><p>Automated data processing pipelines for real-time application.</p></list-item>
</list>
</sec>
<sec>
<title>6.3.2.3 Institutional adoption</title>
<p>Transition from rule-based to optimization-based management requires:</p>
<list list-type="bullet">
<list-item><p>Staff training on stochastic optimization concepts.</p></list-item>
<list-item><p>Integration with existing decision support systems.</p></list-item>
<list-item><p>Regulatory approval for modified operating procedures.</p></list-item>
</list>
</sec>
</sec>
</sec>
<sec>
<title>6.4 Broader implications for water resources management</title>
<sec>
<title>6.4.1 Contribution to sustainable development goals</title>
<p>Our framework directly supports multiple UN Sustainable Development Goals:</p>
<p>SDG 6 (clean water and sanitation). By optimizing storage conservation while managing flood risk, our approach enhances water security and availability. The 93% constraint satisfaction rate ensures reliable post-flood water supply for municipal, agricultural, and industrial uses.</p>
<p>SDG 11 (sustainable cities and communities). Improved flood control (40-50% peak discharge reduction) directly reduces urban flood risk in downstream metropolitan areas, including Greater Tunis with over 2.3 million residents.</p>
<p>SDG 13 (climate action). The stochastic framework provides climate adaptation capacity by managing increased hydrological variability. The robust policies remain effective across diverse scenarios, supporting climate resilience.</p>
</sec>
<sec>
<title>6.4.2 Geographic and system transferability</title>
<p>The methodology demonstrates broad applicability beyond the Medjerda basin:</p>
<sec>
<title>6.4.2.1 Mediterranean and semi-arid regions</title>
<p>Similar climate patterns (intense, variable precipitation) make the approach relevant for:</p>
<list list-type="bullet">
<list-item><p>Iberian Peninsula reservoir systems (Guadalquivir, Duero basins).</p></list-item>
<list-item><p>North African coastal basins (Morocco, Algeria).</p></list-item>
<list-item><p>Middle Eastern water systems (Jordan, Lebanon).</p></list-item>
<list-item><p>Southwestern United States (Colorado River tributaries).</p></list-item>
</list>
</sec>
<sec>
<title>6.4.2.2 Cascade system configurations</title>
<p>The framework is particularly suited for:</p>
<list list-type="bullet">
<list-item><p>Multi-reservoir cascades with mixed parallel-serial topology.</p></list-item>
<list-item><p>Systems with dominant downstream reservoir (similar to Sidi Salem).</p></list-item>
<list-item><p>Networks with 3&#x02013;15 interconnected reservoirs.</p></list-item>
</list>
</sec>
<sec>
<title>6.4.2.3 Data-sparse environments</title>
<p>The scenario reduction capability makes the approach viable in regions with limited historical data, where large scenario ensembles compensate for observational uncertainty.</p>
</sec>
</sec>
</sec>
<sec>
<title>6.5 Future research directions and extensions</title>
<sec>
<title>6.5.1 Methodological enhancements</title>
<sec>
<title>6.5.1.1 Advanced risk metrics</title>
<p>Replacement of expectation-based objectives with Conditional Value-at-Risk (CVaR) would better address tail risk management:</p>
<disp-formula id="E28"><label>(26)</label><mml:math id="M82"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mtext class="textrm" mathvariant="normal">CVaR</mml:mtext></mml:mrow><mml:mrow><mml:mi>&#x003B1;</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mstyle mathvariant="double-struck"><mml:mi>E</mml:mi></mml:mstyle><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow></mml:msup><mml:mo>|</mml:mo><mml:msup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow></mml:msup><mml:mo>&#x02265;</mml:mo><mml:msub><mml:mrow><mml:mtext class="textrm" mathvariant="normal">VaR</mml:mtext></mml:mrow><mml:mrow><mml:mi>&#x003B1;</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>This modification would improve management of low-probability, high-impact flood events that pose the greatest risks to infrastructure and human safety.</p>
</sec>
<sec>
<title>6.5.1.2 Real-time adaptive framework</title>
<p>Integration with ensemble weather forecasting systems could enable dynamic scenario updating:</p>
<list list-type="bullet">
<list-item><p>Rolling-horizon optimization with 72-h update cycles.</p></list-item>
<list-item><p>Probabilistic forecast integration for scenario generation.</p></list-item>
<list-item><p>Adaptive penalty adjustment based on forecast skill.</p></list-item>
</list>
</sec>
<sec>
<title>6.5.1.3 Multi-objective pareto exploration</title>
<p>Implementation of evolutionary algorithms (NSGA-III, MOEA/D) would provide complete trade-off analysis, enabling:</p>
<list list-type="bullet">
<list-item><p>Seasonal adaptation of objective priorities.</p></list-item>
<list-item><p>Stakeholder-specific policy selection.</p></list-item>
<list-item><p>Robustness analysis across preference spaces.</p></list-item>
</list>
</sec>
</sec>
<sec>
<title>6.5.2 Climate change integration</title>
<sec>
<title>6.5.2.1 Non-stationary inflow modeling</title>
<p>Incorporation of climate projections requires:</p>
<list list-type="bullet">
<list-item><p>Downscaled GCM outputs for regional hydrology.</p></list-item>
<list-item><p>Time-varying distribution parameters in extreme value models.</p></list-item>
<list-item><p>Scenario weighting based on emission pathway probabilities.</p></list-item>
</list>
</sec>
<sec>
<title>6.5.2.2 Adaptive infrastructure planning</title>
<p>Extension to long-term capacity planning could assess:</p>
<list list-type="bullet">
<list-item><p>Optimal reservoir expansion strategies under climate uncertainty.</p></list-item>
<list-item><p>Cost-benefit analysis of flood protection investments.</p></list-item>
<list-item><p>Regional water allocation under changing hydrology.</p></list-item>
</list>
</sec>
</sec>
<sec>
<title>6.5.3 Empirical validation requirements</title>
<sec>
<title>6.5.3.1 Historical event analysis</title>
<p>Retrospective testing on documented flood events (Medjerda floods of 2003, 2007, 2009) would provide empirical validation of framework performance against actual operational decisions.</p>
</sec>
<sec>
<title>6.5.3.2 Operational pilot studies</title>
<p>Collaborative implementation with Tunisian water authorities could demonstrate real-world applicability and identify practical implementation challenges.</p>
</sec>
<sec>
<title>6.5.3.3 Comparative field studies</title>
<p>Systematic comparison with current operational practices over multiple flood seasons would quantify actual performance gains and identify optimization opportunities.</p>
</sec>
</sec>
<sec>
<title>6.5.4 Large-scale reservoir system extensions</title>
<sec>
<title>6.5.4.1 Regional network scaling</title>
<p>Extension to national-scale networks (50&#x0002B; reservoirs) requires:</p>
<list list-type="bullet">
<list-item><p>Hierarchical decomposition strategies for multi-level optimization.</p></list-item>
<list-item><p>Distributed computing architectures for parallel subproblem solving.</p></list-item>
<list-item><p>Advanced clustering techniques for spatial-temporal scenario correlation.</p></list-item>
<list-item><p>Load balancing algorithms for heterogeneous reservoir networks.</p></list-item>
</list>
</sec>
<sec>
<title>6.5.4.2 Multi-regional coordination</title>
<p>Cross-boundary water management involves:</p>
<list list-type="bullet">
<list-item><p>Inter-regional water transfer optimization.</p></list-item>
<list-item><p>Negotiation mechanisms for competing stakeholder objectives.</p></list-item>
<list-item><p>Robust policies under institutional uncertainty.</p></list-item>
</list>
</sec>
</sec>
</sec>
</sec>
<sec sec-type="conclusions" id="s7">
<title>7 Conclusion</title>
<p>This study introduced a novel stochastic optimization framework for flood-resilient operation of multi-reservoir systems, combining adaptive Progressive Hedging with K-means scenario clustering. The approach addresses core challenges of uncertainty, scalability, and operational realism in water resources management.</p>
<p>Tested on Tunisia&#x00027;s Medjerda system, the method yielded robust and anticipatory release strategies while maintaining computational tractability. Its modular structure and integration with hydraulic simulation tools make it well-suited for diverse geographic and institutional contexts.</p>
<sec>
<title>7.1 Strategic relevance</title>
<p>By explicitly accounting for hydrological uncertainty, the framework provides a scientifically grounded alternative to rule-based practices. It supports long-term planning and short-term adaptation, aligning with global climate resilience and water security goals.</p>
</sec>
<sec>
<title>7.2 Path forward</title>
<p>Future research should focus on real-time adaptability, exploration of trade-offs via multi-objective metaheuristics, and integration of non-stationary climate projections. Empirical validation in operational settings will be key to demonstrating full practical value.</p>
<p>Ultimately, this work bridges methodological innovation and decision-making needs in uncertain hydrological environments, laying the foundation for the next generation of climate-adaptive water management systems.</p>
</sec>
</sec>
</body>
<back>
<sec sec-type="data-availability" id="s8">
<title>Data availability statement</title>
<p>The datasets generated and analyzed during this study are not publicly available due to proprietary restrictions on reservoir operational data provided by Tunisia&#x00027;s national water agency. Synthetic inflow scenarios generated for this research can be reproduced using the stochastic modeling methodology described in Section 4.5. The HEC-RAS hydraulic model configurations and optimization framework parameters are available from the corresponding author upon reasonable request and subject to data sharing agreements with the original data providers.</p>
</sec>
<sec sec-type="author-contributions" id="s9">
<title>Author contributions</title>
<p>MA: Project administration, Resources, Writing &#x02013; original draft, Formal analysis, Methodology. KM: Writing &#x02013; review &#x00026; editing, Validation, Supervision, Data curation, Software, Investigation, Visualization, Conceptualization.</p>
</sec>
<sec sec-type="funding-information" id="s10">
<title>Funding</title>
<p>The author(s) declare that financial support was received for the research and/or publication of this article. The authors gratefully acknowledge financial support from the Deanship of Scientific Research, King Faisal University (KFU) in Saudi Arabia (Grant number KFU252972).</p>
</sec>
<ack><p>The authors would like to express their sincere gratitude to the Deanship of Scientific Research at King Faisal University for supporting this research. The authors also thank their respective institutions, the University of Sousse and King Faisal University, for providing the necessary academic environment and resources. Special thanks go to the teams involved in data collection and simulation testing, whose contributions were instrumental in the completion of this study.</p>
</ack>
<sec sec-type="COI-statement" id="conf1">
<title>Conflict of interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="ai-statement" id="s11">
<title>Generative AI statement</title>
<p>The author(s) declare that no Gen AI was used in the creation of this manuscript.</p>
<p>Any alternative text (alt text) provided alongside figures in this article has been generated by Frontiers with the support of artificial intelligence and reasonable efforts have been made to ensure accuracy, including review by the authors wherever possible. If you identify any issues, please contact us.</p>
</sec>
<sec sec-type="disclaimer" id="s12">
<title>Publisher&#x00027;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Akbari</surname> <given-names>M.</given-names></name> <name><surname>Afshar</surname> <given-names>A.</given-names></name> <name><surname>Mousavi</surname> <given-names>S.</given-names></name></person-group> (<year>2014</year>). <article-title>Multi-objective reservoir operation under emergency condition: abbaspour reservoir case study with non-functional spillways</article-title>. <source>J. Flood Risk Manag</source>. <volume>7</volume>, <fpage>374</fpage>&#x02013;<lpage>384</lpage>. <pub-id pub-id-type="doi">10.1111/jfr3.12061</pub-id></citation>
</ref>
<ref id="B2">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Becker</surname> <given-names>B. P. J.</given-names></name> <name><surname>Ochterbeck</surname> <given-names>D.</given-names></name> <name><surname>Piovesan</surname> <given-names>T.</given-names></name></person-group> (<year>2024</year>). <article-title>Reservoir operations under uncertainty with moving-horizon approach and ensemble forecast optimization</article-title>. <source>J. Hydroinform</source>. <volume>26</volume>, <fpage>265</fpage>&#x02013;<lpage>276</lpage>. <pub-id pub-id-type="doi">10.1080/23249676.2023.2276948</pub-id></citation>
</ref>
<ref id="B3">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Brunner</surname> <given-names>G. W.</given-names></name></person-group> (<year>2016</year>). <source>HEC-RAS River Analysis System Hydraulic Reference Manual</source>. <publisher-loc>Davis, CA</publisher-loc>: <publisher-name>US Army Corps of Engineers, Hydrologic Engineering Center</publisher-name>. Version 5.0.</citation>
</ref>
<ref id="B4">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chaudhry</surname> <given-names>M. H.</given-names></name></person-group> (<year>2007</year>). <source>Open-Channel Flow</source>, 2nd Edn. Cham: Springer. <pub-id pub-id-type="doi">10.1007/978-0-387-68648-6</pub-id></citation>
</ref>
<ref id="B5">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chen</surname> <given-names>J.</given-names></name> <name><surname>Zhong</surname> <given-names>P.-a.</given-names></name> <name><surname>Liu</surname> <given-names>W.</given-names></name> <name><surname>Wan</surname> <given-names>X.-Y.</given-names></name> <name><surname>Yeh</surname> <given-names>W. W.-G.</given-names></name></person-group> (<year>2020</year>). <article-title>A multi-objective risk management model for real-time flood control optimal operation of a parallel reservoir system</article-title>. <source>J. Hydrol</source>. <volume>590</volume>:<fpage>125264</fpage>. <pub-id pub-id-type="doi">10.1016/j.jhydrol.2020.125264</pub-id></citation>
</ref>
<ref id="B6">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Delikta&#x0015F;</surname> <given-names>D.</given-names></name> <name><surname>Karag&#x000F6;z</surname> <given-names>S.</given-names></name> <name><surname>Simi&#x00107;</surname> <given-names>V.</given-names></name> <name><surname>Aydin</surname> <given-names>N.</given-names></name></person-group> (<year>2024</year>). <article-title>Sample intelligence-based progressive hedging algorithms for the stochastic capacitated reliable facility location problem</article-title>. <source>Artif. Intell. Rev</source>. <volume>57</volume>, <fpage>1</fpage>&#x02013;<lpage>42</lpage>. <pub-id pub-id-type="doi">10.1007/s10462-024-10755-w</pub-id></citation>
</ref>
<ref id="B7">
<citation citation-type="book"><person-group person-group-type="author"><collab>DHI Water and Environment</collab></person-group> (<year>2017</year>). <source>MIKE 11: A Modelling System for Rivers and Channels</source>. <publisher-loc>Lakewood, CO</publisher-loc>: <publisher-name>Danish Hydraulic Institute</publisher-name>.<pub-id pub-id-type="pmid">24363162</pub-id></citation></ref>
<ref id="B8">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Draper</surname> <given-names>A.</given-names></name></person-group> (<year>2001</year>). <source>Implicit Stochastic Optimization with Limited Foresight for Reservoir Systems</source>. <publisher-loc>Davis, CA</publisher-loc>: <publisher-name>University of California, Davis</publisher-name>.</citation>
</ref>
<ref id="B9">
<citation citation-type="book"><person-group person-group-type="author"><collab>European Environment Agency</collab></person-group> (<year>2021</year>). <article-title>&#x0201C;Climate change impacts and vulnerability in Europe 2021: an indicator-based assessment,&#x0201D;</article-title> in <source>Technical report</source>. <publisher-loc>Luxembourg</publisher-loc>: <publisher-name>Publications Office of the European Union</publisher-name>.</citation>
</ref>
<ref id="B10">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Gade</surname> <given-names>D.</given-names></name> <name><surname>Hackebeil</surname> <given-names>G.</given-names></name> <name><surname>Nicholson</surname> <given-names>B.</given-names></name> <name><surname>Watson</surname> <given-names>J.-P.</given-names></name> <name><surname>Woodruff</surname> <given-names>D.</given-names></name></person-group> (<year>2016</year>). <article-title>Obtaining lower bounds from progressive hedging</article-title>. <source>Math. Program. Comput</source>. <volume>8</volume>, <fpage>159</fpage>&#x02013;<lpage>182</lpage>. <pub-id pub-id-type="doi">10.1007/s10107-016-1000-z</pub-id></citation>
</ref>
<ref id="B11">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Gegenleithner</surname> <given-names>S.</given-names></name> <name><surname>Kroi&#x000DF;</surname> <given-names>G.</given-names></name> <name><surname>Ganahl</surname> <given-names>S.</given-names></name> <name><surname>Schneider</surname> <given-names>J.</given-names></name></person-group> (<year>2024</year>). <article-title>Multiobjective multihydropower reservoir operation optimization with transformer-based deep reinforcement learning</article-title>. <source>J. Hydrol</source>. <volume>632</volume>:<fpage>130879</fpage>. <pub-id pub-id-type="doi">10.1016/j.jhydrol.2024.130904</pub-id></citation>
</ref>
<ref id="B12">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Giuliani</surname> <given-names>M.</given-names></name> <name><surname>Lamontagne</surname> <given-names>J. R.</given-names></name> <name><surname>Reed</surname> <given-names>P. M.</given-names></name> <name><surname>Castelletti</surname> <given-names>A.</given-names></name></person-group> (<year>2021</year>). <article-title>A state-of-the-art review of optimal reservoir control for managing conflicting demands in a changing world</article-title>. <source>Water Resour. Res</source>. <volume>57</volume>:<fpage>e2021W</fpage>R029927. <pub-id pub-id-type="doi">10.1029/2021WR029927</pub-id></citation>
</ref>
<ref id="B13">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Goutal</surname> <given-names>N.</given-names></name> <name><surname>Maurel</surname> <given-names>F.</given-names></name></person-group> (<year>2007</year>). <article-title>A finite volume solver for 1D shallow-water equations applied to an actual river</article-title>. <source>Int. J. Numer. Methods Fluids</source> <volume>53</volume>, <fpage>1</fpage>&#x02013;<lpage>23</lpage>. <pub-id pub-id-type="doi">10.1002/fld.201</pub-id></citation>
</ref>
<ref id="B14">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Guo</surname> <given-names>Y.</given-names></name> <name><surname>Xu</surname> <given-names>Y.-P.</given-names></name> <name><surname>Yu</surname> <given-names>X.</given-names></name> <name><surname>Liu</surname> <given-names>L.</given-names></name> <name><surname>Gu</surname> <given-names>H.</given-names></name></person-group> (<year>2024</year>). <article-title>AI-based ensemble flood forecasts and its implementation in multi-objective robust optimization operation for reservoir flood control</article-title>. <source>Water Resour. Res</source>. <volume>60</volume>:<fpage>e2023W</fpage>R035693. <pub-id pub-id-type="doi">10.1029/2023WR035693</pub-id></citation>
</ref>
<ref id="B15">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Gupta</surname> <given-names>A.</given-names></name> <name><surname>Srivastava</surname> <given-names>A.</given-names></name> <name><surname>Singh</surname> <given-names>R.</given-names></name></person-group> (<year>2020</year>). <article-title>Hydrological scenario clustering and representative selection for efficient flood risk assessment</article-title>. <source>J. Hydrol</source>. <volume>580</volume>:<fpage>124251</fpage>. <pub-id pub-id-type="doi">10.1016/j.jhydrol.2019.124251</pub-id></citation>
</ref>
<ref id="B16">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hassan</surname> <given-names>W.</given-names></name> <name><surname>Nile</surname> <given-names>B. K.</given-names></name> <name><surname>Kassem</surname> <given-names>A. A.</given-names></name></person-group> (<year>2021</year>). <article-title>Optimization of reservoir operating curves and hedging rules using genetic algorithm with a new objective function and smoothing constraint: application to a multipurpose dam in morocco</article-title>. <source>Environ. Sci. Pollut. Res</source>. <volume>28</volume>, <fpage>18741</fpage>&#x02013;<lpage>18752</lpage>. <pub-id pub-id-type="doi">10.1007/s10661-021-08972-9</pub-id><pub-id pub-id-type="pmid">33728515</pub-id></citation></ref>
<ref id="B17">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Huang</surname> <given-names>Z.</given-names></name> <name><surname>Cai</surname> <given-names>X.</given-names></name> <name><surname>Yang</surname> <given-names>Y.</given-names></name></person-group> (<year>2020</year>). <article-title>A multistage stochastic programming approach to optimize drought mitigation strategies in a changing climate</article-title>. <source>Water Resour. Res</source>. <volume>56</volume>:<fpage>e2019W</fpage>R025834.</citation>
</ref>
<ref id="B18">
<citation citation-type="book"><person-group person-group-type="author"><collab>International Commission on Large Dams</collab></person-group> (<year>2018</year>). <source>Flood Management in Reservoirs</source>. <publisher-loc>Technical report. Paris</publisher-loc>: <publisher-name>ICOLD Bulletin 142</publisher-name>.</citation>
</ref>
<ref id="B19">
<citation citation-type="book"><person-group person-group-type="author"><collab>IPCC</collab></person-group> (<year>2021</year>). <article-title>&#x0201C;Climate change 2021: the physical science basis,&#x0201D;</article-title> in <source>Contribution of working group I to the sixth assessment report of the intergovernmental panel on climate change. Technical report</source> (<publisher-loc>Cambridge</publisher-loc>: <publisher-name>Cambridge University Press</publisher-name>).</citation>
</ref>
<ref id="B20">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jenkinson</surname> <given-names>A. F.</given-names></name></person-group> (<year>1955</year>). <article-title>The frequency distribution of the annual maximum (or minimum) values of meteorological elements</article-title>. <source>Q. J. R. Meteorol. Soc</source>. <volume>81</volume>, <fpage>158</fpage>&#x02013;<lpage>171</lpage>. <pub-id pub-id-type="doi">10.1002/qj.49708134804</pub-id></citation>
</ref>
<ref id="B21">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Lerman</surname> <given-names>P. M.</given-names></name></person-group> (<year>1980</year>). <source>Fitting Distributions to Time Series Data</source>. <publisher-loc>Lanham, MD</publisher-loc>: <publisher-name>Lexington Books</publisher-name>.</citation>
</ref>
<ref id="B22">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Liu</surname> <given-names>X.</given-names></name> <name><surname>Luo</surname> <given-names>J.</given-names></name></person-group> (<year>2019</year>). <article-title>A dynamic multi-objective optimization model with interactivity and uncertainty for real-time reservoir flood control operation</article-title>. <source>Appl. Math. Model</source>. <volume>74</volume>, <fpage>606</fpage>&#x02013;<lpage>620</lpage>. <pub-id pub-id-type="doi">10.1016/j.apm.2019.05.009</pub-id></citation>
</ref>
<ref id="B23">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Loucks</surname> <given-names>D. P.</given-names></name> <name><surname>Van Beek</surname> <given-names>E.</given-names></name></person-group> (<year>2005</year>). <source>Water Resource Systems Planning and Analysis</source>. <publisher-loc>Paris</publisher-loc>: <publisher-name>UNESCO Publishing</publisher-name>.</citation>
</ref>
<ref id="B24">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Luo</surname> <given-names>J.</given-names></name> <name><surname>Qi</surname> <given-names>Y.</given-names></name> <name><surname>Xie</surname> <given-names>J.</given-names></name> <name><surname>Zhang</surname> <given-names>X.</given-names></name></person-group> (<year>2015</year>). <article-title>A hybrid multi-objective PSO-EDA algorithm for reservoir flood control operation</article-title>. <source>Appl. Soft Comput</source>. <volume>34</volume>, <fpage>526</fpage>&#x02013;<lpage>538</lpage>. <pub-id pub-id-type="doi">10.1016/j.asoc.2015.05.036</pub-id></citation>
</ref>
<ref id="B25">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Mansouri</surname> <given-names>S.</given-names></name> <name><surname>Fathian</surname> <given-names>H.</given-names></name> <name><surname>Nikbakht Shahbazi</surname> <given-names>A.</given-names></name> <name><surname>Asadi Lour</surname> <given-names>M.</given-names></name> <name><surname>Asareh</surname> <given-names>A.</given-names></name></person-group> (<year>2023</year>). <article-title>Multi objective simulation-optimization operation of dam reservoir in low water regions based on hedging principles</article-title>. <source>Environ. Sci. Pollut. Res</source>. <volume>30</volume>, <fpage>41581</fpage>&#x02013;<lpage>41590</lpage>. <pub-id pub-id-type="doi">10.1007/s11356-022-25089-9</pub-id><pub-id pub-id-type="pmid">36631621</pub-id></citation></ref>
<ref id="B26">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Martins</surname> <given-names>E. S.</given-names></name> <name><surname>Stedinger</surname> <given-names>J. R.</given-names></name></person-group> (<year>1984</year>). <article-title>Generalized maximum-likelihood generalized extreme-value quantile estimators for hydrologic data</article-title>. <source>Water Resour. Res</source>. <volume>20</volume>, <fpage>373</fpage>&#x02013;<lpage>390</lpage>.</citation>
</ref>
<ref id="B27">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Mohanty</surname> <given-names>M.</given-names></name> <name><surname>Muduli</surname> <given-names>S. K.</given-names></name> <name><surname>Lohani</surname> <given-names>A. K.</given-names></name> <name><surname>Mishra</surname> <given-names>A.</given-names></name></person-group> (<year>2025</year>). <article-title>A coupled optimized hedging rule-based reservoir operation and hydrodynamic model framework for riverine flood risk management</article-title>. <source>Water Res</source>. <volume>268</volume>:<fpage>122562</fpage>. <pub-id pub-id-type="doi">10.1016/j.watres.2025.123443</pub-id><pub-id pub-id-type="pmid">40081178</pub-id></citation></ref>
<ref id="B28">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Moridi</surname> <given-names>A.</given-names></name> <name><surname>Yazdi</surname> <given-names>J.</given-names></name></person-group> (<year>2017</year>). <article-title>Optimal allocation of flood control capacity for multi-reservoir systems using multi-objective optimization approach</article-title>. <source>Water Resour. Manag</source>. <volume>31</volume>, <fpage>4521</fpage>&#x02013;<lpage>4538</lpage>. <pub-id pub-id-type="doi">10.1007/s11269-017-1763-x</pub-id></citation>
</ref>
<ref id="B29">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Qi</surname> <given-names>Y.</given-names></name> <name><surname>Bao</surname> <given-names>L.</given-names></name> <name><surname>Sun</surname> <given-names>Y.</given-names></name> <name><surname>Luo</surname> <given-names>J.</given-names></name> <name><surname>Miao</surname> <given-names>Q.</given-names></name></person-group> (<year>2016</year>). <article-title>A memetic multi-objective immune algorithm for reservoir flood control operation</article-title>. <source>Water Resour. Manag</source>. <volume>30</volume>, <fpage>2957</fpage>&#x02013;<lpage>2977</lpage>. <pub-id pub-id-type="doi">10.1007/s11269-016-1317-7</pub-id></citation>
</ref>
<ref id="B30">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Rockafellar</surname> <given-names>R. T.</given-names></name> <name><surname>Wets</surname> <given-names>R. J.-B.</given-names></name></person-group> (<year>1991</year>). <article-title>Scenarios and policy aggregation in optimization under uncertainty. <italic>Math. Oper</italic></article-title>. <source>Res</source>. <volume>16</volume>, <fpage>119</fpage>&#x02013;<lpage>147</lpage>. <pub-id pub-id-type="doi">10.1287/moor.16.1.119</pub-id><pub-id pub-id-type="pmid">19642375</pub-id></citation></ref>
<ref id="B31">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Schlenkrich</surname> <given-names>L.</given-names></name> <name><surname>Parragh</surname> <given-names>S. N.</given-names></name></person-group> (<year>2024</year>). <article-title>Progressive hedging for multi-stage stochastic lot sizing problems with setup carry-over under uncertain demand</article-title>. <source>arXiv</source> [Preprint]. arXiv:2503.08477. <pub-id pub-id-type="doi">10.48550/arXiv.2503.08477</pub-id></citation>
</ref>
<ref id="B32">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Schwanenberg</surname> <given-names>D.</given-names></name> <name><surname>Assis Dos Reis</surname> <given-names>A.</given-names></name> <name><surname>Kuwajima</surname> <given-names>J.</given-names></name> <name><surname>Alvarado Montero</surname> <given-names>R.</given-names></name> <name><surname>Mainardi Fan</surname> <given-names>F.</given-names></name></person-group> (<year>2014</year>). <article-title>&#x0201C;Short-term reservoir optimization by stochastic optimization for mitigation downstream flood risks,&#x0201D;</article-title> in <source>EGU General Assembly Conference Abstracts, EGU General Assembly Conference Abstracts</source> (<publisher-loc>G&#x000F6;ttingen</publisher-loc>: <publisher-name>Copernicus Publications</publisher-name>), <fpage>11462</fpage>.</citation>
</ref>
<ref id="B33">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Stedinger</surname> <given-names>J. R.</given-names></name> <name><surname>Vogel</surname> <given-names>R. M.</given-names></name> <name><surname>Foufoula-Georgiou</surname> <given-names>E.</given-names></name></person-group> (<year>1993</year>). <article-title>&#x0201C;Frequency analysis of extreme events,&#x0201D;</article-title> in <source>Handbook of Hydrology</source>, ed. D. R. Maidment (New York, NY: McGraw Hill), <fpage>18</fpage>.1&#x02013;18.66.</citation>
</ref>
<ref id="B34">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Steinschneider</surname> <given-names>S.</given-names></name> <name><surname>Brown</surname> <given-names>C.</given-names></name></person-group> (<year>2015</year>). <article-title>Water planning under hydrological uncertainty: using ensembles and scenario optimization for the assessment of robust decision alternatives</article-title>. <source>Water Resour. Res</source>. <volume>51</volume>, <fpage>2959</fpage>&#x02013;<lpage>2973</lpage>.</citation>
</ref>
<ref id="B35">
<citation citation-type="web"><person-group person-group-type="author"><collab>U.S. Army Corps of Engineers Hydrologic Engineering Center..</collab></person-group> (<year>2025</year>). <source>HEC-RAS: River Analysis System (Version 6.7) [Computer software].</source> Davis, CA: U.S. Army Corps of Engineers, Institute for Water Resources. Available online at: <ext-link ext-link-type="uri" xlink:href="https://www.hec.usace.army.mil/software/hec-ras/">https://www.hec.usace.army.mil/software/hec-ras/</ext-link></citation>
</ref>
<ref id="B36">
<citation citation-type="book"><person-group person-group-type="author"><collab>United Nations Office for Disaster Risk Reduction</collab></person-group> (<year>2020</year>). <source>Disaster Risk Reduction in Tunisia: National Progress Report on the Implementation of the Hyogo Framework for Action</source>. <publisher-loc>Technical report. Geneva</publisher-loc>: <publisher-name>UNDRR</publisher-name>.</citation>
</ref>
<ref id="B37">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Uysal</surname> <given-names>G.</given-names></name> <name><surname>&#x0015E;ensoy</surname> <given-names>A.</given-names></name> <name><surname>Schwanenberg</surname> <given-names>D.</given-names></name> <name><surname>Montero</surname> <given-names>R.</given-names></name></person-group> (<year>2018</year>). <article-title>Short-term control of a storage hydropower under flood risk by multi-stage stochastic optimization</article-title>. <source>Proc. 3rd IAHR Europe Congress</source> <volume>3</volume>, <fpage>2120</fpage>&#x02013;<lpage>2126</lpage>. <pub-id pub-id-type="doi">10.29007/cl7s</pub-id></citation>
</ref>
<ref id="B38">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wang</surname> <given-names>Q.</given-names></name> <name><surname>Gu</surname> <given-names>Q.</given-names></name> <name><surname>Chen</surname> <given-names>L.</given-names></name> <name><surname>Guo</surname> <given-names>Y.</given-names></name> <name><surname>Xiong</surname> <given-names>N.</given-names></name></person-group> (<year>2023</year>). <article-title>A dynamic multi-objective optimization method based on classification strategies</article-title>. <source>Sci. Rep</source>. <volume>13</volume>:<fpage>16758</fpage>. <pub-id pub-id-type="doi">10.1038/s41598-023-41855-2</pub-id><pub-id pub-id-type="pmid">37709788</pub-id></citation></ref>
<ref id="B39">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wang</surname> <given-names>Q.</given-names></name> <name><surname>Li</surname> <given-names>A.</given-names></name> <name><surname>Lu</surname> <given-names>C.</given-names></name></person-group> (<year>2022</year>). <article-title>Multi-objective optimization of large-scale multi-reservoir flood control operation</article-title>. <source>J. Phys. Conf. Ser</source>. <volume>2333</volume>:<fpage>012016</fpage>. <pub-id pub-id-type="doi">10.1088/1742-6596/2333/1/012016</pub-id><pub-id pub-id-type="pmid">38351069</pub-id></citation></ref>
<ref id="B40">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Watkins</surname> <given-names>D. W.</given-names></name> <name><surname>McKinney</surname> <given-names>D. C.</given-names></name></person-group> (<year>2000</year>). <article-title>Decomposition methods for water resources optimization models with fixed costs</article-title>. <source>Adv. Water Resour</source>. <volume>23</volume>, <fpage>463</fpage>&#x02013;<lpage>472</lpage>.</citation>
</ref>
<ref id="B41">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Watson</surname> <given-names>J.-P.</given-names></name> <name><surname>Woodruff</surname> <given-names>D. L.</given-names></name></person-group> (<year>2011</year>). <article-title>Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems</article-title>. <source>Comput. Manag. Sci</source>. <volume>8</volume>, <fpage>355</fpage>&#x02013;<lpage>370</lpage>. <pub-id pub-id-type="doi">10.1007/s10287-010-0125-4</pub-id></citation>
</ref>
<ref id="B42">
<citation citation-type="web"><person-group person-group-type="author"><name><surname>Woodruff</surname> <given-names>D. L.</given-names></name> <name><surname>Knueven</surname> <given-names>B.</given-names></name> <name><surname>Bynum</surname> <given-names>M. L.</given-names></name></person-group> (<year>2023</year>). <source>Gradient-Based Rho Parameter for Progressive Hedging. Optimization Online</source>. Available online at: <ext-link ext-link-type="uri" xlink:href="https://optimization-online.org/2023/08/gradient-based-rho-parameter-for-progressive-hedging/">https://optimization-online.org/2023/08/gradient-based-rho-parameter-for-progressive-hedging/</ext-link> (Accessed March 15, 2025).</citation>
</ref>
<ref id="B43">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Xu</surname> <given-names>X.</given-names></name> <name><surname>Zhuang</surname> <given-names>X.</given-names></name> <name><surname>Chen</surname> <given-names>G.</given-names></name> <name><surname>Zhang</surname> <given-names>K.</given-names></name> <name><surname>Jia</surname> <given-names>H.</given-names></name></person-group> (<year>2024</year>). <article-title>Multi-objective optimization of reservoir development strategy with hybrid artificial intelligence method</article-title>. <source>Expert Syst. Appl</source>. <volume>238</volume>:<fpage>121912</fpage>. <pub-id pub-id-type="doi">10.1016/j.eswa.2023.122707</pub-id><pub-id pub-id-type="pmid">40664954</pub-id></citation></ref>
<ref id="B44">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yates</surname> <given-names>D.</given-names></name> <name><surname>Sieber</surname> <given-names>J.</given-names></name> <name><surname>Purkey</surname> <given-names>D.</given-names></name> <name><surname>Huber-Lee</surname> <given-names>A.</given-names></name></person-group> (<year>2005</year>). <article-title>Weap21&#x02013;a demand-, priority-, and preference-driven water planning model. Part 1: model characteristics</article-title>. <source>Water Int</source>. <volume>30</volume>, <fpage>487</fpage>&#x02013;<lpage>500</lpage>. <pub-id pub-id-type="doi">10.1080/02508060508691893</pub-id></citation>
</ref>
<ref id="B45">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zanutto</surname> <given-names>A.</given-names></name> <name><surname>Giuliani</surname> <given-names>M.</given-names></name> <name><surname>Castelletti</surname> <given-names>A.</given-names></name></person-group> (<year>2025</year>). <article-title>Reinforcement learning of multi-timescale forecast information for designing operating policies of multi-purpose reservoirs</article-title>. <source>Water Resour. Res</source>. <volume>61</volume>:<fpage>e2023W</fpage>R036724. <pub-id pub-id-type="doi">10.1029/2023WR036724</pub-id></citation>
</ref>
<ref id="B46">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhang</surname> <given-names>X.</given-names></name> <name><surname>Luo</surname> <given-names>J.</given-names></name> <name><surname>Sun</surname> <given-names>X.</given-names></name> <name><surname>Xie</surname> <given-names>J.</given-names></name></person-group> (<year>2019</year>). <article-title>Optimal reservoir flood operation using a decomposition-based multi-objective evolutionary algorithm</article-title>. <source>Eng. Optim</source>. <volume>51</volume>, <fpage>42</fpage>&#x02013;<lpage>62</lpage>. <pub-id pub-id-type="doi">10.1080/0305215X.2018.1439942</pub-id></citation>
</ref>
</ref-list>
</back>
</article>