Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Mixed integer optimization”

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

Optimal Operation of Grid-Tied Energy Storage Systems Considering Detailed Device-Level Battery Models

The current optimization-based algorithms to operate grid-tied battery energy storage systems (BESS) typically do not look much under the hood of the BESS, i.e., the device-level characteristics of the batteries. This is often due to modeling as well as optimization complexities. However, simplified models may significantly degrade the performance of BESS operation in practice. Therefore, in this article, we propose a new BESS scheduling optimization framework that accounts for features such as cell-to-cell variations in maximum capacity, charge level balance, and internal resistance. The proposed framework is in the form of tractable mixed integer linear programs. Our approach is to estimate and update the device-level battery model parameters continuously, without the need to interrupt BESS normal operation. We validate the performance compared to an offline approach, which is based on dedicated model testing and calibration. To assure accurate performance evaluation, this article also includes developing a power hardware-in-the-loop testbed that allows for flexible operation and detailed monitoring of BESS under different design scenarios.

25 ENERGY STORAGE↗

RODeO (Revenue Operation and Device Optimization Model) [SWR 20-67]

The Revenue, Operation, and Device Optimization (RODeO) model explores optimal system design and operation considering different levels of grid integration, equipment cost, operating limitations, financing, and credits and incentives. RODeO is a price-taker model formulated as a mixed-integer linear programming (MILP) model in the GAMS modeling platform. The objective is to maximizes the net revenue for a collection of equipment at a given site. The equipment includes generators (e.g., gas turbine, steam turbine, solar, wind, hydro, fuel cells, etc.), storage systems (batteries, pumped hydro, gas-fired compressed air energy storage, long-duration systems, hydrogen), and flexible loads (e.g., electric vehicles, electrolyzers, flexible building loads). The input data required by RODeO can be classified into three bins: 1) utility service data, which refers to retail utility rate information (meter cost, energy and demand charges), 2) electricity market data, which include energy and reserve prices, 3) other inputs, which refer to additional electrical demand, product output demand, technological assumptions, financial properties, and operational parameters.

Guerra Fernandez, Omar Jose↗

Maximizing the U.S. Army’s Future Contribution to Global Security Using the Capability Portfolio Analysis Tool (CPAT)

We report that recent budget reductions have posed tremendous challenges to the U.S. Army in managing its portfolio of ground combat systems (tanks and other fighting vehicles), thus placing many important programs at risk. To address these challenges, the Army and a supporting team developed and applied the Capability Portfolio Analysis Tool (CPAT) to optimally invest in ground combat modernization over the next 25–35 years. CPAT provides the Army with the analytical rigor needed to help senior Army decision makers allocate scarce modernization dollars to protect soldiers and maintain capability overmatch. CPAT delivers unparalleled insight into multiple-decade modernization planning using a novel multiphase mixed-integer linear programming technique and illustrates a cultural shift toward analytics in the Army’s acquisition thinking and processes. CPAT analysis helped shape decisions to continue modernization of the $10 billion Stryker family of vehicles (originally slated for cancellation) and to strategically reallocate over $20 billion to existing modernization programs by not pursuing the Ground Combat Vehicle program as originally envisioned. Ultimately, more than 40 studies have been completed using CPAT, applying operations research methods to optimally prioritize billions of taxpayer dollars and allowing Army acquisition executives to base investment decisions on analytically rigorous evaluations of portfolio trade-offs.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Resilient Distribution System by Microgrids Formation After Natural Disasters

Microgrids with distributed generation provide a resilient solution in the case of major faults in a distribution system due to natural disasters. This paper proposes a novel distribution system operational approach by forming multiple microgrids energized by distributed generation from the radial distribution system in real-time operations, to restore critical loads from the power outage. Specifically, a mixed-integer linear program (MILP) is formulated to maximize the critical loads to be picked up while satisfying the self-adequacy and operation constraints for the microgrids formation problem, by controlling the ON/OFF status of the remotely controlled switch devices and distributed generation. A distributed multi-agent coordination scheme is designed via local communications for the global information discovery as inputs of the optimization, which is suitable for autonomous communication requirements after the disastrous event. The formed microgrids can be further utilized for power quality control and can be connected to a larger microgrid before the restoration of the main grids is complete. Numerical results based on modified IEEE distribution test systems validate the effectiveness of our proposed scheme.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Joint scheduling of energy, fast and primary frequency response reserves in integrated transmission–distribution networks

