Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Integer programming.”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 451 records · Page 25
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

A two-stage service restoration method for electric power distribution systems

Improving the reliability of power distribution systems is critically important for both utilities and customers. This calls for an efficient service restoration module within a distribution management system to support the implementation of self-healing smart grid networks. Although the emerging smart grid technologies, including distributed generators (DGs) and remote-controlled switches, enhance the self-healing capability and allow faster recovery, they still pose additional complexity to the service restoration problem, especially under cold load pickup (CLPU) conditions. Herein, a novel two-stage restoration framework is proposed to generate a restoration solutions with a sequence of control actions. The first stage generates a restoration plan that supports both the traditional service restoration using feeder reconfiguration and the grid-forming DG-assisted intentional islanding methods. The second stage generates an optimal sequence of switching operations to bring the outaged system quickly to the final restored configuration. The problem is formulated as a mixed-integer linear program that incorporates system connectivity, operating constraints, and the CLPU models. It is demonstrated that on using a multi-feeder test case, the proposed framework is effective in utilizing all available resources to quickly restore the service and generate an optimal sequence of switching actions to be used by the operator to reach the desired optimal configuration.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Sensor Placement Optimization Software Applied to Site-Scale Methane-Emissions Monitoring

Advances in sensor technology have increased our ability to monitor a wide range of environments. However, even as the cost of sensors decline, only a limited number of sensors can be installed at any given site. The physical placement of sensors, along with the sensor technology and operating conditions, can have a large impact on our ability to adequately monitor environmental change. This paper introduces a new open-source Python package, called Chama, that determines optimal sensor placement and technology to improve a sensor network’s detection capabilities. Additionally, the methods are demonstrated using site-specific methane emission scenarios that capture uncertainty in wind conditions and emission characteristics. Mixed-integer linear programming formulations are used to determine sensor locations and detection thresholds that maximize detection of the emission scenarios. The optimized sensor networks consistently increase the ability to detect leaks, as compared to sensors placed near each potential emission source or along the perimeter of the site.

47 OTHER INSTRUMENTATION↗
DOE OSTI2019

The Zwicky Transient Facility: Surveys and Scheduler

Presented here is a novel algorithm for scheduling the observations of time-domain imaging surveys. Our integer linear programming approach optimizes an observing plan for an entire night by assigning targets to temporal blocks, enabling strict control of the number of exposures obtained per field and minimizing filter changes. A subsequent optimization step minimizes slew times between each observation. Our optimization metric self-consistently weights contributions from time-varying airmass, seeing, and sky brightness to maximize the transient discovery rate. We describe the implementation of this algorithm on the surveys of the Zwicky Transient Facility and present its on-sky performance.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2018

Accelerating flux balance calculations in genome-scale metabolic models by localizing the application of loopless constraints

Abstract Background Genome-scale metabolic network models and constraint-based modeling techniques have become important tools for analyzing cellular metabolism. Thermodynamically infeasible cycles (TICs) causing unbounded metabolic flux ranges are often encountered. TICs satisfy the mass balance and directionality constraints but violate the second law of thermodynamics. Current practices involve implementing additional constraints to ensure not only optimal but also loopless flux distributions. However, the mixed integer linear programming problems required to solve become computationally intractable for genome-scale metabolic models. Results We aimed to identify the fewest needed constraints sufficient for optimality under the loopless requirement. We found that loopless constraints are required only for the reactions that share elementary flux modes representing TICs with reactions that are part of the objective function. We put forth the concept of localized loopless constraints (LLCs) to enforce this minimal required set of loopless constraints. By combining with a novel procedure for minimal null-space calculation, the computational time for loopless flux variability analysis (ll-FVA) is reduced by a factor of 10–150 compared to the original loopless constraints and by 4–20 times compared to the current fastest method Fast-SNP with the percent improvement increasing with model size. Importantly, LLCs offer a scalable strategy for loopless flux calculations for multi-compartment/multi-organism models of large sizes, for example, shortening the CPU time for ll-FVA from 35 h to less than 2 h for a model with more than104 reactions. Availability and implementation Matlab functions are available in the Supplementary Material or at https://github.com/maranasgroup/lll-FVA Supplementary information Supplementary data are available at Bioinformatics online.

