Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “mixed integer nonlinear programing”

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.

135 records · Page 8
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Piecewise polyhedral formulations for a multilinear term

Herein, we present a mixed-integer linear programming (MILP) formulation of a piecewise, polyhedral relaxation (PPR) of a multilinear term using its convex-hull representation. Based on the PPR’s solution, we also present a MILP formulation whose solutions are feasible for nonconvex, multilinear equations. We then present computational results showing the effectiveness of proposed formulations on standard benchmark nonlinear programs (NLPs) with multilinear terms and compare with a traditional formulation that is built using recursive bilinear groupings of multilinear terms.

42 ENGINEERING↗
DOE OSTI2014

TAS: 89 0227: TAS Recovery Act - Optimization and Control of Electric Power Systems: ARRA

The name SuperOPF is used to refer several projects, problem formulations and soft-ware tools intended to extend, improve and re-define some of the standard methods of optimizing electric power systems. Our work included applying primal-dual interior point methods to standard AC optimal power flow problems of large size, as well as extensions of this problem to include co-optimization of multiple scenarios. The original SuperOPF problem formulation was based on co-optimizing a base scenario along with multiple post-contingency scenarios, where all AC power flow models and constraints are enforced for each, to find optimal energy contracts, endogenously determined locational reserves and appropriate nodal energy prices for a single period optimal power flow problem with uncertainty. This led to example non-linear programming problems on the order of 1 million constraints and half a million variables. The second generation SuperOPF formulation extends this by adding multiple periods and multiple base scenarios per period. It also incorporates additional variables and constraints to model load following reserves, ramping costs, and storage resources. A third generation of the multi-period SuperOPF, adds both integer variables and a receding horizon framework in which the problem type is more challenging (mixed integer), the size is even larger, and it must be solved more frequently, pushing the limits of currently available algorithms and solvers. The consideration of transient stability constraints in optimal power flow (OPF) problems has become increasingly important in modern power systems. Transient stability constrained OPF (TSCOPF) is a nonlinear optimization problem subject to a set of algebraic and differential equations. Solving a TSCOPF problem can be challenging due to (i) the differential-equation constraints in an optimization problem, (ii) the lack of a true analytical expression for transient stability in OPF. To handle the dynamics in TSCOPF, the set of differential equations can be approximated or converted into equivalent algebraic equations before they are included in an OPF formulation. In Chapter 4, a rigorous evaluation of using a predefined and fixed threshold for rotor angles as a mean to determine transient stability of the system is developed. TSCOPF can be modeled as a large-scale nonlinear programming problem including the constraints of differential-algebraic equations (DAE). Solving a TSCOPF problem can be challenging due to (i) the differential-equation constraints in an optimization problem, (ii) the lack of a true analytical expression for transient stability constraint in OPF. Unfortunately, even the current best TSCOPF solvers still suffer from the curse of dimensionality and unacceptable computational time, especially for large-scale power systems with multiple contingencies. In chapter 5, thse issues will be addressed and a new method to incorporate the transient stability constraints will be presented.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

An Optimization-Based Planning Tool for On-Demand Mobility Service Operations

Regions worldwide are adopting and exploring low-speed automated electric shuttle (AES) service as an on-demand shared mobility service in dense geofenced urban areas. Building on this concept, the National Renewable Energy Laboratory (NREL) recently developed the Automated Mobility District (AMD) toolkit. The AMD toolkit—comprising of a travel micro-simulation model and an energy estimation model—estimates the mobility and energy impacts of a given shuttle configuration within an AMD. Early-stage AMD deployments need to find optimal operational configurations that include: (a) passenger capacity of an AES, (b) time-dependent routes, and (c) fleet size (AES units) to satisfy the demand for the region. This research extends the AMD toolkit functionality by developing an optimization-based planning module that will assist in the operations of AES units. We developed a constrained mixed-integer program accounting for passenger waiting time, battery range, and passenger capacity of AES units. For scalability, we demonstrated the Tabu search-based solution technique for a real-world network—a proposed AMD deployment in Greenville, South Carolina, USA. Compared to rule-based operations, our developed solution yields higher travel time and energy savings for the network at different demand levels. The sensitivity analyses for waiting time thresholds indicate nonlinearity in the system performance, underscoring the need to meet shared-use mobility user-level expectations. The developed optimization framework can be adapted and extended to accommodate different categories of shared-use on-demand mobility services.

