Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Mixed-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.

251 records · Page 14
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Resilience-Motivated Distribution System Restoration Considering Electricity-Water-Gas Interdependency

A major outage in the electricity distribution system may affect the operation of water and natural gas supply systems, leading to an interruption of multiple services to critical customers. Therefore, enhancing resilience of critical infrastructures requires joint efforts of multiple sectors. In this paper, a distribution system service restoration method considering the electricity-water-gas interdependency is proposed. The objective is maximizing the supply of electricity, water, and gas to critical customers after an extreme event. The operational constraints of electricity, water, and natural gas networks are considered. Additionally, the characteristics of electricity-driven coupling components, including water pumps and gas compressors, are also modeled. Relaxation techniques are applied to non convex constraints posed by physical laws of those networks. Consequently, the restoration problem is formulated as a mixed-integer second-order cone program, which can readily be solved by the off-the-shelf solvers. The proposed method is validated by numerical simulations on an electricity-water-gas integrated system, developed based on benchmark models of the subsystems. The results indicate that considering the interdependency refines the allocation of limited generation resources and demonstrate the exactness of the proposed convex relaxation

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1987

Optimization of orbital assignment and specification of service areas in satellite communications

The mathematical nature of the orbital and frequency assignment problem for communications satellites is explored, and it is shown that choosing the correct permutations of the orbit locations and frequency assignments is an important step in arriving at values which satisfy the signal-quality requirements. Two methods are proposed to achieve better spectrum/orbit utilization. The first, called the delta S concept, leads to orbital assignment solutions via either mixed-integer or restricted basis entry linear programming techniques; the method guarantees good single-entry carrier-to-interference ratio results. In the second, a basis for specifying service areas is proposed for the Fixed Satellite Service. It is suggested that service areas should be specified according to the communications-demand density in conjunction with the delta S concept in order to enable the system planner to specify more satellites and provide more communications supply.

Wang, Cou-Way↗
DOE OSTI2021

Data-driven optimization of mixed-integer bi-level multi-follower integrated planning and scheduling problems under demand uncertainty

The coordination of interconnected elements across the different layers of the supply chain is essential for all industrial processes and the key to optimal decision-making. Yet, the modeling and optimization of such interdependent systems are still burdensome. Here we address the simultaneous modeling and optimization of medium-term planning and short-term scheduling problems under demand uncertainty using mixed-integer bi-level multi-follower programming and data-driven optimization. Bi-level multi-follower programs model the natural hierarchy between different layers of supply chain management holistically, while scenario analysis and data-driven optimization allow us to retrieve the guaranteed feasible solutions of the integrated formulation under various demand considerations. We address the data-driven optimization of this challenging class of problems using the DOMINO framework, which was initially developed to solve single-leader single-follower bi-level optimization problems to guaranteed feasibility. This framework is extended to solve single-leader multi-follower stochastic formulations and its performance is characterized by well-known single and multi-product process scheduling case studies. Through our data-driven algorithmic approach, we present guaranteed feasible solutions to linear and nonlinear mixed-integer bi-level formulations of simultaneous planning and scheduling problems and further characterize the effects of the scheduling level complexity on the solution performance, which spans over several hundred continuous and binary variables, and thousands of constraints.

42 ENGINEERING↗
DOE OSTI2023

Grid Optimization Competition on Synthetic and Industrial Power Systems

This paper summarizes a grid optimization (GO) competition effort in the United States to find the best solution strategies for up to interconnect-scale power system networks with around 32,000 buses. The optimization problem is a mixedinteger, non-convex non-linear problem, (MINLP) and includes discrete variables such as unit commitment and line switching, control settings (transformer taps and phase shifters with impedance correction tables), and bus shunts. The case study includes six actual industry grids as well as 16 realistic synthetic grids created by three different dataset teams. The winners are selected and ranked based on scoring criteria, which consider the solution quality (such as objective functions) within time limits. Nine winner teams are selected from 26 competitor teams. The results achieved by different teams are described and the performance of different algorithms on synthetic grids and actual industry grids are compared and analyzed.