Chan, Siu H. J. (ORCID:000000027707656X)↗
DOE OSTI2019

CoBAMP: a Python framework for metabolic pathway analysis in constraint-based models

Abstract Summary CoBAMP is a modular framework for the enumeration of pathway analysis concepts, such as elementary flux modes (EFM) and minimal cut sets in genome-scale constraint-based models (CBMs) of metabolism. It currently includes the K-shortest EFM algorithm and facilitates integration with other frameworks involving reading, manipulation and analysis of CBMs. Availability and implementation The software is implemented in Python 3, supported on most operating systems and requires a mixed-integer linear programming optimizer supported by the optlang framework. Source-code is available at https://github.com/BioSystemsUM/cobamp.

Vieira, Vítor (ORCID:0000000196049586)↗
DOE OSTI2022

An ℓ 0 ℓ 2 -norm regularized regression model for construction of robust cluster expansions in multicomponent systems

In this work we introduce ℓ 0 ℓ 2 -norm regularization and hierarchy constraints into linear regression for the construction of cluster expansions to describe configurational disorder in materials. The approach is implemented through mixed integer quadratic programming (MIQP). The ℓ 2 -norm regularization is used to suppress intrinsic data noise, while the ℓ 0 -norm is used to penalize the number of nonzero elements in the solution. The hierarchy relation between clusters imposes relevant physics and is naturally included by the MIQP paradigm. As such, sparseness and cluster hierarchy can be well optimized to obtain a robust, converged set of effective cluster interactions with improved physical meaning. We demonstrate the effectiveness of ℓ 0 ℓ 2 -norm regularization in two high-component disordered rocksalt cathode material systems, where we compare the cross-validation, convergence speed, and the reproduction of phase diagrams, voltage profiles, and Li-occupancy energies with those of the conventional ℓ 1 -norm regularized cluster expansion models.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2025

Optimal Economic Dispatch and Load-Following Strategies for Nuclear Integrated Energy Systems

The need for distributed and adaptable energy resources that can handle the growing unpredictability in both supply and demand is rising as the power system continues to modernize. In order to satisfy those needs and maintain grid resilience, nuclear power plants can dynamically control their output, despite typically being used as baseload generators. By incorporating energy storage and renewable energy sources, nuclear integrated energy systems are designed to satisfy the electrical and thermal demands of different end-user applications while ensuring flexible power operation. These systems generate revenue by participating in both wholesale and ancillary services electricity markets, as well as commodity markets for various byproducts generated from coupled industrial processes. This study addresses the economic dispatch efficiency of a tightly coupled nuclear integrated energy system comprising a gigawatt-scale light water reactor, commercialized in the U.S., a high-temperature steam electrolysis unit, a district heating network, and specified electrical loads. To demonstrate the nuclear power plant’s flexibility within the day-ahead unit commitment and economic dispatch framework, while maintaining equilibrium even during periods of refueling outages, this paper develops a mixed-integer linear programming framework that models the subsystems and components of its nuclear steam supply system. A systematic comparative analysis of flexible versus baseload nuclear power plant operation under varying levels of renewable energy integration indicates that flexible operation enhances system profitability by more than 18% while also increasing energy storage utilization, improving reactor responsiveness to load fluctuations, and allowing for greater participation across numerous electricity markets.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2015

An ILP based Algorithm for Optimal Customer Selection for Demand Response in SmartGrids

