Search NASA⌕ Search

SEARCH · Search NASA

Results for “mathematical 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 55 records · Page 3

Robust planning of dynamic wireless charging infrastructure for battery electric buses

Battery electric buses with zero tailpipe emissions have great potential in improving environmental sustainability and livability of urban areas. However, the problems of high cost and limited range associated with on-board batteries have substantially limited the popularity of battery electric buses. The technology of dynamic wireless power transfer (DWPT), which provides bus operators with the ability to charge buses while in motion, may be able to effectively alleviate the drawbacks of electric buses. In this paper, we address the problem of simultaneously selecting the optimal location of the DWPT facilities and designing the optimal battery sizes of electric buses for a DWPT electric bus system. The problem is first constructed as a deterministic model in which the uncertainty of energy consumption and travel time of electric buses is neglected. The methodology of robust optimization (RO) is then adopted to address the uncertainty of energy consumption and travel time. The affinely adjustable robust counterpart (AARC) of the deterministic model is developed, and its equivalent tractable mathematical programming is derived. Both the deterministic model and the robust model are demonstrated with a real-world bus system. The results of our study demonstrate that the proposed deterministic model can effectively determine the allocation of DWPT facilities and the battery sizes of electric buses for a DWPT electric bus system; and the robust model can further provide optimal designs that are robust against the uncertainty of energy consumption and travel time for electric buses.

25 ENERGY STORAGE↗

Joint Design of Multimodal Transit Networks and Shared Autonomous Mobility Fleets

Providing quality transit service to travelers in low-density areas, particularly travelers without personal vehicles, is a constant challenge for transit agencies. The advent of fully-autonomous vehicles (AVs) and their inclusion in mobility service fleets may allow transit agencies to offer better service and/or reduce their own capital and operational costs. This study focuses on the problem of allocating resources between transit patterns and operating (or subsidizing) shared-use AV mobility services (SAMSs) in a large metropolitan area. To address this question, a joint transit network redesign and SAMS fleet size determination problem (JTNR-SFSDP) is introduced, and a bi-level mathematical programming formulation and solution approach are presented. The upper-level problem modifies a transit network frequency setting problem (TNFSP) formulation via incorporating SAMS fleet size as a decision variable and allowing the removal of bus routes. The lower-level problem consists of a dynamic combined mode choice-traveler assignment problem (DCMC-TAP) formulation. The heuristic solution procedure involves solving the upper-level problem using a nonlinear programming solver and solving the lower-level problem using an iterative agent-based assignment-simulation approach. To illustrate the effectiveness of the modeling framework, this study uses traveler demand from Chicago along with the regions existing multimodal transit network. The computational results indicate significant traveler benefits, in terms of improved average traveler wait times, associated with optimizing the joint design of multimodal transit networks and SAMS fleets compared with the initial transit network design.

bi-level programming↗

Selection of stable reference genes for RT-qPCR in Rhodococcus opacus PD630

Rhodococcus opacus PD630 is a gram-positive bacterium with promising attributes for the conversion of lignin into valuable fuels and chemicals. To develop an organism as a cellular factory, it is necessary to have a deep understanding of its metabolism and any heterologous pathways being expressed. For the purpose of quantifying gene transcription, reverse transcription quantitative PCR (RT-qPCR) is the gold standard due to its sensitivity and reproducibility. However, RT-qPCR requires the use of reference genes whose expression is stable across distinct growth or treatment conditions to normalize the results. Unfortunately, no in-depth analysis of stable reference genes has been conducted in Rhodococcus, inhibiting the utilization of RT-qPCR in R. opacus. In this work, ten candidate reference genes, chosen based on previously collected RNA sequencing data or literature, were examined under four distinct growth conditions using three mathematical programs (BestKeeper, Normfinder, and geNorm). Based on this analysis, the minimum number of reference genes required was found to be two, and two separate pairs of references genes were identified as optimal normalization factors for when ribosomal RNA is either present or depleted. This work represents the first validation of reference genes for Rhodococcus, providing a valuable starting point for future research.

59 BASIC BIOLOGICAL SCIENCES↗

Dynamic NMR under nonstationary conditions: Theoretical model, numerical calculation, and potential of application

An expression has been derived for the time dependence of the NMR line shape for systems with multi-site chemical exchange in the absence of spin-spin coupling, in a zero saturation limit. The dynamics of variation of the NMR line shape with time is considered in detail for the case of two-site chemical exchange. Mathematical programs have been designed for numerical simulation of the NMR spectra of chemical exchange systems. The analytical expressions obtained are useful for NMR line shape simulations for systems with photoinduced chemical exchange.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Available land for cellulosic biofuel production: a supply chain centered comparison

