Search NASA⌕ Search

SEARCH · Search NASA

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 91 records · Page 5

Dynamic Optimal Dispatch of Energy Systems with Intermittent Renewables and Damage Model

With the increasing penetration of intermittent renewable energy sources into the grid, there is a growing need for process systems-based strategies that integrate dispatchable and variable energy systems for supplying the demand while maintaining grid reliability. The proposed framework corresponds to a dynamic mixed-integer linear programming optimization approach that integrates coal-fired and natural gas-fired power plants, NaS batteries for energy storage, and solar/wind energy to supply the demand. This optimization approach considers an economic goal and constraints to provide power balance while maintaining the overall damage of the natural gas combined cycle (NGCC) power plant drum under a maximum stress as well as avoiding the overheating of the NGCC superheater and reheater. Renewable curtailment levels are also retained at minimum levels. Case studies are analyzed considering different loads and renewable penetration levels. The results show that the demand was met for all cases. Grid flexibility was mostly provided by the NGCC, while the batteries were used sparingly. In addition, considering a CO 2 equivalent analysis, the environmental performance was intrinsically connected to grid flexibility and the level of renewable penetration. Stress analysis results reinforced the necessity for an equipment health-related constraint.

97 MATHEMATICS AND COMPUTING↗

A General Framework for Process Synthesis, Integration, and Intensification

Process synthesis, integration, and intensification are the three pillars of process design. Current synthesis and integration methods are able to find optimal design targets and process configurations when all the alternatives are known beforehand. Process intensification, on the other hand, combines multiple physicochemical phenomena and exploits their interactions to create innovative designs. Often times, these designs are not known beforehand, and a phenomena-level representation of chemical processes are required to identify them. This disconnection between the three paradigms limits the ability to systematically discover optimal design pathways. We demonstrate that the building block representation, originally proposed in our earlier work on process intensification, has the potential to bridge this gap. Depending on the attributes assigned to the interior and the boundaries of these two-dimensional abstract building blocks, they can represent various intensified or isolated phenomena at the lowest level, various tasks at the equipment level, and various unit operations at the flowsheet level. Here, this common multiscale representation enables an mixed-integer nonlinear optimization-based single framework for the sequential or simultaneous synthesis, integration, and intensification of chemical processes. Such a general framework is critical to reduce the risk of eliminating potential intensification pathways and candidate flowsheets at the conceptual design stage. The framework is demonstrated using a case study on an ethylene glycol process.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Optimal Strategies for Hybrid Battery‐Storage Systems Design

As stationary hybrid energy‐storage systems (HESS) for power systems applications have recently drawn interest due to their enhanced performance and decreasing cost, developing systematic approaches for HESS design while considering controls is gaining traction. Herein, a method is presented to optimally design hybrid battery storage by proposing a mathematical modeling framework, formulated as a mixed integer linear programming model. The optimization is capable of handling multiple subsystems of batteries, considering their economic and technological performance. Decisions involve sizing of the batteries, optimal temporal and strategic dispatch to end uses, and energy sources for charging each battery. The applicability of the model is tested on four case studies for three battery chemistries representing distinct objectives: high‐power, high‐energy, and second life. Compared to traditionally designed battery storage with a homogeneous battery, optimally designed hybrid systems can save 12%–26% of system costs, depending on the nature of the dispatch profile. Findings point to design preference toward the second life battery supplemented with some high‐power or high‐energy battery capacity, or both. With the utilized electricity price structure, customers can experience approximately 10%–35% reduction in their bills.

Koleva, Mariya↗

A hybrid robust-stochastic optimization approach for day-ahead scheduling of cascaded hydroelectric system in restructured electricity market

Uncertainties arising from complicated natural and market environments pose great challenges for the efficient operation of cascaded hydroelectric systems. To overcome these challenges, this paper studies the day-ahead scheduling of cascaded hydroelectric systems in a restructured electricity market with the presence of uncertainties in electricity price and natural water inflow. To properly model the uncertainty, we consider the unique characteristics of these two types of uncertainties and capture them via the uncertainty set and stochastic scenarios, respectively. Further, a hybrid robust-stochastic optimization model is developed to simultaneously hedge against these two types of uncertainties, which is formulated as a large-scale non-convex optimization problem with mixed integer recourse. After introducing linearization of nonlinear terms, a tailored hybrid decomposition scheme combining Lagrangian relaxation and Dantzig-Wolfe decomposition is adopted to achieve efficient computation of the proposed model. Two real-world cases are conducted to demonstrate the capability and characteristics of the proposed model and algorithms.

13 HYDRO ENERGY↗

Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs

A lower bound for a finite-scenario-based chance-constrained program is the quantile value corresponding to the sorted optimal objective values of scenario subproblems. This quantile bound can be improved by grouping subsets of scenarios at the expense of solving larger subproblems. The quality of the bound depends on how the scenarios are grouped. In this paper, we formulate a mixed-integer bilevel program that optimally groups scenarios to tighten the quantile bounds. For general chance-constrained programs, we propose a branch-and-cut algorithm to optimize the bilevel program, and for chance-constrained linear programs, a mixed-integer linear-programming reformulation is derived. Here, we also propose several heuristics for grouping similar or dissimilar scenarios. Our computational results demonstrate that optimal grouping bounds are much tighter than heuristic bounds, resulting in smaller root-node gaps and better performance of scenario decomposition for solving chance-constrained 0-1 programs. Also, the optimal grouping bounds can be greatly strengthened using larger group size.