ADVANCED PROPULSION SYSTEMS,ENERGY PLANNING, POLIC↗
DOE OSTI2019

Designing Metabolic Division of Labor in Microbial Communities

ABSTRACT Microbes face a trade-off between being metabolically independent and relying on neighboring organisms for the supply of some essential metabolites. This balance of conflicting strategies affects microbial community structure and dynamics, with important implications for microbiome research and synthetic ecology. A “gedanken” (thought) experiment to investigate this trade-off would involve monitoring the rise of mutual dependence as the number of metabolic reactions allowed in an organism is increasingly constrained. The expectation is that below a certain number of reactions, no individual organism would be able to grow in isolation and cross-feeding partnerships and division of labor would emerge. We implemented this idealized experiment using in silico genome-scale models. In particular, we used mixed-integer linear programming to identify trade-off solutions in communities of Escherichia coli strains. The strategies that we found revealed a large space of opportunities in nuanced and nonintuitive metabolic division of labor, including, for example, splitting the tricarboxylic acid (TCA) cycle into two separate halves. The systematic computation of possible solutions in division of labor for 1-, 2-, and 3-strain consortia resulted in a rich and complex landscape. This landscape displayed a nonlinear boundary, indicating that the loss of an intracellular reaction was not necessarily compensated for by a single imported metabolite. Different regions in this landscape were associated with specific solutions and patterns of exchanged metabolites. Our approach also predicts the existence of regions in this landscape where independent bacteria are viable but are outcompeted by cross-feeding pairs, providing a possible incentive for the rise of division of labor. IMPORTANCE Understanding how microbes assemble into communities is a fundamental open issue in biology, relevant to human health, metabolic engineering, and environmental sustainability. A possible mechanism for interactions of microbes is through cross-feeding, i.e., the exchange of small molecules. These metabolic exchanges may allow different microbes to specialize in distinct tasks and evolve division of labor. To systematically explore the space of possible strategies for division of labor, we applied advanced optimization algorithms to computational models of cellular metabolism. Specifically, we searched for communities able to survive under constraints (such as a limited number of reactions) that would not be sustainable by individual species. We found that predicted consortia partition metabolic pathways in ways that would be difficult to identify manually, possibly providing a competitive advantage over individual organisms. In addition to helping understand diversity in natural microbial communities, our approach could assist in the design of synthetic consortia.

59 BASIC BIOLOGICAL SCIENCES↗
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 OSTI2024

A Mixed Integer Linear Programming-basedDistributed Energy Management for Three-phaseUnbalanced Active Distribution Network

A mixed integer linear programming (MILP)–baseddistributed energy management for three-phase unbalancedactive distribution network is proposed. Modern distributionnetworks have becoming more and more active with increasingdeployment of microgrids, distributed energy resources (DERs)as well as controllable loads. Considering various ownership andcontrol models of microgrids, DERs and controllable loads, adistributed energy management was formulated using the alternatingdirection method of multipliers (ADMM) algorithm. ByADMM, the distribution management system (DMS) and theseactive components are coordinated through price signals, whichare adjusted according to the generation-load mismatch per nodeper phase. To enable resolution of the ADMM-based distributedoptimization using more accessible and popular MILP solver,different linearization techniques were proposed to linearize theaugmented Lagrangian terms and other nonlinear terms. Resultsof case studies on a three-phase active distribution network withthree microgrids and several DERs and controllable loads validatedthe effectiveness of proposed MILP-based distributed energymanagement. In addition, the capability of proposed method inmitigating phase power unbalance has been demonstrated.

Liu, Guodong↗
DOE OSTI2019

OPERATIONAL TOPOLOGY ESTIMATION OF THREE PHASE UNBALANCED POWER DISTRIBUTION SYSTEMS WITH OUTAGES