Inverter-based distributed energy resources (DERs) connected to distribution networks (DNs) can provide fast frequency support, but their reserve deliverability depends on feeder constraints and differs from synchronous primary frequency response (PFR). Existing transmission–distribution coordination studies usually treat reserve generically or neglect feeder-level feasibility, while frequency-security scheduling studies rarely represent distribution feeders explicitly. This paper develops a bi-level day-ahead scheduling framework for integrated transmission–distribution networks that jointly clears energy, transmission-side PFR, and distribution-side fast frequency response (FFR) under exogenous hourly inertia and largest-loss inputs from an external unit commitment (UC) schedule. The transmission problem is modeled with DC-optimal power flow (OPF) and closed-form second-order cone (SOC) frequency-security constraints, whereas each DN is represented by a reserve-aware branch-flow AC-OPF so that scheduled fast reserves remain deliverable during activation. The bi-level problem is reformulated through Karush–Kuhn–Tucker (KKT) conditions into a mixed-integer SOC program, and a penalty term is used to tighten the distribution-network relaxation. In the reduced test system, lower exogenous inertia increased the required primary response from 179.64 MW to 191.08 MW, distribution-side fast response reduced total frequency-response procurement by up to 4.9%, and neglecting distribution constraints overstated the combined distribution-side energy and reserve award by up to 18%. In the expanded study, the largest case was solved in 2.02 s with a 0.00% optimality gap. Time-domain simulations kept the frequency nadir above 59.0 Hz in all tested hours. These results demonstrate the value of fast-response modeling and distribution-feasible reserve delivery in coordinated market clearing.

Noh, Seung-Gil↗

Robust Reconfiguration of A Distribution System

In this paper, a robust reconfiguration approach based on Mixed Integer Programming (MIP) is proposed to minimize loss in distribution systems. A Depth-First Search (DFS) algorithm to enumerate possible loops provides radiality constraint. This provides a general solution to the radiality constraint for distribution system reconfiguration/expansion problems. Still, imprecision and ambiguity in net loads, i.e. load minus renewable generation, due to lack of sufficient measurements and high utilization of demand response programs and renewable resources, creates challenges for effective reconfiguration. Deterministic optimization of reconfiguration may no lead to optimal/feasible results. Two methods to address these uncertainties are introduced in this paper: one, based on a stochastic MIP (SMIP) formulation and two, based on a fuzzy MIP (FMIP) formulation. Case studies demonstrate the robustness and efficiency of the proposed reconfiguration methods.

Depth-First Search (DFS)↗

A Vehicle-to-Grid planning framework incorporating electric vehicle user equilibrium and distribution network flexibility enhancement

The rapid surge in electric vehicle (EV) adoption, coupled with advancements in charging technologies, emphasizes the critical necessity for expanding EV recharging infrastructure. Simultaneously, the Distribution Network (DN) encounters escalating challenges in meeting charging demand during peak traffic periods. Consequently, there is a mounting demand for the deployment of innovative Vehicle-to-Grid (V2G) technologies to augment the DN’s flexibility in power dispatch and alleviate travel costs for EV users. Hence, this paper proposes an EV-user-equilibrium-(UE)-constrained V2G planning framework that enhances flexibility in the DN. The framework aims to ascertain the optimal placement and capacity of EV charging stations (EVCSs) and V2G charging piles within the Transportation Network (TN). It takes into account the equilibrium condition stemming from competitive EV charging and routing behaviors alongside the optimal expansion of DN energy resources to accommodate the electricity supplied by the V2G piles. This study commences by analyzing EV drivers’ travel decisions, considering the influence of charging and V2G pile locations and sizes. Subsequently, we tackle the Traffic Assignment Problem with User Equilibrium (TAP-UE) model to characterize the steady-state traffic flow distribution of EVs. Following this, we formulate the optimization model for the Coordinated Power and Transportation Network (CPTN), which encompasses the optimal expansion of DN facilities and traffic flow regulation under UE conditions. To mitigate the computational complexity associated with the V2G planning model, we introduce a series of linearization methods to obtain a manageable Mixed-Integer Linear Programming (MILP) solution. Finally, to validate the efficacy of our proposed planning framework, we apply it to two test systems, including a real-world case study. Through these case studies, we explore the necessity and potential benefits of V2G technologies.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Aerial Vehicle Routing and Scheduling for UAS Traffic Management: A Monte Carlo Tree Search Approach

