Search NASA⌕ Search

SEARCH · Search NASA

Results for “LINEAR 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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Constraining Genome-Scale Models to Represent the Bow Tie Structure of Metabolism for 13 C Metabolic Flux Analysis

Determination of internal metabolic fluxes is crucial for fundamental and applied biology because they map how carbon and electrons flow through metabolism to enable cell function. 13 C Metabolic Flux Analysis ( 13 C MFA) and Two-Scale 13 C Metabolic Flux Analysis (2S- 13 C MFA) are two techniques used to determine such fluxes. Both operate on the simplifying approximation that metabolic flux from peripheral metabolism into central “core” carbon metabolism is minimal, and can be omitted when modeling isotopic labeling in core metabolism. The validity of this “two-scale” or “bow tie” approximation is supported both by the ability to accurately model experimental isotopic labeling data, and by experimentally verified metabolic engineering predictions using these methods. However, the boundaries of core metabolism that satisfy this approximation can vary across species, and across cell culture conditions. Here, we present a set of algorithms that (1) systematically calculate flux bounds for any specified “core” of a genome-scale model so as to satisfy the bow tie approximation and (2) automatically identify an updated set of core reactions that can satisfy this approximation more efficiently. First, we leverage linear programming to simultaneously identify the lowest fluxes from peripheral metabolism into core metabolism compatible with the observed growth rate and extracellular metabolite exchange fluxes. Second, we use Simulated Annealing to identify an updated set of core reactions that allow for a minimum of fluxes into core metabolism to satisfy these experimental constraints. Together, these methods accelerate and automate the identification of a biologically reasonable set of core reactions for use with 13 C MFA or 2S- 13 C MFA, as well as provide for a substantially lower set of flux bounds for fluxes into the core as compared with previous methods. We provide an open source Python implementation of these algorithms at https://github.com/JBEI/limitfluxtocore.

13C metabolic flux analysis↗
DOE OSTI2017

Exploiting Identical Generators in Unit Commitment

Here, we present sufficient conditions under which thermal generators can be aggregated in mixed-integer linear programming (MILP) formulations of the unit commitment (UC) problem, while maintaining feasibility and optimality for the original disaggregated problem. Aggregating thermal generators with identical characteristics (e.g., minimum/maximum power output, minimum up/down-time, and cost curves) into a single unit reduces redundancy in the search space induced by both exact symmetry (permutations of generator schedules) and certain classes of mutually non-dominated solutions. We study the impact of aggregation on two large-scale UC instances, one from the academic literature and another based on real-world operator data. Our computational tests demonstrate that when present, identical generators can negatively affect the performance of modern MILP solvers on UC formulations. Further, we show that our reformation of the UC MILP through aggregation is an effective method for mitigating this source of computational difficulty.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Coordinated platooning with multiple speeds

In a platoon, vehicles travel one after another with small intervehicle distances; trailing vehicles in a platoon save fuel because they experience less aerodynamic drag. This work presents a coordinated platooning model with multiple speed options that integrates scheduling, routing, speed selection, and platoon formation/dissolution in a mixed-integer linear program that minimizes the total fuel consumed by a set of vehicles while traveling between their respective origins and destinations. The performance of this model is numerically tested on a grid network and the Chicago-area highway network. We find that the fuel-savings factor of a multivehicle system significantly depends on the time each vehicle is allowed to stay in the network; this time affects vehicles’ available speed choices, possible routes, and the amount of time for coordinating platoon formation. For problem instances with a large number of vehicles, we propose and test a heuristic decomposed approach that applies a clustering algorithm to partition the set of vehicles and then routes each group separately. When the set of vehicles is large and the available computational time is small, the decomposed approach finds significantly better solutions than does the full model.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2020

Distributionally robust facility location problem under decision-dependent stochastic demand