mixed-integer non-linear programming↗
DOE OSTI2022

Hierarchical Distributed Optimal Power Flow of HV and MV Distribution Networks With Continuous and Discrete Devices

With large-scale distributed photovoltaics (PVs) being integrated into distribution networks (DNs), coordinated optimal power flow (OPF) of high voltage (HV) and medium voltage (MV) DNs should be investigated to optimally dispatch the distributed PVs and other network devices. Here, this paper presents a hierarchical distributed OPF method for HV and MV DNs with on-load tap changers, reactive power compensators, feeder switches and distributed PVs. A hierarchical master-slave control architecture is applied to implement coordinated OPF of two-layer DNs. The HV master problem and MV subproblems are transformed into mixed-integer convex problems respectively with second order cone programming and LinDistFlow approximation. Since there is no efficient distributed algorithm to solve such OPF models with integer subproblems, a novel distributed algorithm is proposed in this paper to efficiently solve the hierarchical coordinated OPF model with integer subproblems in a distributed manner. In the proposed algorithm, the coordinated OPF model is solved in a branch-and-bound framework, where in each branch node generalized Benders decomposition (GBD) algorithm is applied to decompose the coordinated OPF model into a master problem and relaxed subproblems and solves them iteratively to get optimal solution. The GBD optimal and feasible cutting planes generated in a branch node are proved to be valid for its descendants. Moreover, three acceleration techniques are introduced into the proposed algorithm to improve computational efficiency. Finally, the effectiveness and accuracy of the proposed method are verified via simulation tests in Jinzhai DNs of China.

42 ENGINEERING↗
NASA NTRS1992

Menu-Driven Solver Of Linear-Programming Problems

Program assists inexperienced user in formulating linear-programming problems. A Linear Program Solver (ALPS) computer program is full-featured LP analysis program. Solves plain linear-programming problems as well as more-complicated mixed-integer and pure-integer programs. Also contains efficient technique for solution of purely binary linear-programming problems. Written entirely in IBM's APL2/PC software, Version 1.01. Packed program contains licensed material, property of IBM (copyright 1988, all rights reserved).

Viterna, L. A.↗
DOE OSTI2020

Allocation and Operation of A Hydropneumatic Energy Storage with Building Microgrid

Behind-meter application for a recently invented hydropneumatic Ground-Level Integrated Diverse Energy Storage (GLIDES) is focused in this research. Considering possible uncertainties from solar radiation and electricity load in a building microgrid, two-stage stochastic programming is adopted for 15-min operation and a mixed-integer nonlinear stochastic model is built with integrated energy systems of GLIDES, solar panel and power generating unit. In order to make the model computationally tractable, we use sample average approximate method to decrease associated complexity with sample size and improve solving efficiency. The experimental results in deterministic and stochastic operation indicate that best candidate solution from SAA are superior to the solution from expected value problem in terms of optimality gap and variance.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Controlled Islanding Strategy Considering Uncertainty of Renewable Energy Sources Based on Chance-constrained Model

Controlled islanding plays an essential role in preventing the blackout of power systems. Although there are several studies on this topic in the past, not enough attention is paid to the uncertainty brought by renewable energy sources (RESs) that may cause unpredictable unbalanced power and the observability of power systems after islanding that is essential for back-up black-start measures. Therefore, a novel controlled islanding model based on mixed-integer second-order cone and chance-constrained programming (MISOCCP) is proposed to address these issues. First, the uncertainty of RESs is characterized by their possibility distribution models with chance constraints, and the requirements, e. g., system observ-ability, for rapid back-up black-start measures are also considered. Then, a law of large numbers (LLN) based method is employed for converting the chance constraints into deterministic ones and reformulating the non-convex model into convex one. Finally, case studies on the revised IEEE 39-bus and 118-bus power systems as well as the comparisons among different models are given to demonstrate the effectiveness of the proposed model. The results show that the proposed model can result in less unbalanced power and better observability after islanding compared with other models.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

A matheuristic for design and dispatch of a utility-connected distributed energy system