Numerous unmanned aircraft systems operating at low altitudes to deliver goods and services may one day become ubiquitous in our cities. In the Unmanned Aircraft Systems (UAS) Traffic Management (UTM) framework, such a concept is envisioned, where aerial vehicles operate beyond visual line of sight (BVLOS) within specifically reserved and time stamped “corridors” in the airspace. For example, these corridors or operational intent volumes can connect an aerial vehicle’s origin site to its destination site for package delivery operations. There may also be more than one corridor available for an aerial vehicle to choose from and often different corridors may intersect with one another. Thus, it is imperative to ensure flight trajectories belonging to different aerial vehicles are not in conflict. Per the UTM CONOPs, we assume that a vehicle almost always stays inside its corridor or operational volume. This work provides a framework for strategic deconfliction of UTM or package delivery drones, where we schedule the departure time of all vehicles subject to various temporal constraints (including the corridor deconfliction at the intersections). We present the “multi-route weighted package delivery problem” which serves as an exemplifying model for strategic deconfliction in UTM. In the multi-route weighted package delivery problem, a graph network is given which consists of a set of depots (source) and drop-off (destination) nodes, with multiple routes (defined as a sequence of waypoints) connecting the depots to drop-off nodes. In addition, routes are weighted by the associated ground risk and total travel distance for package delivery. The goal is for a known set of aerial vehicles to depart from the depots, choose a route and take off time, while avoiding conflicts with other aerial vehicles, and minimizing both risk and distance traveled. We provide a mixed integer linear programming (MILP) formulation of the problem, as well as a heuristic solution based on Monte Carlo Tree Search (MCTS) – a method used in game theory and artificial intelligence – to overcome limitations inherent to optimal solvers. Computational results show the advantages of using MCTS over the MILP formulation; the former can provide a sub-optimal solution quickly, and may sometimes even reach an optimal solution, whereas the latter may not even produce a solution in reasonable time. Furthermore, results from both the MILP formulation and MCTS methods were validated using a preliminary agent-based simulator implementing the UTM concept of operations. Thus, the MCTS method can be seen as a scalable solution to the complex multi-route weighted package delivery problem and may possibly be extended to similar complex optimization problems.

Kenny Chour↗

Modeling the Strategic Behavior of an Active Distribution Network in the ISO Markets

With increasing integration of distributed energy resources (DERs), active distribution networks (ADNs) can actively participate in the electricity markets by dispatching their DERs, which can change the existing electricity market paradigm. It is essential to investigate the strategic behaviors of ADNs and their DER dispatch when they participate in the wholesale market as price-makers. This paper proposes a bi-level optimization model to study the strategic behavior of an ADN in both energy and reserve markets. The optimal scheduling of DERs in the ADN is modeled as the upper level problem and the joint energy and reserve market-clearing of the ISO is modeled as the lower-level problem. The two-level optimization models exchange bidding information and energy/reserve prices with each other. The proposed bi-Ievel optimization problem is converted to a mathematical programming with equilibrium constraints (MPEC) by using Karush-Kuhn Tucker (KKT) conditions and strong duality theory. Further, the MPEC problem is reformulated as a computationally-solvable mixed integer second order cone programming (MISOCP) model. The simulation results on an illustrative case demonstrate the impact of the strategic bidding of the ADN on the day-ahead energy and reserve market prices.

Xue, Yaosuo↗

REopt: Enabling Renewable Energy, Storage, and Combined Heat and Power