While the traditional facility location problem considers exogenous demand, in some applications, locations of facilities could affect the willingness of customers to use certain types of services, e.g., carsharing, and therefore they also affect realizations of random demand. Moreover, a decision maker may not know the exact distribution of such endogenous demand and how it is affected by location choices. In this paper, we consider a distributionally robust facility location problem, in which we interpret the moments of stochastic demand as functions of facility-location decisions. We reformulate a two-stage decision-dependent distributionally robust optimization model as a monolithic formulation, and then derive exact mixed-integer linear programming reformulation as well as valid inequalities when the means and variances of demand are piecewise linear functions of location solutions. We conduct extensive computational studies, in which we compare our model with a decision-dependent deterministic model, as well as stochastic programming and distributionally robust models without the decision-dependent assumption. Here, the results show superior performance of our approach with remarkable improvement in profit and quality of service under various settings, in addition to computational speed-ups given by formulation enhancements. These results draw attention to the need of considering the impact of location decisions on customer demand within this strategic-level planning problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Network Modeling of the U.S. Petrochemical Industry under Raw Material and Hurricane Harvey Disruptions

A geographically resolved network model of the U.S. chemical industry in 2017 is designed, and optimal chemical flows between units are calculated using linear programming. A baseline solution and three disruption scenarios (primary raw material disruptions, reported Hurricane Harvey ethylene cracker disruptions, and assumed capacity disruptions based on the Hurricane Harvey geographic storm track) are reported on to determine how the structure of the industry is modified to adapt to widespread and geographically specific disruptions. The calculated impacts of the assumed Hurricane Harvey disruption include 170 chemical units in 26 states that change production level as a result of supply chain disruptions during the storm. The systemic impact for the assumed Hurricane Harvey disruption is 19.3 million tonnes of gross chemical production. The day with the largest impact on gross chemical production shows a reduction from baseline operations of 1.3 million tonnes (42% of baseline). This model can be utilized for analysis of future disruption scenarios and to test resilience strategies, including impacts of new manufacturing configurations or technologies.

02 PETROLEUM↗
DOE OSTI2019

Distributed biomass supply chain cost optimization to evaluate multiple feedstocks for a biorefinery

Conventional practices of siting all biomass preprocessing operations at the biorefinery is widely believed to be the most cost-effective solution for feedstock supply because of economies of scale. Yet, biomass preprocessing operations could be decentralized by moving the preprocessing operations to distributed biomass preprocessing centers, also known as “depots” located near biomass sources. We present a comparative case study with multiple biomass resources to analyze biorefinery feedstock supply logistics designs having distributed depots and a primary depot co-located with the biorefinery. A mixed-integer linear programming model was developed to simultaneously optimize feedstock sourcing decisions, and optimal preprocessing depot locations and size, utilizing biomass resources from agricultural residue, energy and municipal solid waste to meet carbohydrate specifications and feedstock demand for a biochemical conversion process. Findings from a case study in the US showed that a biorefinery could increase its feedstock supply draw area and supply volume by 57.3%, 177.4% respectively without increasing the feedstock delivered cost by adopting distributed depot-in the feedstock supply chain design. A distributed-depot-based supply chain can be more economical by selecting optimal mix of biomass resource, optimal siting and depot scales during feedstock supply chain design. The results from this study indicate that a biorefinery can utilize dynamic blending to meet the feedstock quality specifications as well as larger supply radius in the distributed depot-based supply chain design to access more available biomass to handle potential feedstock supply uncertainty.

09 BIOMASS FUELS↗
DOE OSTI2018

Optimal blending management of biomass resources used for biochemical conversion

This research develops an optimization model to describe the tradeoff among blend components in the least-cost biomass blend, based on resource availability, quality requirements, and logistics cost for a biochemical conversion. A mixed-integer linear programming model is developed to determine the least-cost blend from a set of candidate feedstocks. A case study – based on a biorefinery located in western Kansas that uses three-pass corn stover, two-pass corn stover, switchgrass, miscanthus, and municipal solid waste fractions to meet biochemical conversion specifications and feedstock demand – shows that the delivered cost of an optimal blend that meets carbohydrate and ash specifications is 12.12% higher than the delivered cost of optimal blend that meets a carbohydrate specification only. The results indicate that a least-cost blend that meets both carbohydrate and ash specifications consists of miscanthus (48.2%) and switchgrass (29.4%) whereas the least-cost blend meeting carbohydrate specification only comprises three-pass corn stover (55.4%) and two-pass corn stover (20.4%). Here an optimal blend uses a low-cost municipal solid waste fraction in all cases, implying that blending could be a potential strategy to reduce delivered feedstock cost.

