Computational advances along with the profound impact of uncertainty on power system investments have motivated the creation of power system planning frameworks that handle long-run uncertainty, large number of alternative plans, and multiple objectives. Planning agencies seek guidance to assess such frameworks. This article addresses this need in two ways. First, we augment previously proposed criteria for assessing planning frameworks by including new criteria such as stakeholder acceptance to make the assessments more comprehensive, while enhancing the practical applicability of assessment criteria by offering criterion-specific themes and questions. Second, using the proposed criteria, we compare two widely used but fundamentally distinct frameworks: an ‘agree-on-plans’ framework, Robust Decision Making (RDM), and an ‘agree-on-assumptions’ framework, centered around Stochastic Programming (SP). By comparing for the first time head-to-head the two distinct frameworks for an electricity supply planning problem under uncertainties in Bangladesh, we conclude that RDM relies on a large number of simulations to provide ample information to decision makers and stakeholders, and to facilitate updating of subjective inputs. In contrast, SP is a highly dimensional optimization problem that identifies plans with relatively good probability-weighted performance in a single step, but even with computational advances remains subject to the curse of dimensionality.
more »
« less
A Review of Robust Operations Management under Model Uncertainty
Over the past two decades, there has been explosive growth in the application of robust optimization in operations management (robust OM), fueled by both significant advances in optimization theory and a volatile business environment that has led to rising concerns about model uncertainty. We review some common modeling frameworks in robust OM, including the representation of uncertainty and the decision‐making criteria, and sources of model uncertainty that have arisen in the literature, such as demand, supply, and preference. We discuss the successes of robust OM in addressing model uncertainty, enriching decision criteria, generating structural results, and facilitating computation. We also discuss several future research opportunities and challenges.
more »
« less
- Award ID(s):
- 1727478
- PAR ID:
- 10378473
- Publisher / Repository:
- SAGE Publications
- Date Published:
- Journal Name:
- Production and Operations Management
- Volume:
- 30
- Issue:
- 6
- ISSN:
- 1059-1478
- Format(s):
- Medium: X Size: p. 1927-1943
- Size(s):
- p. 1927-1943
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Over the last two decades, robust optimization has emerged as a popular means to address decision-making problems affected by uncertainty. This includes single-stage and multi-stage problems involving real-valued and/or binary decisions and affected by exogenous (decision-independent) and/or endogenous (decision-dependent) uncertain parameters. Robust optimization techniques rely on duality theory potentially augmented with approximations to transform a (semi-)infinite optimization problem to a finite program, the robust counterpart. Whereas writing down the model for a robust optimization problem is usually a simple task, obtaining the robust counterpart requires expertise. To date, very few solutions are available that can facilitate the modeling and solution of such problems. This has been a major impediment to their being put to practical use. In this paper, we propose ROC++, an open-source C++ based platform for automatic robust optimization, applicable to a wide array of single-stage and multi-stage robust problems with both exogenous and endogenous uncertain parameters, that is easy to both use and extend. It also applies to certain classes of stochastic programs involving continuously distributed uncertain parameters and endogenous uncertainty. Our platform naturally extends existing off-the-shelf deterministic optimization platforms and offers ROPy, a Python interface in the form of a callable library, and the ROB file format for storing and sharing robust problems. We showcase the modeling power of ROC++ on several decision-making problems of practical interest. Our platform can help streamline the modeling and solution of stochastic and robust optimization problems for both researchers and practitioners. It comes with detailed documentation to facilitate its use and expansion. The latest version of ROC++ can be downloaded from https://sites.google.com/usc.edu/robust-opt-cpp/ . Summary of Contribution: The paper “ROC++: Robust Optimization in C++” proposes a new open-source C++ based platform for modeling, automatically reformulating, and solving robust optimization problems. ROC++ can address both single-stage and multi-stage problems involving exogenous and/or endogenous uncertain parameters and real- and/or binary-valued adaptive variables. The ROC++ modeling language is similar to the one provided for the deterministic case by state-of-the-art deterministic optimization solvers. ROC++ comes with detailed documentation to facilitate its use and expansion. It also offers ROPy, a Python interface in the form of a callable library. The latest version of ROC++ can be downloaded from https://sites.google.com/usc.edu/robust-opt-cpp/ . History: Accepted by Ted Ralphs, Area Editor for Software Tools. Funding: This material is based upon work supported by the National Science Foundation under Grant No. 1763108. This support is gratefully acknowledged. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplementary Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.1209 ) or is available from the IJOC GitHub software repository ( https://github.com/INFORMSJoC ) at ( https://dx.doi.org/10.5281/zenodo.6360996 ).more » « less
-
What policy should be employed in a Markov decision process with uncertain parameters? Robust optimization answer to this question is to use rectangular uncertainty sets, which independently reflect available knowledge about each state, and then obtains a decision policy that maximizes expected reward for the worst-case decision process parameters from these uncertainty sets. While this rectangularity is convenient computationally and leads to tractable solutions, it often produces policies that are too conservative in practice, and does not facilitate knowledge transfer between portions of the state space or across related decision processes. In this work, we propose non-rectangular uncertainty sets that bound marginal moments of state-action features defined over entire trajectories through a decision process. This enables generalization to different portions of the state space while retaining appropriate uncertainty of the decision process. We develop algorithms for solving the resulting robust decision problems, which reduce to finding an optimal policy for a mixture of decision processes, and demonstrate the benefits of our approach experimentally.more » « less
-
Hybrid (i.e., grey-box) models are a powerful and flexible paradigm for predictive science and engineering. Grey-box models use data-driven constructs to incorporate unknown or computationally intractable phenomena into glass-box mechanistic models. The pioneering work of statisticians Kennedy and O’Hagan introduced a new paradigm to quantify epistemic (i.e., model-form) uncertainty. While popular in several engineering disciplines, prior work using Kennedy–O’Hagan hybrid models focuses on prediction with accurate uncertainty estimates. This work demonstrates computational strategies to deploy Bayesian hybrid models for optimization under uncertainty. Specifically, the posterior distributions of Bayesian hybrid models provide a principled uncertainty set for stochastic programming, chance-constrained optimization, or robust optimization. Through two illustrative case studies, we demonstrate the efficacy of hybrid models, composed of a structurally inadequate glass-box model and Gaussian process bias correction term, for decision-making using limited training data. From these case studies, we develop recommended best practices and explore the trade-offs between different hybrid model architectures.more » « less
-
The United Nations Sustainable Development Goals provide a road map for countries to achieve peace and prosperity. In this study, we address two of these sustainable development goals: achieving food security and reducing inequalities. Food banks are nonprofit organizations that collect and distribute food donations to food‐insecure populations in their service regions. Food banks consider three criteria while distributing the donated food: equity, effectiveness, and efficiency. The equity criterion aims to distribute food in proportion to the food‐insecure households in a food bank's service area. The effectiveness criterion aims to minimize undistributed food, whereas the efficiency criterion minimizes the total cost of transportation. Models that assume predetermined weights on these criteria may produce inaccurate results as the preference of food banks over these criteria may vary over time, and as a function of supply and demand. In collaboration with our food bank partner in North Carolina, we develop a single‐period, weighted multi‐criteria optimization model that provides the decision‐maker the flexibility to capture their preferences over the three criteria of equity, effectiveness, and efficiency, and explore the resulting trade‐offs. We then introduce a novel algorithm that elicits the inherent preference of a food bank by analyzing its actions within a single‐period. The algorithm does not require direct interaction with the decision‐maker. The non‐interactive nature of this algorithm is especially significant for humanitarian organizations such as food banks which lack the resources to interact with modelers on a regular basis. We perform extensive numerical experiments to validate the efficiency of our algorithm. We illustrate results using historical data from our food bank partner and discuss managerial insights. We explore the implications of different decision‐maker preferences for the criteria on distribution policies.more » « less