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 181 records · Page 10

A novel matching formulation for startup costs in unit commitment

Here we present a novel formulation for startup cost computation in the unit commitment problem (UC). Both our proposed formulation and existing formulations in the literature are placed in a formal, theoretical dominance hierarchy based on their respective linear programming relaxations. Our proposed formulation is tested empirically against existing formulations on large-scale UC instances drawn from real-world data. While requiring more variables than the current state-of-the-art formulation, our proposed formulation requires fewer constraints, and is empirically demonstrated to be as tight as a perfect formulation for startup costs. This tightening can reduce the computational burden in comparison to existing formulations, especially for UC instances with large reserve margins and high penetration levels of renewables.

97 MATHEMATICS AND COMPUTING↗

Flexible dynamic boundary microgrid operation considering network and load unbalances

Flexible microgrids with dynamic boundaries have recently been introduced in the literature. With the ability to reconfigure the topology of the microgrids dynamically through remotely controlled switches, flexible microgrids with dynamic boundaries can further improve the resiliency and energy efficiency of microgrids with distributed energy resources (DERs). This paper focuses on the optimal operation considering one of the predominant characteristics of microgrids and distribution systems – unbalanced networks and loads. In existing literature, balanced modeling of microgrids is more common due to its attractive simplicity. The three-phase power unbalance has not been considered as a constraint on the generation units in a microgrid. Further, negative sequence constraints have also been neglected. In this article, we propose a set of constraints that is specifically related to the capabilities of inverter interfaced resources to supply unbalanced current/power when the microgrid is islanded from the main distribution grid. We incorporate the new set of constraints into two optimization formulations leveraging two convex relaxations of the three-phase power flow equations: mixed-integer linear programming (MILP) and mixed-integer semidefinite programming (MISDP) that optimize the dispatch of controllable switches and DERs in the microgrid. The algorithms are then extended to networked microgrids with grid-forming sources. We test the algorithms on a realistic community microgrid model in Puerto Rico as well as standardized IEEE distribution test feeders. The testing results demonstrate the performance of the proposed algorithms. The MILP is fast and scalable, and the MISDP enforces the negative sequence voltage constraints.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Data-Driven Energy Resilience Assessment and Enhancement in Urban Communities: A Case Study in Detroit

This paper presents a data-driven framework for assessing and enhancing energy resilience in urban communities. The resilience assessment is based on two datasets: 1) annual aggregated power outage data and 2) 15-minute interval outage data. High-impact, low-probability (HILP) events are identified within these datasets to evaluate community resilience under extreme conditions. To enhance resilience, an optimization framework utilizing mixed integer linear programming is developed to determine the optimal sizing and placement of solar photovoltaic (PV) systems and battery energy storage systems (BESS). This method offers a cost-effective and practical solution for improving energy resilience in vulnerable communities. Furthermore, a case study of the City of Detroit in Michigan demonstrates the effectiveness of the framework through simulation and validation.

Energy resilience assessment↗

Design Considerations of a Coordinative Demand Charge Mitigation Strategy

This paper presents a coordinative demand charge mitigation (DCM) strategy for reducing electricity consumption during system peak periods. Available DCM resources include batteries, diesel generators, controllable loads, and conservation voltage reduction. All resources are directly controlled by load serving entities. A mixed integer linear programming based energy management algorithm is developed to optimally coordinate of DCM resources considering the load payback effect. To better capture system peak periods, two different kinds of load forecast are used: the day-ahead load forecast and the peak-hour probability forecast. Five DCM strategies are compared for reconciling the discrepancy between the two forecasting results. The DCM strategies are tested using actual utility data. Simulation results show that the proposed algorithm can effectively mitigate the demand charge while preventing the system peak from being shifted to the payback hours. We also identify the diminishing return effect, which can help load serving entities optimize the size of their DCM resources.

Hu, Rongxing↗

Network coding for improving throughput in WDM optical networks with dedicated protection