Deployment of distributed energy resources including combined heat and power (CHP), photovoltaics (PV), and battery storage is growing as building and campus owners seek to reduce energy costs and increase resilience to grid outages. While deployment of a single technology is widespread, integrated systems of multiple technologies are also becoming more common to provide maximum economic and resilience benefits. To accelerate deployment, decision makers require tools to evaluate the technical and economic feasibility of these integrated systems. This paper presents a framework for optimizing the size and dispatch strategy of CHP with PV and battery storage to minimize life-cycle cost of energy. The modeling methodology is presented, with a particular focus on the linearization of cost and performance metrics required for implementation in a mixed integer linear program. A case study is used to examine the technical and economic viability of integrated CHP, PV, and battery systems, compared to CHP-only or PV+battery storage systems. In the case study we show how the integrated systems can provide increased economic and resilience benefits compared to single technologies on their own. The case study presented shows the combined CHP, PV, and battery system resulted in a 7% lower life cycle cost than CHP only, and a 22% lower life cycle cost than PV+battery storage. The life cycle emissions for CHP, PV, and battery storage resulted in a 24% reduction than CHP only and a 17% increase than PV+battery storage.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Revenue-Maximizing Shared Parking and Electric Vehicle Charging Management in Multi-Unit Dwellings

In urban areas, searching for parking and electric vehicle (EV) charging can result in cruising, congestion, and environmental externalities. Recognizing the business opportunity of offering private parking and charging infrastructure access within multi-unit dwellings (MUDs) during daytime, we model a shared parking and EV charging management system. We maximize the revenue of MUD charging hubs in mixed land use, catering to public demand. Our approach accounts for the objectives of the two stakeholders involved: a demand model is fitted on the choices of EV charging users, and the supply model optimizes the allocation of parking and charging requests in an MUD parking lot. A binary integer linear programming model for the allocation of parking and charging spaces with a rolling horizon is integrated with matching rules that handle both parking and charging requests. In our numerical experiments in a neighborhood of Chicago, Illinois, we estimate the performance of the MUD parking and charging system with metrics that include revenue, number of matchings, and utilization rates. At any given time, MUDs with lower prices attract more charging requests, particularly those of longer duration, resulting in higher revenue and greater charging utilization. Dynamic pricing facilitates a more equitable distribution of requests; as MUD parking lots reach capacity and their fees increase, other MUDs become more competitive, attracting additional requests. Comparing our method against first-come-first-served and optimal-solution benchmarks, we demonstrate our model’s effectiveness in dynamically managing mixed parking and charging demand in MUD charging hubs.

electric vehicle, multi-unit dwelling, charging in↗

Mixed-Integer Linear Programming Formulation with Embedded Machine Learning Surrogates for the Design of Chemical Process Families

In previous work, we introduced process family design. The main idea is to design a platform of common elements, and, allowing us to capture additional cost savings, simultaneously design a family of processes, and reducing both engineering and deployment timelines. We formulate this as an optimization problem, specifically a nonlinear generalized disjunctive program (GDP). We have proposed two approaches for reformulating and solving this problem: one based on full-discretization of the design space and one that uses Machine Learning (ML) surrogates to replace the nonlinear process models. Using ML surrogates to predict required system costs and performance indicators allows us to reformulate the nonlinearities in the GDP generate an efficient MILP formulation. In this work, we apply the ML surrogate approach to two case studies. One case study involves designing a family of carbon capture systems to cover a set of different flue gas flow rates and inlet CO 2 concentrations, where we consider the absorber and stripper as common unit module types. The second case study focuses on a water-desalination process, where we design a family of these processes for a variety of salt concentrations and flow rates. In both of these case studies, we demonstrate a scalable optimization approach that enables the design of multiple processes simultaneously, reducing the time-to-market and overall costs by maximizing the cost savings due to both economies of scale and economies of numbers.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Long-term strategic planning of inter-city fast charging infrastructure for battery electric vehicles

Here, this study introduces a multistage mixed integer modeling framework for long-term strategic planning of the battery electric vehicle (BEV) inter-city fast charging infrastructure. In response to the growing BEV inter-city travel demand, the framework integrates both an optimization model for decisions on where and when to build charging stations and a stochastic queuing model to determine how many chargers are needed for each station. A genetic algorithm based heuristic method is developed to efficiently solve the problem. The model is applied to investigate the long-term infrastructure requirement in the state of California where significant growth in BEV demand is expected in coming decades. Our findings indicate that the charging infrastructure is expanded in both network coverage (number of stations) and service capacity (number of chargers per station) as the BEV demand grows. We also found that the infrastructure requirement is dependent on many factors, such as the BEV electrified range, the required level of service at charging stations, and the range anxiety cost. For most simulated scenarios, the results show that it is beneficial to invest in the inter-city fast charging infrastructure, even though the range anxiety cost is at its low end.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

