1 July 2021 in Journal of Air Transport Management
1 July 2024 in INFORMS Journal on Computing
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/ .
3 June 2022 in Transportation Research Record: Journal of the Transportation Research Board
Most of the existing traffic simulation packages require significant calibration work to be able to reflect reality. To evaluate special operations including emerging technologies, a microscopic simulation that tracks detailed interactions of all the elements of the traffic systems is usually needed. This type of simulation is usually computationally demanding. This work developed an Airport Shuttle Planning and Improved Routing Event-driven Simulation (ASPIRES) package to simulate and evaluate current, potential, and future airport shuttle operations. The simulation was driven by data and thus did not require much calibration effort. The discrete-event simulation nature of ASPIRES makes the simulation computationally efficient. Simulating 1 day of shuttle operations takes less than 2 s. The study site of this work is the Dallas/Fort Worth International Airport in the U.S. The shuttle service that connects the five terminals of the airport and the rental car center was studied. Travel times, dwell times, and passenger arrivals were simulated using empirical distributions derived mainly from real data to capture the stochastic nature of the rental car center shuttle bus operations. Data on bus miles traveled, bus energy consumption, passenger wait times, and passengers left behind at stops were collected to study the trade-off between energy use and passenger experience. Electric bus and on-demand bus operations were also included. The simulation outputs can show passengers statistics at terminals, shuttles statistics, and charging station statistics. ASPIRES cannot be used to model a generic traffic system but is well-suited for fleet systems.
24 May 2019 in IEEE Transactions on Power Systems
While contiguous power systems are often operated by several regional system operators, optimization models have traditionally been designed to generate optimal system-wide scheduling decisions. This research presents an approach to reflect the existence of multiple system operators making scheduling decisions within an interconnected power system. The approach is explicitly designed to reflect each operator's limited knowledge about other regions when making scheduling decisions. Detailed analysis using a modified IEEE Reliability Test System reveals that the approach mimics real system operations by providing imperfect information to each operator about external operations and external constraints. The approach scales to a 78,000-bus model of the Eastern Interconnection, where a regression analysis provides quantitative insight into which constraints cause inefficiencies when improperly managed in a multi-operator simulation. Because the approach generates distinct regional scheduling problems, unit commitment and economic dispatch simulations can be applied to individual regions and solved in parallel, enabling production cost simulations at a previously intractable scale.
15 February 2024 in INFORMS Journal on Computing
This archive is distributed in association with the INFORMS Journal on Computing under a BSD license as part of the Multi-Infrastructure Control and Optimization Toolkit (MICOT) project at Los Alamos National Laboratory, LA-CC-13-108. The software and data in this repository comprise a snapshot of similar artifacts used in the production of the article Polyhedral Relaxations for Optimal Pump Scheduling of Potable Water Distribution Networks by B. Tasseff, R. Bent, C. Coffrin, C. Barrows, D. Sigler, J. Stickel, A. S. Zamzam, Y. Liu, and P. Van Hentenryck. This snapshot is based on the specific inputs and software found in the data and src directories, respectively. Snapshots of unprocessed experimental outputs are provided in the subdirectories of results. Finally, various precompilation, execution, batch cluster submission, and analytical postprocessing utilities are provided in the scripts directory.
27 December 2025 in arXiv
Efficiently solving large-scale optimal power flow (OPF) problems is challenging due to the high dimensionality and interconnectivity of modern power systems. Decomposition methods offer a promising solution via partitioning large problems into smaller subproblems that can be solved in parallel, often with local information. These approaches reduce computational burden and improve flexibility by allowing agents to manage their local models. This article introduces a decomposition method that enables a distributed solution to OPF problems. The proposed method solves OPF problems with a sensitivity-based formulation using the alternating direction method of multipliers (ADMM) algorithm. We also propose a distributed method to compute system-wide sensitivities without sharing local parameters. This approach facilitates scalable optimization while satisfying global constraints and limiting data sharing. We demonstrate the effectiveness of the proposed approach using a large set of test systems and compare its performance against existing decomposition methods. The results show that the proposed method significantly outperforms the typical phase-angle formulation with a 14-times faster computation speed on average.