Demand Response (DR) events are initiated by utilities during peak demand periods to curtail consumption. They ensure system reliability and minimize the utility’s expenditure. Selection of the right customers and strategies is critical for a DR event. An effective DR scheduling algorithm minimizes the curtailment error which is the absolute difference between the achieved curtailment value and the target. State-of-the-art heuristics exist for customer selection, however their curtailment errors are unbounded and can be as high as 70%. In this work, we develop an Integer Linear Programming (ILP) formulation for optimally selecting customers and curtailment strategies that minimize the curtailment error during DR events in SmartGrids. We perform experiments on real world data obtained from the University of Southern California’s SmartGrid and show that our algorithm achieves near exact curtailment values with errors in the range of 10 -7 to 10 -5 , which are within the range of numerical errors. We compare our results against the state-of-the-art heuristic being deployed in practice in the USC SmartGrid. We show that for the same set of available customer strategy pairs our algorithm performs 103 to 107 times better in terms of the curtailment errors incurred.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

PowerMappeR: Power-Optimized Mapping of SNNs onto ReRAM Crossbars coupled via Packet-Switched NoCs

Many recent efforts in developing hardware-accelerated spiking neural networks (SNNs) are characterized by deep co-design between algorithms, architectures, and devices. Architectural advances overcome device constraints by coupling together many small resistive-RAM (ReRAM) crossbars via a network-on-chip (NoC) for neuromorphic component operation. Concurrently, improved SNN training methods increase accuracy and structural sparsity in networks despite growing problem sizes. Finally, compilers leverage these attributes to minimize area and inter-crossbar communication while mapping large SNNs to sophisticated architectures. However, for compiler-driven co-design to realize increasingly complex and profitable optimizations, a compile-time view of power consumption is critical. We present PowerMappeR to express and optimize over mapping-, architecture-, and device-specific power consumption information. By modeling the dynamic power of well-established components, we develop an integer linear programming (ILP)-based, encoding-agnostic, parametric power estimation model. Using this model, we demonstrate practical improvements in area and inter-crossbar communication by 0%–9.5% and 1.4%–5.1%, respectively. We also limit hotspot formation during optimization, achieving comparable or better results in targeted metrics with up to 96.4%–97.1% restriction of hotspot magnitude. Finally, we introduce profile-guided formulations to reduce worst-case and expected-case hotspot magnitude by 40.7%–69.5% and 40.6%–56.3%, respectively. Optimizing worst-case hotspot magnitude incidentally improves expected-case magnitude by 10.85%–33.45%. Reciprocally, optimizing expected-case magnitude incidentally improves worst-case magnitude by 4.33%–39.87%. Validation against hardware simulators confirms that PowerMappeR can decrease dynamic power consumption by 12.6%–27.3%.

Pohl, Devin [ORNL] (ORCID:0009000040149027)↗
DOE OSTI2019

Secondary Voltage Control Via Demand-Side Energy Storage with Temporal Logic Specifications

This paper proposes a secondary voltage control method that can handle the temporal logic specifications (TLSs). The control objective is to schedule a control signal for energy storage system (ESS) such that the voltage variation of a defined critical bus satisfies TLSs. The TLS allows definitions of set and timing constraints at the same time, such as a finite-time restoration. A simplified analytical model is derived to describe the voltage variation of critical buses. Based on this model, a numerical optimal control problem is formulated as a mixed integer linear program to generate the proper control input for the ESS. The proposed control is verified on a lumped distribution system model. With this control diagram, supportive controllers can be easily designed to make voltage behaviors comply with grid codes and avoid unnecessary relay actions.

Zhang, Yichen↗
DOE OSTI2021

Sequential Perturbation-based FDIA Detection using DERs for Unbalanced Distribution System