A New Hybrid Quantum-Classical Algorithm for Solving the Unit Commitment Problem

Solving problems related to planning and operations of large-scale power systems is challenging on classical computers due to their inherent nature as mixed-integer and nonlinear problems. Quantum computing provides new avenues to approach these problems. We develop a hybrid quantum-classical algorithm for the Unit Commitment (UC) problem in power systems which aims at minimizing the total cost while optimally allocating generating units to meet the hourly demand of the power loads. The hybrid algorithm combines a variational quantum algorithm (VQA) with a classical Benders-type heuristic. The resulting algorithm computes approximate solutions to UC in three stages: i) a collection of UC vectors capable meeting the power demand with lowest possible operating costs is generated based on VQA; ii) a classical sequential least squares programming (SLSQP) routine is leveraged to find the optimal power level corresponding to a predetermined number of candidate vectors; iii) in the last stage, the approximate solution of UC along with generating units power level combination is given. To demonstrate the effectiveness of the presented method, three different systems with 3 generating units, 10 generating units, and 26 generating units were tested for different time periods. In addition, convergence of the hybrid quantum-classical algorithm for select time periods is proven out on IonQ's Forte system.

Aboumrad, Willie [IonQ, Inc]↗

Fuzzy Energy and Reserve Co-optimization With High Penetration of Renewable Energy

In this study, we propose a fuzzy-based energy and reserve co-optimization model with consideration of high penetration of renewable energy. Under the assumption of a fixed uncertainty set of renewables, a two-stage robust model is proposed for clearing energy and reserves in the first stage and checking the feasibility and robustness of re-dispatches in the second stage. Fuzzy sets and their membership functions are introduced into the optimization model to represent the satisfaction degree of the variable uncertainty sets. The lower bound of the uncertainty set is expressed as fuzzy membership functions. The solutions are obtained by transforming the fuzzy mathematical programming formulation into traditional mixed integer linear programming problems.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Integrated solution techniques for security constrained unit commitment problem

Apparatus and methods are disclosed for solving Mixed Integer Programming (MIP) problems, such as Security Constrained Unit Commitment (SCUC) problems used by power grid authorities to perform day-ahead market clearing. In certain examples, a plurality of threads of a software tool implementing a concurrent optimizer can be executed concurrently and sequentially to generate new solutions to a SCUC problem for an upcoming planning horizon. Data can be shared among the concurrently executing threads, such as intermediate/incumbent solutions and hints regarding the fixing of variables and constraints to reduce the size of the SCUC problem. In some examples, the threads are seeded with historical solutions from prior planning horizons. The software tool can select a best solution from the solutions generated by the threads, and determine dispatch instructions for a device coupled to the power grid for the upcoming planning horizon based at least in part on the selected solution.

Pan, Feng↗

Dispatch optimization of a concentrating solar power system under uncertain solar irradiance and energy prices

The integration of thermal energy storage into a concentrating solar power system allows for mitigating some of the risk associated with uncertain solar irradiance and uncertain energy prices. We solve a 48 h dispatch optimization model with continually updated conditional point forecasts of both direct normal irradiance (DNI) and electricity prices with a rolling-horizon scheme at hourly resolution over the course of a year. Joint, conditional forecasts for DNI and prices are formed using an autoregressive moving-average time series model with exogenous weather predictors. We guide dispatch using a mixed-integer programming model, but in order to evaluate performance we use the System Advisor Model (SAM) of the National Renewable Energy Laboratory. SAM is a techno-economic simulation model that accounts for plant thermodynamics with higher fidelity. Our conditional DNI forecasts improve annual revenue by 4%–12% over using historical forecasts based on data from previous years. Conditional price forecasts improve annual revenue by 6%–19% in the real-time market over analogous historical forecasts. Updating these forecasts every six hours, rather than every 24 h, further improves annual revenue by 5%–6%. Here, we also investigate a method that values terminal inventory in our dispatch optimization model, again when used in a rolling-horizon scheme.

14 SOLAR ENERGY↗