The land that is potentially available to produce dedicated cellulosic bioenergy crops, often referred to as 'marginal' land, depends heavily on the underlying assumptions used to classify and identify it. In this study we compare three definitions and types of marginal land to identify the interactions between the bioenergy landscape and the logistics networks needed for the biofuel supply chain. Typical studies of the scale, cost, and greenhouse gas (GHG) mitigation potential of cellulosic biofuel take a land-centered approach which may neglect to account for the trade-offs between establishing bioenergy crops and the supply chain design decisions needed to allow those crops to be converted to liquid fuel. A mathematical programming approach is used to minimize the total annualized cost of a large-scale field-to-product system producing bioethanol in the USA midwest. Results show that a high concentration of marginal land leads to efficient systems and that the bioenergy landscape design becomes increasingly important with a higher emphasis on GHG mitigation. Additionally, targeted landscape design (including fertilization) with a focus on fields with high soil carbon sequestration potential can greatly reduce the system-wide GHG emissions for only a small increase in the unit cost of biofuel.

09 BIOMASS FUELS↗

Endogenizing Probabilistic Resource Adequacy Risks in Deterministic Capacity Expansion Models

In this work, we demonstrate how power system capacity expansion models can understate the stochastic effects of thermal outages when considering resource availabilities on an hourly expected value basis, yielding system designs with multiple orders of magnitude more shortfall risk than stated adequacy targets. We develop a novel approximation approach to efficiently endogenize awareness of this risk in a deterministic, linear capacity expansion framework. We compare this approach to exogenous tuning of an energy reserve margin, the leading alternative method to compensate for unmodeled probabilistic shortfall risk. Empirical results from a test system show that the new endogenous method cost-effectively meets all regional reliability targets with a single optimization solve, and produces a near-identical system design as the incumbent method without the need for repeated re-optimizations to find an appropriate reserve level. The endogenous method may also use iterative re-optimizations to further improve solution quality, although these incremental benefits were modest in the system studied.

capacity expansion modeling↗

Resource Adequacy in Electricity Markets With Renewable Energy

This paper presents a market-based resource adequacy assessment framework to analyze the system generation portfolio that results in a competitive market environment. In particular, we apply the modeling framework to investigate the impact of high penetration levels of variable renewable energy resources and different market designs on achieving resource adequacy. The model captures the strategic capacity investment and retirement decision-making of profit-maximizing generation companies. In contrast to many previous studies, this paper considers markets for capacity, energy, and reserve products in detail; thus, the modeling framework allows improved analysis of generation expansion and revenue sufficiency in a competitive market environment. The modeling framework is based on Stackelberg leader-follower games and is formulated as a bi-level optimization problem, which is then transformed into a mathematical program with equilibrium constraints. Furthermore, we employ a Lagrangian decomposition algorithm to enhance computational performance. In a case study of the electric reliability council of texas (ERCOT) system, we compare the results from the proposed model with those obtained from a traditional centralized least-cost planning model. Finally, the results demonstrate the effectiveness of the proposed modeling framework and highlight the importance of considering strategic behavior in a competitive market framework when assessing resource adequacy.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

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↗

EMISApproximateEquilibrium.jl [SWR-19-56]

The Electricity Markets Investment Suite Approximate Equilibrium (EMIS-AE) package is developed at NREL and provides a solution capability to solve generation expansion equilibrium problems in the electricity markets. EMIS-AE is designed to capture the evolution of the electricity generation portfolio resulting from the interactions of heterogeneous investors under different policy and market designs. The investment problem for each generation company (GENCO) is a bi-level problem with the investment decision made in the upper level and market clearing condition in the lower level, which traditionally is represented as a Mathematical Program with Equilibrium Constraint (MPEC). EMIS-AE provides a predictive model to be trained for estimating the system-wide revenues for each technology type across energy, ancillary services and capacity markets given the amount of installed capacity on the grid. The profit maximization investment problem for each GENCO is solved using a global search algorithm, which uses the predictive model to evaluate the objective function. To solve for the strategic equilibrium, each GENCO’s problem is plugged into a diagonalization algorithm that is generally used in multi-leader, single-follower bi-level problems.

Dalvi, Sourabh↗

Cost of Oil and Biomass Supply Shocks under Different Biofuel Supply Chain Configurations

This analysis estimates the cost of selected oil and biomass supply shocks for producers and consumers in the light-duty vehicle fuel market under various supply chain configurations using a mathematical programing model, BioTrans. The supply chain configurations differ by whether they include selected flexibility levers: multi-feedstock biorefineries; advanced biomass logistics; and the ability to adjust ethanol content of low-ethanol fuel blends, from E10 to E15 or E05. The simulated scenarios explore market responses to supply shocks including substitution between gasoline and ethanol, substitution between different sources of ethanol supply, biorefinery capacity additions or idling, and price adjustments. Welfare effects for the various market participants represented in BioTrans are summarized into a net shock cost measure. As oil accounts for a larger fraction of fuel by volume, its supply shocks are costlier than biomass supply shocks. Corn availability and the high cost of adding biorefinery capacity limit increases in ethanol use during gasoline price spikes. During shocks that imply sudden decreases in the price of gasoline, the renewable fuel standard (RFS) biofuel blending mandate limits the extent to which flexibility can be exercised to reduce ethanol use. The selected flexibility levers are most useful in response to cellulosic biomass supply shocks.