The power distribution system with its reliance on automated monitoring and control infrastructure makes it a complicated cyber-physical system and vulnerable to various cyber-attacks. This paper proposes a moving target defense inspired false data injection attack (FDIA) detection mechanism for an unbalanced distribution system. In the proposed grid diagnosis service framework, the distribution system operator judiciously manipulates power outputs of a subset of inverter-based distribution energy resources (DERs) to create secret low magnitude voltage perturbations which are inconsequential to the normal operation of the grid. A mixed-integer-linear-programming algorithm is developed to select the optimal set of DERs that can create a voltage perturbation signal of the required magnitude at each sensor location at a minimum cost. Then, a sequential detector is applied that detects for the FDIA as measurements are received from individual sensors. The performance of the proposed perturbation-based FDIA detection framework is demonstrated via simulation of the IEEE 123 bus test system.

Attack Detection↗
DOE OSTI2022

Data-Driven Generic Turbines for Distributed Wind Modeling, Optimization, and Economic Studies

As distributed energy resources (DER) become less expensive and more popular, utilities, project developers, and customers have an increasing need to model the performance of existing and proposed DER systems. Distributed wind has been shown to have widespread economic potential but is often represented by a simplified model in - or excluded from - DER modeling tools and studies. There is often no economic imperative to extend models and studies to give full consideration to distributed wind. We present a set of data-driven generic turbines derived from 16 years of annual distributed wind market survey data. The proposed methodology can be used to derive generic turbines from separate or updated data sets. Finally, a mixed-integer linear programming approach to optimal distributed wind project sizing is used to demonstrate the generic turbine models. Combined, these models and methods can reduce barriers to considering distributed wind in modeling tools and studies.

Reiman, Andrew P.↗
DOE OSTI2019

Community Microgrid Planning Considering Building Thermal Dynamics

In this paper, the building thermal dynamic characteristics are introduced in the community microgrid (MG) planning model. The proposed planning model is formulated as a mixed integer linear programming (MILP) which seeks to determine the optimal deployment strategy for various distributed energy resources (DER). The objective is to minimize the annualized cost of community MG, including investment cost in DER, operation cost for dispatchable fuel-generators (DFG), energy storage system (ESS) degradation cost, energy purchasing and peak demand charge at PCC, customer discomfort cost due to the room temperature deviation and load curtailment cost. Given the slow thermal dynamic characteristics of buildings, the heating, ventilation and air-conditioning (HVAC) system in the proposed model is treated as a demand side management (DSM) component, whose dispatch commands are provided by the central MG controller. Numerical results based on a community MG comprising of 20 residential buildings demonstrate the effectiveness of the proposed planning model and the benefits of introducing the building thermal dynamic model.

Zhang, Xiaohu↗
DOE OSTI2025

Improving Resiliency in Planning MW-Scale Medium and Heavy Duty EV Charging Stations Considering TSCOTS Optimization

Electrification of heavy-duty (HD) vehicles marks an important milestone and technical challenge in the electric vehicle (EV) industry and the public grid. However, implementing EV charging at this scale will necessitate that traditional truck stops be updated with EV charging infrastructure that could represent 10's of MW in electricity consumption. Furthermore, as the transportation sector is represented as critical infrastructure, supporting resiliency considerations in EV charging infrastructure will be critical. This paper proposes an optimization-based approach for optimally designing a MW-scale microgrid charging network. This approach transforms conventional designed truck stops into a reliable HDEV charging stations capable of overnight slow charging and 30-minute to 1 hour fast charging. Using a mixed-integer linear program formulation blending capacity planning and reliability constraints, an optimal network configuration can be solved for a proposed EV charging station that includes photovoltaic and battery energy storage capabilities.

