skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Plausible Screening Using Functional Properties for Simulations with Large Solution Spaces
When working with models that allow for many candidate solutions, simulation practitioners can benefit from screening out unacceptable solutions in a statistically controlled way. However, for large solution spaces, estimating the performance of all solutions through simulation can prove impractical. We propose a statistical framework for screening solutions even when only a relatively small subset of them is simulated. Our framework derives its superiority over exhaustive screening approaches by leveraging available properties of the function that describes the performance of solutions. The framework is designed to work with a wide variety of available functional information and provides guarantees on both the confidence and consistency of the resulting screening inference. We provide explicit formulations for the properties of convexity and Lipschitz continuity and show through numerical examples that our procedures can efficiently screen out many unacceptable solutions.  more » « less
Award ID(s):
1854562 1953111
PAR ID:
10335111
Author(s) / Creator(s):
; ;
Date Published:
Journal Name:
Operations Research
ISSN:
0030-364X
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; ; ; (, Green Chemistry)
    null (Ed.)
    The world faces an increasing need to phase out harmful chemicals and design sustainable alternatives across various consumer products and industrial applications. Alternatives assessment is an emerging field with focus on identifying viable solutions to substitute harmful chemicals. However, current methods fail to consider trade-offs from human and ecosystem exposures, and from impacts associated with chemical supply chains and product life cycles. To close this gap, we propose a life cycle based alternatives assessment (LCAA) framework for consistently integrating quantitative exposure and life cycle impact performance in the substitution process. We start with a pre-screening based on function-related decision rules, followed by three progressive tiers from (1) rapid risk screening of various alternatives for the consumer use stage, to (2) an assessment of chemical supply chain impacts for selected alternatives with substantially different synthesis routes, and (3) an assessment of product life cycle impacts for alternatives with substantially different product life cycles. Each tier focuses on relevant impacts and uses streamlined assessment methods. While the initial risk screening will be sufficient for evaluating chemicals with similar supply chains, each additional tier helps further restricting the number of viable solutions, while avoiding unacceptable trade-offs. We test our LCAA framework in a proof-of-concept case study for identifying suitable alternatives to a harmful plasticizer in household flooring. Results show that the use stage dominates human health impacts across alternatives, supporting that a rapid risk screening is sufficient unless very different supply chains or a broader set of alternative materials or technologies are considered. Combined with currently used indicators for technical and economic performance, our LCAA framework is suitable for informing function-based substitution at the level of chemicals, materials and product applications to foster green and sustainable chemistry solutions. 
    more » « less
  2. (, Proceedings of the 2018 Winter Simulation Conference)
    We propose a framework and specific algorithms for screening a large (perhaps countably infinite) spaceof feasible solutions to generate a subset containing the optimal solution with high confidence. We attainthis goal even when only a small fraction of the feasible solutions are simulated. To accomplish it weexploit structural information about the space of functions within which the true objective function lies, andthen assess how compatible optimality is for each feasible solution with respect to the observed simulation outputs and the assumed function space. The result is a set of plausible optima. This approach can be viewed as a way to avoid slow simulation by leveraging fast optimization. Explicit formulations of the general approach are provided when the space of functions is either Lipschitz or convex. We establish both small- and large-sample properties of the approach, and provide two numerical examples. 
    more » « less
  3. ; ; (, 2020 IEEE International Conference on Robotics and Automation (ICRA))
    We present an open-source framework that provides a low barrier to entry for real-time simulation, visualization, and interactive manipulation of user-specifiable soft-bodies, environments, and robots (using a human-readable front-end interface). The simulated soft-bodies can be interacted by a variety of input interface devices including commercially available haptic devices, game controllers, and the Master Tele-Manipulators (MTMs) of the da Vinci Research Kit (dVRK) with real-time haptic feedback. We propose this framework for carrying out multi-user training, user-studies, and improving the control strategies for manipulation problems. In this paper, we present the associated challenges to the development of such a framework and our proposed solutions. We also demonstrate the performance of this framework with examples of soft-body manipulation and interaction with various input devices. 
    more » « less
  4. ; (, Proceedings of the National Academy of Sciences of the United States of America)
    Many models of learning in teams assume that team members can share solutions or learn concurrently. However, these assumptions break down in multidisciplinary teams where team members often complete distinct, interrelated pieces of larger tasks. Such contexts make it difficult for individuals to separate the performance effects of their own actions from the actions of interacting neighbors. In this work, we show that individuals can overcome this challenge by learning from network neighbors through mediating artifacts (like collective performance assessments). When neighbors’ actions influence collective outcomes, teams with different networks perform relatively similarly to one another. However, varying a team’s network can affect performance on tasks that weight individuals’ contributions by network properties. Consequently, when individuals innovate (through “exploring” searches), dense networks hurt performance slightly by increasing uncertainty. In contrast, dense networks moderately help performance when individuals refine their work (through “exploiting” searches) by efficiently finding local optima. We also find that decentralization improves team performance across a battery of 34 tasks. Our results offer design principles for multidisciplinary teams within which other forms of learning prove more difficult. 
    more » « less
  5. ; (, INFORMS Journal on Computing)
    We study two-stage stochastic optimization problems with random recourse, where the coefficients of the adaptive decisions involve uncertain parameters. To deal with the infinite-dimensional recourse decisions, we propose a scalable approximation scheme via piecewise linear and piecewise quadratic decision rules. We develop a data-driven distributionally robust framework with two layers of robustness to address distributional uncertainty. We also establish out-of-sample performance guarantees for the proposed scheme. Applying known ideas, the resulting optimization problem can be reformulated as an exact copositive program that admits semidefinite programming approximations. We design an iterative decomposition algorithm, which converges under some regularity conditions, to reduce the runtime needed to solve this program. Through numerical examples for various known operations management applications, we demonstrate that our method produces significantly better solutions than the traditional sample-average approximation scheme especially when the data are limited. For the problem instances for which only the recourse cost coefficients are random, our method exhibits slightly inferior out-of-sample performance but shorter runtimes compared with a competing approach. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email