97 MATHEMATICS AND COMPUTING↗

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)↗

Per-Phase and 3-Phase Optimal Coordination of Directional Overcurrent Relays Using Genetic Algorithm

Penetration of the power grid by renewable energy sources, distributed storage, and distributed generators is becoming increasingly common. Increased utilization of these distributed energy resources (DERs) has given rise to additional protection coordination concerns, particularly where they are utilized in an unbalanced manner or where loading among phases is unbalanced. Digital relays such as the SEL-751 (produced by Schweitzer Engineering Laboratories, Pullman, WA, USA) series have the capability of being set on a per-phase basis. This capability is underutilized in common practice. Additionally, in optimization algorithms for determining relay settings, the time-overcurrent characteristics (TOCs) of relays are generally not treated as variables and are assigned before running the optimization algorithm. In this paper, TOC options themselves are treated as discrete variables to be considered in the optimization algorithm. A mixed integer nonlinear programming problem (MINLP) is set up where the goal is to minimize relay operating times. A genetic algorithm (GA) approach is implemented in MATLAB where two cases are considered. In the first case, the TOC and Time dial setting (TDS) of each relay is set on a three-phase basis. In the second case, per-phase settings are considered. Relay TDSs and TOCs are both considered as simultaneous discrete control variables. Despite the stochastic nature of using per-phase settings for unbalanced systems is found to generally allow for shorter operating times. However, for relatively balanced systems, it is best to use three-phase settings if computation time is of importance.

Matthews, Ronald C.↗

Machine-learning-aided cognitive reconfiguration for flexible-bandwidth HPC and data center networks [Invited]