Modeling distributed power generation systems often requires complicated mathematical expressions that present challenges for commercial optimization solvers. Here, this paper presents a matheuristic to solve a mixed-integer optimization model that informs decisions regarding the design and dispatch of a utility-connected microgrid. We deploy a genetic algorithm to search the system design space and a linear program to solve the economic dispatch problem. The model is a component of a web tool that requires solutions within a few minutes. Our method yields objective function values within 5% of an exogenously produced optimal in fewer than 30 seconds for 90% of our test cases compared to only 10% of our test cases by a traditional optimization solver in the same amount of time.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

A data-driven network optimisation approach to coordinated control of distributed photovoltaic systems and smart buildings in distribution systems

The increasing integration of distributed energy resources, including demand-side resources and distributed photovoltaics (PVs), into distribution systems has resulted in more complicated power system operation. A data-driven network optimisation approach is proposed to coordinate the control of distributed PVs and smart buildings in distribution networks considering the uncertainties of solar power, outdoor temperature and heat gain associated with building thermal dynamics. These uncertain parameters have a significant impact on the operation and control of distributed PVs and smart buildings, bringing challenges to the distribution system operation. In the proposed data-driven distributionally robust optimisation (DRO) approach, the Wasserstein ball is used to construct an ambiguity set for the uncertain parameters, which does not require the probability distributions to be known. Furthermore, a conditional value-at-risk is incorporated into the Wasserstein-based DRO model and converted into a computationally tractable mixed-integer convex optimisation problem. Benchmarked with robust optimisation and chance-constrained programming, the proposed data-driven model can give a less conservative robust solution.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS2018

Next Generation Aircraft Design Considering Airline Operations and Economics

Traditional approaches to design and optimization of a new system often use a system-centric objective and do not take into consideration how the operator will use this new system alongside other existing systems. When the new system design is incorporated into the broader group of systems, the performance of the operator-level objective can be sub-optimal due to the unmodeled interaction between the new system and the other systems. Among the few available references that describe attempts to address this disconnect, most follow an MDO (Multidisciplinary Design Optimization)-motivated sequential decomposition approach of first designing a very good system and then providing this system to the operator who, decides the best way to use this new system along with the existing systems. This paper addresses this issue by including aircraft design, airline operations, and revenue management "subspaces"; and presents an approach that could simultaneously solve these subspaces posed as a monolithic optimization problem rather than the traditional approach described above. The monolithic approach makes the problem an expensive Mixed Integer Non-Linear Programming problem, which are extremely difficult to solve. To address the problem, we use a recently developed optimization framework that simultaneously solves the subspaces to capture the "synergy" in the problem that the previous decomposition approaches did not exploit, addresses mixed-integer/discrete type design variables in an efficient manner, and accounts for computationally expensive analysis tools. This approach solves an 11-route airline network problem consisting of 94 decision variables including 33 integer and 61 continuous type variables. Simultaneously solving the subspaces leads to significant improvement in the fleet-level objective of the airline when compared to the previously developed sequential subspace decomposition approach.

Roy, Satadru↗
DOE OSTI2025

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]↗
DOE OSTI2021

Restoration Strategy for Active Distribution Systems Considering Endogenous Uncertainty in Cold Load Pickup

Cold load pickup (CLPU) phenomenon is identified as the persistent power inrush upon a sudden load pickup after an outage. Under the active distribution system (ADS) paradigm, where distributed energy resources (DERs) are extensively installed, the decreased outage duration can induce a strong interdependence between CLPU pattern and load pickup decisions. In this paper, we propose a novel modelling technique to tractably capture the decision-dependent uncertainty (DDU) inherent in the CLPU process. Subsequently, a two-stage stochastic decision-dependent service restoration (SDDSR) model is constructed, where first stage searches for the optimal switching sequences to decide step-wise network topology, and the second stage optimizes the detailed generation schedule of DERs as well as the energization of switchable loads. Further, to tackle the computational burdens introduced by mixed-integer recourse, the progressive hedging algorithm (PHA) is utilized to decompose the original model into scenario-wise subproblems that can be solved in parallel. The numerical test on modified IEEE 123-node test feeders has verified the efficiency of our proposed SDDSR model and provided fresh insights into the monetary and secure values of DDU quantification.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