Distribution grid, in general, is constructionally loopy but a radially operated network. Opening and closing of suitable tie-switches allows transition from one radial topology to another. Tie-switches ensure reliability and provide restoration paths when faults (outages) occur. The estimation of the system's current operational topology is a precursor to implementing any optimal control actions (during normal operation) or restorative actions (during outage condition). The existing literature in topology detection suffers with several limitations including: (1) computationally intensive nonlinear formulations that are not scalable for large distribution systems, (2) methods requiring exhaustive search for the correct topology by enumerating the complete topological search space, and (3) approaches requiring large volumes of time-series measurements and are not applicable for estimating continuously changing operational topology. Furthermore, the existing literature on distribution grid topology estimation cannot be extended to estimate the operational topology during outage conditions. For operational topology estimation during outages, our objective is to estimate both energized radial feeder and the outaged sections. Starting with a radial topology, these methods identify outaged feeder sections and hence, are inapplicable when the current radial operational topology is not known. In this work, we present a mathematical programming approach to estimate the operational topology of a three-phase unbalanced power distribution system under both outage and normal operating conditions. The aforementioned limitations of existing literature were countered by modeling the problem as a mixed-integer linear programming (MILP) problem which minimizes the errors in available measurements while satisfying the power flow and structural constraints of the system. Specically, a minimum weighted least absolute value estimator is proposed that uses the instantaneous line flow measurements, historical/ forecasted load data, and ping measurements from a limited set of smart meters and solves an MILP to identify the operational topology based on a linearized three-phase unbalanced power flow model. The proposed approach is tested on IEEE 123-bus feeder and 1069 bus multi-feeder test system and the numerical results prove the applicability of the proposed method to large three phase unbalanced grids with high errors in measurements. It is observed that the approach performs well even at high percentages of measurement errors.

GANDLURU NAGA, ANANDINI↗
DOE OSTI2020

Approximating Trajectory Constraints With Machine Learning – Microgrid Islanding With Frequency Constraints

Here, we introduce deep earning aided constraint encoding to tackle the frequency-constraint microgrid scheduling problem. The nonlinear function between system operating condition and frequency nadir is approximated by using a neural network, which admits an exact mixed-integer formulation (MIP). This formulation is then integrated with the scheduling problem to encode the frequency constraint. With the stronger representation power of the neural network, the resulting commands can ensure adequate frequency response in a realistic setting in addition to islanding success. The proposed method is validated on a modified 33-node system. Successful islanding with a secure response is simulated under the scheduled commands using a detailed three-phase model in Simulink. The advantages of our model are particularly remarkable when the inertia emulation functions from wind turbine generators are considered.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS2013

Mixed Integer Programming and Heuristic Scheduling for Space Communication

Optimal planning and scheduling for a communication network was created where the nodes within the network are communicating at the highest possible rates while meeting the mission requirements and operational constraints. The planning and scheduling problem was formulated in the framework of Mixed Integer Programming (MIP) to introduce a special penalty function to convert the MIP problem into a continuous optimization problem, and to solve the constrained optimization problem using heuristic optimization. The communication network consists of space and ground assets with the link dynamics between any two assets varying with respect to time, distance, and telecom configurations. One asset could be communicating with another at very high data rates at one time, and at other times, communication is impossible, as the asset could be inaccessible from the network due to planetary occultation. Based on the network's geometric dynamics and link capabilities, the start time, end time, and link configuration of each view period are selected to maximize the communication efficiency within the network. Mathematical formulations for the constrained mixed integer optimization problem were derived, and efficient analytical and numerical techniques were developed to find the optimal solution. By setting up the problem using MIP, the search space for the optimization problem is reduced significantly, thereby speeding up the solution process. The ratio of the dimension of the traditional method over the proposed formulation is approximately an order N (single) to 2*N (arraying), where N is the number of receiving antennas of a node. By introducing a special penalty function, the MIP problem with non-differentiable cost function and nonlinear constraints can be converted into a continuous variable problem, whose solution is possible.

Lee, Charles H.↗