09 BIOMASS FUELS↗
DOE OSTI2025

Multi-objective optimization of sustainable aviation fuel production pathways in the U.S. Corn Belt

As a potential source of low-carbon transportation energy, biofuels offer certain advantages over vehicle electrification (e.g., lower societal vulnerability to grid failures, and improved range of sustainable aviation), but also several challenges, including cost, carbon intensity, and land usage. There are also well-founded concerns that biofuel supply chains could be disrupted if extreme weather events impact feedstock yields. In this paper, we explore the use of multi-objective optimization to identify biofuel production pathways that balance cost, greenhouse gas emissions, and supply vulnerability to extreme weather. We compare the use of three different many-objective evolutionary algorithms and linear programming in optimizing biomass cultivation decisions in the U.S. Corn Belt under weather uncertainty using historical, modeled, and synthetic yield data. We consider four feedstock choices (corn, soy, switchgrass, and algae) with two land types (agricultural and marginal lands) and evaluate decisions using three alternative spatial resolutions (ranging from the USDA agricultural district level to the state level). Results show that feedstock choice is the primary driver of objective performance (i.e., the position and shape of 3D, approximate Pareto frontiers). Spatial diversification is a less effective tool in reducing exposure to weather-caused drops in crop yield.

09 BIOMASS FUELS↗
DOE OSTI2020

Cooperative Routing for an Air–Ground Vehicle Team—Exact Algorithm, Transformation Method, and Heuristics

This paper considers a cooperative vehicle routing problem for an intelligence, surveillance, and reconnaissance mission in the presence of communication constraints between the vehicles. The proposed framework uses a ground vehicle and an unmanned aerial vehicle (UAV) that travel cooperatively and visit a set of targets while satisfying the communication constraints. The problem is formulated as a mixed-integer linear program, and a branch-and-cut algorithm is developed to solve the problem to optimality. Furthermore, a transformation method and a heuristic are also developed for the problem. The effectiveness of all the algorithms is corroborated through extensive computational experiments on several randomly generated instances. Furthermore, this paper is motivated by an intelligence, surveillance, and reconnaissance mission involving a single unmanned aerial vehicle (UAV) and a ground vehicle, where the vehicles must coordinate their activity in the presence of communication constraints. The combination of a small UAV and a ground vehicle is an ideal platform for such missions, since small UAVs can fly at low altitudes and can avoid obstacles or threats that would be problematic for the ground vehicle alone. This paper addresses the coordinated routing problem involving these two vehicles and presents an algorithm to obtain an optimal solution for this problem, fast heuristics to obtain good feasible solutions, and also a transformation method to transform any instance of this cooperative vehicle routing problem to an instance of the one-in-a-set traveling salesman problem.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2024

Multi-Attribute Subset Selection enables prediction of representative phenotypes across microbial populations

The interpretation of complex biological datasets requires the identification of representative variables that describe the data without critical information loss. This is particularly important in the analysis of large phenotypic datasets (phenomics). Here we introduce Multi-Attribute Subset Selection (MASS), an algorithm which separates a matrix of phenotypes (e.g., yield across microbial species and environmental conditions) into predictor and response sets of conditions. Using mixed integer linear programming, MASS expresses the response conditions as a linear combination of the predictor conditions, while simultaneously searching for the optimally descriptive set of predictors. We apply the algorithm to three microbial datasets and identify environmental conditions that predict phenotypes under other conditions, providing biologically interpretable axes for strain discrimination. MASS could be used to reduce the number of experiments needed to identify species or to map their metabolic capabilities. The generality of the algorithm allows addressing subset selection problems in areas beyond biology.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

Mitigation-Aware Bidding Strategies in Electricity Markets