A bilevel multistage stochastic self-scheduling model with indivisibilities for trading in the continuous intraday electricity market

In this paper, we study the profit maximization problem of a virtual power plant trading in the continuous intraday electricity market. Our virtual power plant model is compatible with renewable, and thermal assets, covering a range of virtual power plants currently participating in energy markets. We model the trading problem as a bilevel multistage stochastic program. The upper level of the problem accounts for the profit maximization of the virtual power plant with explicit modeling of the technical constraints of the operational status of the thermal power plant including minimum start-up and shut-down times, ramp-up and ramp-down rates, and minimum generation level. The upper level also decides which continuous and indivisible (fill-or-kill) orders are submitted to the market. The lower-level problem accounts for the clearing of the continuous intraday market, i.e., matching of buy and sell orders. Because of the presence of fill-or-kill orders, the lower-level problem is mixed-integer, which prevents its direct conversion to a single-level problem using duality. In order to solve this challenging problem, we develop a convex-hull extended formulation for the lower-level problem, apply duality theory to obtain a single-level stochastic equivalent formulation, and employ McCormick envelopes to turn the problem into a multistage stochastic mixed-integer linear problem, which we solve using the stochastic dual dynamic integer programming algorithm. We conduct numerical experiments and analyze the optimal trading behavior of a virtual power plant trading in an ideal continuous market without arbitrage.

Bilevel multistage stochastic programming problem↗
DOE OSTI2022

Stochastic scheduling of generating units with weekly energy storage: A hybrid decomposition approach

We propose a solution method for the large-scale stochastic unit commitment (SUC) problem with weekly-dispatched energy storage and significant weather-dependent stochastic generating capacity. Weekly storage facilities that mostly charge during weekends and discharge during weekdays require a weekly scheduling of generating units, which result in a large-scale optimization problem. This SUC problem is formulated as a two-stage stochastic model and we use the conditional value-at-risk as a risk measure. Using a Benders framework, the proposed solution method decomposes the problem into a mixed-integer linear master problem and linear and continuous subproblems. The master problem corresponds to the first-stage decisions throughout the week and includes all the commitment (binary) variables and their corresponding constraints. The subproblems correspond to the actual dispatch of the generating units on a weekly basis. Based on the success of column-and-constraint generation algorithms to solve robust optimization problems, we improve the low communication between the master problem and the subproblems in the standard Benders decomposition by adding primal variables and constraints from the subproblems to the master problem, which provides a better approximation of the recourse function. Furthermore, our computational experiments demonstrate the effectiveness of the proposed decomposition method using an instance of the South Carolina synthetic system with 90 generating units under 40 scenarios.

25 ENERGY STORAGE↗
DOE OSTI2022

Sequential linear integer programming for integer optimal control with total variation regularization

We propose a trust-region method that solves a sequence of linear integer programs to tackle integer optimal control problems regularized with a total variation penalty. The total variation penalty implies that the considered integer control problems admit minimizers. We introduce a local optimality concept for the problem, which arises from the infinite-dimensional perspective. In the case of a one-dimensional domain of the control function, we prove convergence of the iterates produced by our algorithm to points that satisfy first-order stationarity conditions for local optimality. We demonstrate the theoretical findings on a computational example.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Solving the Grid Optimization Competition Challenge 3 Problem

The Grid Optimization Competition Challenge 3 Problem posed a multiperiod security-constrained unit commitment problem with base-case AC power flow. The problem formulation includes binary unit commitment decisions, nonlinear AC power flow and balance, dispatchable loads, and linearized contingency real power flow, among other features. This talk will present a modified consensus ADMM algorithm, which splits the problem into mixed-integer linear and nonlinear components, as a heuristic solution method for this large-scale mixed integer nonlinear program. We will present some computational results from the competition for our implementation and reflect on the challenges of participating the grid optimization competition.

AC power flow↗