Ponce, Moises [University of Tennessee, Knoxville ↗
DOE OSTI2024

Grid-Aware Charging and Operational Optimization for Mixed-Fleet Public Transit

The rapid growth of urban populations and the increasing need for sustainable transportation solutions have prompted a shift towards electric buses in public transit systems. However, the effective management of mixed fleets consisting of both electric and diesel buses poses significant operational challenges. One major challenge is coping with dynamic electricity pricing, where charging costs vary throughout the day. Transit agencies must optimize charging assignments in response to such dynamism while accounting for secondary considerations such as seating constraints. This paper presents a comprehensive mixed-integer linear programming (MILP) model to address these challenges by jointly optimizing charging schedules and trip assignments for mixed (electric and diesel bus) fleets while considering factors such as dynamic electricity pricing, vehicle capacity, and route constraints. We address the potential computational intractability of the MILP formulation, which can arise even with relatively small fleets, by employing a hierarchical approach tailored to the fleet composition. By using real-world data from the city of Chattanooga, Tennessee, USA, we show that our approach can result in significant savings in the operating costs of the mixed transit fleets.

Sen, Rishav↗
DOE OSTI2020

A Generalized Framework for Service Restoration in a Resilient Power Distribution System

An electric power grid is one of the complex infrastructures, and because of its complex nature, there is simply no way that outages can be completely avoided. Thus, a modern society that depends on reliable electric supply requires a resilient electric system that can recover from disruptions while integrating emerging smart grid technologies. Here, this article presents a novel approach for service restoration in a modern power distribution system with controllable switches and distributed generation (DG) resources for any kind of outage. The proposed framework supports both the traditional service restoration using feeder reconfiguration and the grid-forming DG-assisted intentional islands that are dynamically sized using algorithms based on the fault scenario, available resources, and priority of loads. The problem is formulated as a mixed-integer linear program that incorporates critical system connectivity and operating constraints. Simulations are performed to demonstrate the effectiveness of the proposed approach using a large-scale four-feeder 1069-bus three-phase unbalanced distribution test system. It is demonstrated that the framework is effective in utilizing all available resources in quickly restoring the power supply to improve resiliency during extreme events and is scalable for a large-scale unbalanced power distribution system.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Enhancing Distribution Grid Resilience Through Model Predictive Controller Enabled Prioritized Load Restoration Strategy

Effective resilience improvement strategies enable the power grid to cope with disruptive extreme events. Most power grid outages are caused by disruptions in distribution grids. Motivated by the urgent need for power system resilience research, this paper proposes a priority-weighted optimal load restoration technique to enhance the resilience of distribution grids against extreme events. The proposed technique is based on smart distribution technology and framed as sequential multi-step decision process (MDP) and mixed integer linear program (MILP). It is formulated as optimal control problem with a model predictive control (MPC) approach. We applied the devised MILP-MPC-based load restoration technique to a simplified single-bus version of the IEEE 13-bus distribution system with integrated distributed energy resources (DERs) such as wind turbine, photovoitaic array, microturbine, and energy storage device. The technique executes a reducing and rolling horizon optimization in each control step in real-time using the forecasted information of the renewables, the fuel status of the microturbine and the state of charge of the energy storage device. We consider an extreme event which triggered outage of the upstream utility grid and caused islanded operation of the distribution grid. We demonstrated the effectiveness of the proposed MPC approach in restoring the distribution grid loads based on their priority during the main grid outage-caused islanded operation.

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2015

A modified priority list-based MILP method for solving large-scale unit commitment problems

This paper studies the typical pattern of unit commitment (UC) results in terms of generator’s cost and capacity. A method is then proposed to combine a modified priority list technique with mixed integer linear programming (MILP) for UC problem. The proposed method consists of two steps. At the first step, a portion of generators are predetermined to be online or offline within a look-ahead period (e.g., a week), based on the demand curve and generator priority order. For the generators whose on/off status is predetermined, at the second step, the corresponding binary variables are removed from the UC MILP problem over the operational planning horizon (e.g., 24 hours). With a number of binary variables removed, the resulted problem can be solved much faster using the off-the-shelf MILP solvers, based on the branch-and-bound algorithm. In the modified priority list method, scale factors are designed to adjust the tradeoff between solution speed and level of optimality. It is found that the proposed method can significantly speed up the UC problem with minor compromise in optimality by selecting appropriate scale factors.

Ke, Xinda↗