Market power exercise in the electricity markets distorts market prices and diminishes social welfare. Many markets have implemented market power mitigation processes to eliminate the impact of such behavior. The design of mitigation mechanisms has a direct influence on investors' profitability and thus mid-/long-term resource adequacy. In order to evaluate the effectiveness of the existing market power mitigation mechanisms, this paper proposes a mitigation-aware strategic bidding model and studies the bidding strategies of the market participants under current practice. The proposed bidding model has a bilevel structure with strategic participant's profit maximization problem in the upper level and the dispatch problem for market operators in the lower level. In particular, the consideration of potential offer mitigation is incorporated as upper-level constraints based on the conduct and impact tests. This bilevel problem is reduced to a single-level mixed-integer linear program using the KKT optimality conditions, duality theory, and linearization. Numerical results illustrate how a strategic player can exercise market power to achieve a higher profit even under the current market power mitigation process and we analyze the social impact that the market power exercise results.

Wu, Yiqian↗
DOE OSTI2023

Disjunctive optimization model and algorithm for long-term capacity expansion planning of reliable power generation systems

This paper proposes a new optimization model and algorithm for long-term capacity expansion planning of reliable power generation systems. The model optimizes both investment decisions (e.g., size, location, and time to install, retire and decommission facilities) and operation decisions (e.g., on/off status, operating capacity, and expected power output). It is also able to optimize reserve systems (or backup systems), as well as the main systems, to improve power systems reliability. An impact of operational strategies of generators (i.e., participating in electricity production vs. remaining as idle units during operation) on power systems reliability is considered. Probability of equipment failures and capacity failure states are used to rigorously estimate the power systems reliability depending on design and operation strategies. The optimization model is formulated with Generalized Disjunctive Programming (GDP), which is reformulated as a mixed-integer linear programming (MILP) model using the Hull relaxation. Two reliability-related penalties, such as downtime penalty and unmet demand penalty, are included in the objective function to maximize reliability while minimizing the total net present cost. Furthermore, a bilevel decomposition with tailored cuts is developed to reduce computational times of the multi-scale optimization model. The effectiveness of the proposed model is shown by comparing the results with the results obtained from the expansion planning models that do not explicitly consider reliability. In conclusion, we also show that the proposed bilevel decomposition is computationally efficient for solving large scale problems through 5-years and 10-years planning case studies.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2020

Optimal charging scheduling and management for a fast-charging battery electric bus system

Herein we discuss how battery electric buses (BEBs) are rapidly being embraced by public transit agencies because of their environmental and economic benefits. To address the problems of limited driving range and time-consuming charging for BEBs, manufacturers have developed rapid on-route charging technology that utilizes typical layovers at terminals to charge buses in operation using high power. With on-route fast-charging, BEBs are as capable as their diesel counterparts in terms of range and operating time. However, on-route fast-charging makes it more challenging to schedule and manage charging events for a BEB system. First, on-route fast-charging may lead to high electricity power demand charges. Second, it may increase electricity energy charges because of charging that occurs during on-peak hours. Without careful charging scheduling and management, on-route fast-charging may significantly increase fuel costs and reduce the economic attractiveness of BEBs. The present study proposes a network modeling framework to optimize the charging scheduling and management for a fast-charging BEB system, effectively minimizing total charging costs. The charging schedule determines when to charge a BEB, while the charging management strategically controls the actual charging power. Charging costs include both electricity demand charges and energy charges. The charging scheduling and management problem is first formulated as a nonlinear nonconvex program with time-continuous variables. A discretizing method and a linear reformulation technique are then adopted to reformulate the model as a linear program, which can be easily solved using off-the-shelf solvers, even for large-scale problems. Finally, the model is demonstrated with extensive numerical studies based on two real-world bus networks. The results demonstrate that the proposed model can effectively determine the optimal charging scheduling and management for a fast-charging BEB system, which carries the potential for use in large-scale real-world bus networks.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2019

Optimal Scheduling of an Isolated Microgrid With Battery Storage Considering Load and Renewable Generation Uncertainties