Network coding (NC) has been recently emerging as an excellent technique for leveraging network efficiency. In optical networks, NC and protection appear to be a good match and indeed, NC could be effectively exploited for greater protection efficiency thanks to the opportunity of combining signals rather than duplication in the traditional approach. Motivated by this observation, we investigate the application of a simple and practical NC technique based on XOR operation to improve the network throughput in survivable optical networks. To this end, we propose the NC-based protection whose speed recovery is on a par with the conventional 1+1 dedicated protection while the capacity usage could be more efficient, paving the way for improving throughput in constrained capacity conditions. A novel mixed integer linear programming model is developed for survivable optical networks design employing the proposed NC-based protection. The model attempts to optimally determine the demands to serve, the routing for served demands and NC assignment among demands aiming at maximizing the network throughput in the constraint of bandwidth limitation. Extensive numerical evaluations on realistic topologies are provided to highlight the advantages of our NC-based protection proposal compared with the conventional dedicated protection in improving the network throughput. Encouraging results are observed when the new protection proposal based on NC could accommodate up to 30% more traffic than the conventional case.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

Design and dispatch optimization of packaged ice storage systems within a connected community

The traditional implementation of cool thermal energy storage (CTES) must be reimagined within the context of a dynamic grid and smart buildings operating as connected communities. As most buildings do not operate central chillers or connect to district cooling loops, this necessitates a broader use of packaged CTES. Our objective is to begin answering the question of how such packaged CTES should be implemented within a connected community. We do so by presenting a simulation–optimization workflow employing building energy modeling software and a mixed-integer linear program to design and dispatch a packaged CTES technology to achieve minimum total annual cost. We demonstrate this methodology on a seven-building case study using current utility rates and find that total annual cooling energy costs can be reduced by 17.8% compared to baseline, after accounting for the cost of storage. We perform three parametric sensitivity studies to evaluate modeling assumptions and obtain the prioritization of storage procurement as a function of annualized life-cycle cost of storage. We find that a community optimization approach provides significantly different results than individual building optimizations and provides greater savings compared to baseline.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A Non-Exhaustive Search Algorithm to Identify Distribution Grid Operational Topology

Distribution grid, in general, is constructionally loopy but a radially operated network. Opening and closing of suitable tie-switches allow transition from one topology to another. Identifying the operational topology of a distribution system is essential for accurate control actions. This paper proposes a non-exhaustive search approach to detect the operational topology of the distribution feeder by estimating the switch statuses. In this work, a mixed-integer linear programming approach is proposed that finds the correct operational topology by identifying the system load demand and power flow variables that are closest to the corresponding measured values. The problem is constrained by distribution power flow and radial structure of the feeder. This formulation allows the inclusion of errors in power/line flow measurements making it more suitable for a practical distribution system. The proposed approach finds the correct operational topology without exhaustively searching for all possible topologies. We thoroughly validate the accuracy and effectiveness of the proposed approach in identifying correct operational topology using IEEE 123-node feeder with the help of numerous simulations studies. It is observed that the approach performs well even at very high percentages of load and flow measurement errors.

Missed detection ratio (MDR), Mixed-integer linear↗

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↗

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↗

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↗

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↗

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↗

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↗

A program for identification of linear systems

A program has been written for the identification of parameters in certain linear systems. These systems appear in biomedical problems, particularly in compartmental models of pharmacokinetics. The method presented here assumes that some of the state variables are regularly modified by jump conditions. This simulates administration of drugs following some prescribed drug regime. Parameters are identified by a least-square fit of the linear differential system to a set of experimental observations. The method is especially suited when the interval of observation of the system is very long.

Buell, J.↗

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↗

PURE: Scalable Phase Unwrapping with Spatial Redundant Arcs

Phase unwrapping is a key problem in many coherent imaging systems, such as syntheticapertureradar(SAR)interferometry. Ageneralformulationforredundant integration of finite differences for phase unwrapping (Costantini et al., 2010) was shown to produce a more reliable solution by exploiting redundant differential estimates. However, this technique requires a commercial linear programming solver for large-scale problems. For a linear cost function, we propose a method based on Dual Decomposition that breaks the given problem defined over a nonplanar graph into tractable sub-problems over planar subgraphs. We also propose a decomposition technique that exploits the underlying graph structure for solving thesub-problemsefficientlyandguaranteesasymptoticconvergencetotheglobally optimal solution. The experimental results demonstrate that the proposed approach is comparable to the existing state-of-the-art methods in terms of the estimate with a better runtime and memory footprint.

Lanka, Ravi↗