Byron Tasseff

Dr. Byron Tasseff

orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 November 2018 in Frontiers in Public Health
Verified
Journal Article
Open access
GFGeoffrey Fairchild
Geoffrey Fairchild
BTByron Tasseff
Byron Tasseff
HKHari Khalsa
Hari Khalsa
NGNicholas Generous
Nicholas Generous
ADAshlynn R. Daughton
Ashlynn R. Daughton
ADAlina Deshpande
Alina Deshpande
Accessible epidemiological data are of great value for emergency preparedness and response, understanding disease progression through a population, and building statistical and mechanistic disease models that enable forecasting. The status quo, however, renders acquiring and using such data difficult in practice. In many cases, a primary way of obtaining epidemiological data is through the internet, but the methods by which the data are presented to the public often differ drastically among institutions. As a result, there is a strong need for better data sharing practices. This paper identifies, in detail and with examples, the three key challenges one encounters when attempting to acquire and use epidemiological data: 1) interfaces, 2) data formatting, and 3) reporting. These challenges are used to provide suggestions and guidance for improvement as these systems evolve in the future. If these suggested data and interface recommendations were adhered to, epidemiological and public health analysis, modeling, and informatics work would be significantly streamlined, which can in turn yield better public health decision-making capabilities.

17 October 2018 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
CCCarleton Coffrin
Carleton Coffrin
RBRussell Bent
Russell Bent
BTByron Tasseff
Byron Tasseff
KSKaarthik Sundar
Kaarthik Sundar
SBScott Backhaus
Scott Backhaus
This work considers the task of finding an AC-feasible operating point of a severely damaged transmission network while ensuring that a maximal amount of active power loads can be delivered. This AC Maximal Load Delivery (AC-MLD) task is a nonlinear, non-convex optimization problem, and is incredibly challenging to solve on large-scale transmission system datasets. This work demonstrates that convex relaxations of the AC-MLD problem provide a reliable and scalable method for finding high-quality bounds on the amount of active power that can be delivered in the AC-MLD problem. To demonstrate their effectiveness, the solution methods proposed in this work are rigorously evaluated on 1000 $N-k$ scenarios on seven power networks ranging in size from 70 to 6000 buses. The most effective relaxation of the AC-MLD problem converges in less than 20 seconds on commodity computing hardware for all 7000 of the scenarios considered.

21 February 2019 in Water Resources Research
Verified
Journal Article
Open access
PDF file
BTByron Tasseff
Byron Tasseff
RBRussell Bent
Russell Bent
PHPascal Van Hentenryck
Pascal Van Hentenryck
The dynamics of flooding are primarily influenced by the shape, height, and roughness (friction) of the underlying topography. For this reason, mechanisms to mitigate floods frequently employ structural measures that either modify topographic elevation, for example, through the placement of levees and sandbags, or increase roughness, for example, through revegetation projects. However, the configuration of these measures is typically decided in an ad hoc manner, limiting their overall effectiveness. The advent of high‐performance surface‐water modeling software and improvements in black‐box optimization suggest that a more principled design methodology may be possible. This paper proposes a new computational approach to the problem of designing structural mitigation strategies under physical and budgetary constraints. It presents the development of a problem discretization amenable to simulation‐based, derivative‐free optimization. However, meta‐heuristics alone are found to be insufficient for obtaining quality solutions in a reasonable amount of time. As a result, this paper proposes novel numerical and physics‐based procedures to improve convergence to a high‐quality mitigation. The efficiency of the approach is demonstrated on hypothetical dam break scenarios of varying complexity under various mitigation budget constraints. In particular, experimental results show that, on average, the final proposed algorithm results in a 65% improvement in solution quality compared to a direct implementation.

1 July 2024 in INFORMS Journal on Computing
Verified
Journal Article
Closed access
BTByron Tasseff
Byron Tasseff
RBRussell Bent
Russell Bent
CCCarleton Coffrin
Carleton Coffrin
CBClayton Barrows
Clayton Barrows
DSDevon Sigler
Devon Sigler
PHPascal Van Hentenryck
Pascal Van Hentenryck
The classic pump scheduling or optimal water flow (OWF) problem for water distribution networks (WDNs) minimizes the cost of power consumption for a given WDN over a fixed time horizon. In its exact form, the OWF is a computationally challenging mixed-integer nonlinear program (MINLP). It is complicated by nonlinear equality constraints that model network physics, discrete variables that model operational controls, and intertemporal constraints that model changes to storage devices. To address the computational challenges of the OWF, this paper develops tight polyhedral relaxations of the original MINLP, derives novel valid inequalities (or cuts) using duality theory, and implements novel optimization-based bound tightening and cut generation procedures. The efficacy of each new method is rigorously evaluated by measuring empirical improvements in OWF primal and dual bounds over 45 literature instances. The evaluation suggests that our relaxation improvements, model strengthening techniques, and a thoughtfully selected polyhedral relaxation partitioning scheme can substantially improve OWF primal and dual bounds, especially when compared with similar relaxation-based techniques that do not leverage these new methods. History: Accepted by David Alderson, Area Editor for Network Optimization: Algorithms & Applications. Funding: This work was supported by the U.S. Department of Energy (DOE) Advanced Grid Modeling project, Coordinated Planning and Operation of Water and Power Infrastructures for Increased Resilience and Reliability. Incorporation of the PolyhedralRelaxations Julia package was supported by Los Alamos National Laboratory’s Directed Research and Development program under the project Fast, Linear Programming-Based Algorithms with Solution Quality Guarantees for Nonlinear Optimal Control Problems [Grant 20220006ER]. All work at Los Alamos National Laboratory was conducted under the auspices of the National Nuclear Security Administration of the U.S. DOE, Contract No. 89233218CNA000001. This work was also authored in part by the National Renewable Energy Laboratory, operated by the Alliance for Sustainable Energy, LLC, for the U.S. DOE, Contract No. DE-AC36-08GO28308. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0233 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2022.0233 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

12 May 2016 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
BTByron Tasseff
Byron Tasseff
RBRussell Bent
Russell Bent
PHPascal Van Hentenryck
Pascal Van Hentenryck

18 October 2022 in Computers & Chemical Engineering
Verified
Journal Article
Closed access
BTByron Tasseff
Byron Tasseff
CCCarleton Coffrin
Carleton Coffrin
RBRussell Bent
Russell Bent
KSKaarthik Sundar
Kaarthik Sundar
AZAnatoly Zlotnik
Anatoly Zlotnik