By modeling the uncertainty of spinning reserves provided by energy storage with probabilistic constraints, a new optimal scheduling mode is proposed in this paper for minimizing the operating costs of an isolated microgrid (MG) by using chance-constrained programming. The model is transformed into a readily solvable mixed integer linear programming formulation in general algebraic modeling system (GAMS) via a proposed discretized step transformation approach and finally solved by applying the CPLEX solver. By properly setting the confidence levels of the spinning reserve probability constraints, the MG operation can achieve a tradeoff between reliability and economy. The test results on the modified Oak Ridge National Laboratory Distributed Energy Control and Communication lab MG test system reveal that the proposal significantly exceeds the commonly used hybrid intelligent algorithm with much better and more stable optimization results and significantly reduced calculation times.

Li, Yang↗
DOE OSTI2021

Decomposing Loosely Coupled Mixed-Integer Programs for Optimal Microgrid Design

Microgrids are frequently employed in remote regions, in part because access to a larger electric grid is impossible, difficult, or compromises reliability and independence. Although small microgrids often employ spot generation, in which a diesel generator is attached directly to a load, microgrids that combine these individual loads and augment generators with photovoltaic cells and batteries as a distributed energy system are emerging as a safer, less costly alternative. In this work, we present a model that seeks the minimum-cost microgrid design and ideal dispatched power to support a small remote site for one year with hourly fidelity under a detailed battery model; this mixed-integer nonlinear program (MINLP) is intractable with commercial solvers but loosely coupled with respect to time. A mixed-integer linear program (MIP) approximates the model, and a partitioning scheme linearizes the bilinear terms. We introduce a novel policy for loosely coupled MIPs in which the system reverts to equivalent conditions at regular time intervals; this separates the problem into subproblems that we solve in parallel. We obtain solutions within 5% of optimality in at most six minutes across 14 MIP instances from the literature and solutions within 5% of optimality to the MINLP instances within 20 minutes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Shortest path network interdiction with asymmetric uncertainty

Abstract This paper considers an extension of the shortest path network interdiction problem that incorporates robustness to account for parameter uncertainty. The shortest path interdiction problem is a game of two players with conflicting agendas and capabilities: an evader, who traverses the arcs of a network from a source node to a sink node using a path of shortest length, and an interdictor, who maximizes the length of the evader's shortest path by interdicting arcs on the network. It is usually assumed that the parameters defining the network are known exactly by both players. We consider the situation where the evader assumes the nominal parameter values while the interdictor uses robust optimization techniques to account for parameter uncertainty or sensor degradation. We formulate this problem as a nonlinear mixed‐integer semi‐infinite bilevel program and show that it can be converted into a mixed‐integer linear program with a second order cone constraint. We use random geometric networks and transportation networks to perform computational studies and demonstrate the unique decision strategies that our variant produces. Solving the shortest path interdiction problem with asymmetric uncertainty protects the interdictor from investing in a strategy that hinges on key interdictions performing as promised. It also provides an alternate strategy that mitigates the risk of these worst‐case possibilities.

Punla‐Green, She'ifa Z.↗
DOE OSTI2025

A Fast Dynamic Internal Predictive Power Scheduling Approach for Power Management in Microgrids: Preprint

This paper presents a Dynamic Internal Predictive Power Scheduling (DIPPS) approach for optimizing power management in microgrids, particularly focusing on external power exchanges among diverse prosumers. DIPPS utilizes a dynamic objective function with a time-varying binary parameter to control the timing of power transfers to the external grid, facilitated by efficient usage of energy storage for surplus renewable power. The microgrid power scheduling problem is modeled as a mixed-integer nonlinear programming (MINLP-PS) and subsequently transformed into a mixed-integer linear programming (MILPPS) optimization through McCormick's relaxation to reduce computational complexity. A predictive window window with 6 data points is solved at an average of 0.92s, a 97.6% improvement over the 38.27s required for the MINLP-PS formulation, implying the numerical feasibility of the DIPPS approach for real-time implementation. Finally, the approach is validated against a static objective using real-world load data across three case studies with different time-varying parameters, demonstrating the ability of DIPPS to optimize power exchanges and efficiently utilize distributed resources while shifting the external power transfers to specified time durations.

24 POWER TRANSMISSION AND DISTRIBUTION↗