Uria Martinez, Rocio↗

Optimal Design Approaches for Cost-Effective Manufacturing & Deployment of Chemical Process Families with Economies of Numbers

This work builds on our optimization formulation for process family design and extends it to explicitly include the benefits of economies of numbers. Economies of numbers (sometimes referred to as economies of learning) is a well-documented cost saving phenomenon. It characterizes the manufacturing cost savings due to standardization; in particular, it is capturing the correlation between cost reduction and the number of times a particular product has been manufactured. Following an approach similar to that in Gazzaneo et al. (2022), we develop a costing expression that captures material costs and manufacturing costs as a function of the number of unit modules produced. If the platform has a small number of unit module designs, we will be manufacturing a large number of each of these designs and gaining increased benefits from economies of numbers. However, increasing the number of unit module designs in the platform gives each process variant more choices to consider (at the cost of reducing economies of numbers). The optimization formulation in Stinchfield et al. (2023) pre-specified the number of unit module designs to be included in the platform. Here, by including the economies of numbers explicitly, we allow the mathematical programming formulation to determine the optimal number of unit module designs to include in the platform. We demonstrate this approach on multiple case studies, including MEA-based carbon capture and water desalination.

Stinchfield, Georgia↗

Scalable and Memory-Efficient Algorithms for Controlling Networked Epidemic Processes Using Multiplicative Weights Update Method

We study the problem of designing scalable algorithms to find effective intervention strategies for controlling stochastic epidemic processes on networks. This is a common problem arising in agent based models for epidemic spread. Previous approaches to this problem focus on either heuristics with no guarantees or approximation algorithms that scale only to networks corresponding to county-sized populations, typically, with less than a million nodes. In particular, the mathematical-programming based approaches need to solve the Linear Program (LP) relaxation of the problem using an LP solver, which restricts the scalability of this approach. In this work, we overcome this restriction by designing an algorithm that adapts the multiplicative weights update (MWU) framework, along with the sample average approximation (SAA) technique, to approximately solve the linear program (LP) relaxation for the problem. To scale this approach further, we provide a memory-efficient algorithm that enables scaling to large networks, corresponding to country-size populations, with over 300 million nodes and 30 billion edges. Furthermore, we show that this approach provides near-optimal solutions to the LP in practice.

Sambaturu, Prathyush↗

Optimizing Fleet Operations in Automated Mobility Districts: Serving On-Demand Mobility with Automated Electric Shuttles

On-demand transportation services have seen a dramatic rise in the past decade, thanks to technology. Connected and automated vehicle (CAV) technology holds potential for a major transformation in the on-demand mobility services landscape.The timeline for fully automated vehicles (AVs) to reach the critical market share is still uncertain. In the short term, many cities in the United States and abroad are testing low-speed automated electric shuttles (AES) as a shared on-demand mobility service in geo-fenced regions. An automated mobility district (AMD) is a campus-sized implementation of connected/automated vehicle technology to realize the full benefits of a fully electric automated mobility service within a confined region or district. Building on this concept, an AMD toolkit is under development at the National Renewable Energy Laboratory (NREL) to inform a campus-or district-sized implementation in which automated electric shuttles (AES). This research extends the functionality of the AMD toolkit by developing a mathematical program to optimize the operations of an AES fleet in an on-demand service configuration.

25 ENERGY STORAGE↗

PREEMPT: Scalable Epidemic Interventions Using Submodular Optimization on Multi-GPU Systems

Preventing and slowing the spread of epidemics is achieved through techniques such as vaccination and social distancing. Given practical limitations on the number of vaccines and cost of administration, optimization becomes a necessity. Previous approaches using mathematical programming methods have shown to be effective but are limited by computational costs. In this work, we make several contributions: First, we present a new approach for intervention via maximizing the influence of vaccinated nodes on the network. We call this method \preempt. Next, we prove submodular properties associated with the objective function of our method so that it aids in construction of an efficient greedy approximation strategy. Consequently, we present a new parallel algorithm based on greedy hill climbing for \preempt, and present an efficient parallel implementation for distributed CPU-GPU heterogeneous platforms. Our results demonstrate that \preempt{} is able to achieve a significant reduction (up to 6.75$\times$) in the percentage of people infected on a city-scale network. We also show strong scaling results of \preempt{} on 128 nodes of the Summit supercomputer. Our parallel implementation is able to significantly reduce time to solution, from hours to minutes on large networks. This work represents a first-of-its-kind effort in parallelizing greedy hill climbing and applying it toward devising effective interventions for epidemics.

Minutoli, Marco↗

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↗

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↗