This paper proposes a machine-learning (ML)-aided cognitive approach for effective bandwidth reconfiguration in optically interconnected datacenter/high-performance computing (HPC) systems. The proposed approach relies on a Hyper-X-like architecture augmented with flexible-bandwidth photonic interconnections at large scales using a hierarchical intra/inter-POD photonic switching layout. We first formulate the problem of the connectivity graph and routing scheme optimization as a mixed-integer linear programming model. A two-phase heuristic algorithm and a joint optimization approach are devised to solve the problem with low time complexity. Then, we propose an ML-based end-to-end performance estimator design to assist the network control plane with intelligent decision making for bandwidth reconfiguration. Numerical simulations using traffic distribution profiles extracted from HPC applications traces as well as random traffic matrices verify the accuracy performance of the ML design estimator ( < <#comment/> 9 % <#comment/> error) and demonstrate up to 5 × <#comment/> throughput gain from the proposed approach compared with the baseline Hyper-X network using fixed all-to-all intra/inter-portable data center interconnects.

Chen, Xiaoliang (ORCID:0000000278056237)↗

DER Planning with Resilience Analysis Using REopt Lite: A Behind-the-Meter Techno-Economic Analysis Tool

REopt Lite is a techno-economic decision support model for behind-the-meter energy systems design and dispatch modeling. REopt Lite is used to optimize energy systems for buildings, campuses, communities, and microgrids. It is based on a Mixed Integer Linear Programming (MILP) optimization model. It is a fully automated and streamlined energy modeling tool that can be used off-the-shelf for a wide variety of distributed generation integration analyses and at the same time is architected to be extensible for user-specific customizations for advanced users and subject matter experts. It is publicly available as a webtool as well as has an Application Programming Interface (API). The API functionality enables programmatic access to the model facilitating smooth integration with other distribution systems modeling tools, and automated multiple scenarios/sensitivity studies.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Optimization of Airport Surface Traffic: A Case-Study of Incheon International Airport

This study aims to develop a controllers' decision support tool for departure and surface management of ICN. Airport surface traffic optimization for Incheon International Airport (ICN) in South Korea was studied based on the operational characteristics of ICN and airspace of Korea. For surface traffic optimization, a multiple runway scheduling problem and a taxi scheduling problem were formulated into two Mixed Integer Linear Programming (MILP) optimization models. The Miles-In-Trail (MIT) separation constraint at the departure fix shared by the departure flights from multiple runways and the runway crossing constraints due to the taxi route configuration specific to ICN were incorporated into the runway scheduling and taxiway scheduling problems, respectively. Since the MILP-based optimization model for the multiple runway scheduling problem may be computationally intensive, computation times and delay costs of different solving methods were compared for a practical implementation. This research was a collaboration between Korea Aerospace Research Institute (KARI) and National Aeronautics and Space Administration (NASA).

surface management↗

Optimization of Airport Surface Traffic: A Case-Study of Incheon International Airport

This study aims to develop a controllers decision support tool for departure and surface management of ICN. Airport surface traffic optimization for Incheon International Airport (ICN) in South Korea was studied based on the operational characteristics of ICN and airspace of Korea. For surface traffic optimization, a multiple runway scheduling problem and a taxi scheduling problem were formulated into two Mixed Integer Linear Programming (MILP) optimization models. The Miles-In-Trail (MIT) separation constraint at the departure fix shared by the departure flights from multiple runways and the runway crossing constraints due to the taxi route configuration specific to ICN were incorporated into the runway scheduling and taxiway scheduling problems, respectively. Since the MILP-based optimization model for the multiple runway scheduling problem may be computationally intensive, computation times and delay costs of different solving methods were compared for a practical implementation. This research was a collaboration between Korea Aerospace Research Institute (KARI) and National Aeronautics and Space Administration (NASA).

taxi scheduler↗

Optimizing district energy systems by integrating Borehole Thermal Energy Storage Using a Mixed-Integer Linear Programming g-function framework with a Multi-Timescale Rolling Horizon method

Shallow geothermal has gained increasing attention in recent years; however, a reliable framework for its accurate incorporation into large-scale energy system optimization remains lacking. This study proposes a Mixed-Integer Linear Programming (MILP) framework combined with the g-function approach to integrate Borehole Thermal Energy Storage (BTES) technology into energy system optimization. Validation against a Modelica-based reservoir network simulation demonstrates that the proposed framework effectively captures the ground thermal response under varying energy loads and accurately estimates the borefield energy supply. To enhance scalability, a Rolling Horizon with Multi-Timescale (RH-MTS) method is further introduced, reducing computational time by 73 % for the 1-year optimization model with only minor loss of optimality. The framework is demonstrated through the case study of the UC Berkeley campus. Results indicate that BTES is a cost-effective and low-carbon solution: two borefields comprising 382 boreholes can meet 8.0 % and 6.6 % of the total campus heating and cooling demand, respectively, at an average energy rate of 0.70–0.77 USD/kWh and carbon intensity of 0.54 kg-CO2/kWh. Short-term analysis reveals a 35%–65% decline in BTES energy flow after 3–6 months of continuous heating/cooling operation, while long-term simulation shows that annual energy production of BTES can vary by up to 12.0 % after four years before stabilizing. Overall, this study develops a novel optimization framework that couples physics-based g-function method with MILP optimization framework, thereby advancing methodological development for shallow-geothermal integration and providing actionable guidance for BTES deployment in district-energy systems.

Yang, Jiahui↗

A DSN optimal spacecraft scheduling model

A computer model is described which uses mixed-integer linear programming to provide optimal DSN spacecraft schedules given a mission set and specified scheduling requirements. A solution technique is proposed which uses Bender's Method and a heuristic starting algorithm.

Webb, W. A.↗

Connected Vehicle-Based Traffic Signal Coordination

This study presents a connected vehicles (CVs)-based traffic signal optimization framework for a coordinated arterial corridor. The signal optimization and coordination problem are first formulated in a centralized scheme as a mixed-integer nonlinear program (MINLP). The optimal phase durations and offsets are solved together by minimizing fuel consumption and travel time considering an individual vehicle’s trajectories. Due to the complexity of the model, we decompose the problem into two levels: an intersection level to optimize phase durations using dynamic programming (DP), and a corridor level to optimize the offsets of all intersections. In order to solve the two-level model, a prediction-based solution technique is developed. The proposed models are tested using traffic simulation under various scenarios. Compared with the traditional actuated signal timing and coordination plan, the signal timing plans generated by solving the MINLP and the two-level model can reasonably improve the signal control performance. When considering varies vehicle types under high demand levels, the proposed two-level model reduced the total system cost by 3.8% comparing to baseline actuated plan. MINLP reduced the system cost by 5.9%. It also suggested that coordination scheme was beneficial to corridors with relatively high demand levels. For intersections with major and minor street, coordination conducted for major street had little impacts on the vehicles at the minor street.

42 ENGINEERING↗

Optimizing the design and operation of water networks: Two decomposition approaches

We consider the design and operation of water networks simultaneously. Water network problems can be divided into two categories: the design problem and the operation problem. The design problem involves determining the appropriate pipe sizing and placements of pump stations, while the operation problem involves scheduling pump stations over multiple time periods to account for changes in supply and demand. Our focus is on networks that involve water co-produced with oil and gas. While solving the optimization formulation for such networks, we found that obtaining a primal (feasible) solution is more challenging than obtaining dual bounds using off-the-shelf mixed-integer nonlinear programming solvers. Therefore, we propose two methods to obtain good primal solutions. One method involves a decomposition framework that utilizes a convex reformulation, while the other is based on time decomposition. To test our proposed methods, we conduct computational experiments on a network derived from the PARETO case study.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

ACOPF Transmission Switching Using Open-Source MINLP Solvers

The optimal transmission switching (OTS) problem with AC physics represents a mixed integer non-linear non-convex optimization problem which can provide benefits to transmission level power system operations. In this paper we benchmark a set of open-source mixed integer non-linear programming (MINLP) solvers on the OTS problem with AC physics using the pglib set of power system test cases. Results characterizing the performance of the different solvers are reported and discussed.

ACOPF↗