Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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.

515 records · Page 29

Electric vehicle fast charging infrastructure planning in urban networks considering daily travel and charging behavior

Electric vehicles are a sustainable substitution to conventional vehicles. This work introduces an integrated framework for urban fast charging infrastructure to address the range anxiety issue. A mesoscopic simulation tool is developed to generate trip trajectories, and simulate charging behavior based on various trip attributes. The resulting charging demand is the key input to a mixed-integer nonlinear program that seeks charging station configuration. The model minimizes the total system cost including charging station and charger installation costs, and charging, queuing, and detouring delays. The problem is solved using a decomposition technique incorporating a commercial solver for small networks, and a heuristic algorithm for large-scale networks, in addition to the Golden Section method. The solution quality and significant superiority in the computational efficiency of the decomposition approach are confirmed in comparison with the implicit enumeration approach. Furthermore, the required infrastructure to support urban trips is explored for future market shares and technologies.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Nth-plant scenario for forest resources and short rotation woody crops: Biorefineries and depots in the contiguous US

Estimating the US potential of woody material is of vital importance to ensure cost-effective supply logistics and develop a sustainable bioenergy and bioproducts industry. We analyzed a mature conversion technology for woody resources for the contiguous US that takes advantage of economies of scale: the nth-plant. Here, we developed a database to quantify the total accessible woody biomass within a distributed network of preprocessing depots and biorefineries considering both quality specifications for conversion and a target cost to compete with fossil fuels. We considered two categories of woody biomass: 1) forest residues from trees, tops and limbs produced from conventional thinning and timber harvesting operations as well as non-timber tree removal; and 2) short rotation woody crops such as poplar, willow, pine, and eucalyptus. A mixed integer linear programming model was developed to analyze scenarios with woody feedstock blends at variable biomass ash contents and cost targets at the biorefinery. When considering a target cost of 85.51 dollars/dry ton (2016$) at the biorefinery, the maximum accessible biomass from forest residues in 2040 remained constant at 106 million dry tons regardless of ash targets. Including short rotation woody crops as part of the blend increased the total accessible biomass to 153 and 195 million dry tons at ash targets of 1% and 1.75%, respectively. We concluded from our analysis that woody resources could address about 55% of EPA’s (Environmental Protection Agency) target of 16 billion gallons of cellulosic biofuel.

09 BIOMASS FUELS↗

Benders Cut Classification via Support Vector Machines for Solving Two-Stage Stochastic Programs

In this work, we consider Benders decomposition for solving two-stage stochastic programs with complete recourse based on finite samples of the uncertain parameters. We define the Benders cuts binding at the final optimal solution or the ones significantly improving bounds over iterations as valuable cuts. We propose a learning-enhanced Benders decomposition (LearnBD) algorithm, which adds a cut classification step in each iteration to selectively generate cuts that are more likely to be valuable cuts. The LearnBD algorithm includes two phases: (i) sampling cuts and collecting information from training problems and (ii) solving testing problems with a support vector machine (SVM) cut classifier. We run the LearnBD algorithm on instances of capacitated facility location and multicommodity network design under uncertain demand. Our results show that SVM cut classifier works effectively for identifying valuable cuts, and the LearnBD algorithm reduces the total solving time of all instances for different problems with various sizes and complexities.

97 MATHEMATICS AND COMPUTING↗

Stochastic Unit Commitment: Model Reduction via Learning

As weather-dependent renewable generation increases its share in the generation mix of most electric energy systems, a stochastic unit commitment becomes the natural day-ahead scheduling tool. However, such a tool is generally computationally intractable if a detailed uncertainty description is considered. Taking this into account, we proposed a learning method to make the stochastic unit commitment problem tractable. Here, recent advances in statistical learning and machine learning to address optimization problems can be advantageously applied to the rather intractable stochastic unit commitment problem. Considering these advances, we explore simple learning techniques to drastically reduce the size of a stochastic unit commitment problem without significantly altering its optimal solution. The considered stochastic unit commitment problem is formulated as a two-stage stochastic programming problem. The first stage represents commitment decisions, while the second one represents the operation conditions under different scenarios. Taking into account historical solved instances (or proxies for them), we reduce the size (measured by numbers of constraints and variables) of the stochastic unit commitment problem by (i) fixing unchanged binary variables and by (ii) eliminating inactive inequality constraints. Our numerical results show that the reduced problem generally requires significantly less time to solve while obtaining high-quality solutions, which are very close to or indistinguishable from the one obtained by solving the original problem. We use an Illinois 200-bus system to illustrate and characterize the performance of the proposed problem-reduction method.

42 ENGINEERING↗

Control-Oriented Modeling of Lithium-Ion Batteries

Battery management systems (BMSs), which monitor and optimize performance while ensuring safety, require control-oriented models, i.e., models tailored to the design and implementation of estimation and control algorithms. Physics-based electrochemical models describe detailed battery phenomena, but are too computationally intensive for use in estimation and control applications. Single particle models (SPMs), which retain some of the physics of electrochemical models, are often used for control-oriented battery modeling since they are computationally efficient; however, they are only valid over very low frequency ranges and C-rates. Empirical equivalent circuit models (ECMs) are also used for control-oriented battery modeling since they are computationally efficient and can describe battery behavior over wide frequency ranges; however, they provide no physical understanding of the battery and, therefore, have limited applicability. Further, fractional order terms (e.g., Warburg impedances) are often employed, making the models unwieldy for use in the time domain. This work provides a control-oriented battery model that combines the benefits of SPM and ECM models, while overcoming their limitations. The proposed model incorporates some of the battery physics found in electrochemical models, can easily be used in both the time and frequency domains, and describes battery behavior over its entire frequency range. A linearized single particle model, which incorporates key electrochemical parameters, is used for modeling battery physics at very low frequencies. For low frequencies, integer-order linear systems are used to approximate diffusion physics described by Warburg impedances, and high frequency behavior is modeled by the double layer capacitance effect. The proposed battery model is more computationally efficient than full electrochemical models since it does not require the solution of PDEs, is accurate for a wider frequency range than the SPM considered in this paper, and does not suffer from the unwieldiness and limited applicability of empirical ECMs. Finally, the model is validated in the time and frequency domains via a comparison to pseudo-two-dimensional (P2D) model simulations and experimental data.

25 ENERGY STORAGE↗

The value of concentrating solar power in ancillary services markets

Ancillary services, such as spinning reserves, can provide grid reliability and contribute to profitability of an energy resource. We exercise an existing dispatch optimization model to estimate the profitability of a concentrating solar power plant by incorporating the sale of spinning reserves in the ancillary service market using the National Renewable Energy Laboratory's System Advisor Model to simulate operations within a 72-h rolling horizon framework. Assuming a price-taker approach with day-ahead energy and spinning reserve prices from both the California Independent System Operator and the Electricity Reliability Council of Texas, we find that selling spinning reserves in addition to electric energy increases plant profitability by up to 7% with perfect knowledge of day-ahead pricing and solar resource availability. Here, this finding suggests that spinning reserve markets provide significant value streams to concentrating solar power plants that can leverage thermal energy storage to offer reliable production in the short-to-medium term.

14 SOLAR ENERGY↗

Dependence of the Element Patterns of HYDROSTAR on Mutual Coupling

HYDROSTAR is a hybrid synthesis radiometer, intended for spaceborne applications, which employs a real aperture (waveguide stick antenna) for resolution along track and employs aperture synthesis to obtain resolution across track. This L-band system is an extension of the successful aircraft prototype, the Electronically Steered Thinned Array Radiometer (ESTAR). A proof-of-concept, full size system was constructed (45 wavelength in the synthesis direction) and subjected to extensive antenna pattern and associated microwave component measurements in an outdoor antenna test facility. HYDROSTAR employs a thinned array of 16 elements each 5.8 inches long in the along track dimension and spanning 9.5 inches across track. Each element is a narrow-wall shunt slot array with 36 slots. The polarization is linear (along-track). In the across track dimension, the antennas are deployed in a minimum redundancy array which has 90 independent baselines spaced in integer multiples of half a wavelength. The closest spacings used are for the first three elements at each end, which are spaced by only one-half wavelength. This study was intended to assess how closely each of 16 stick element patterns compare with their nominal values (as an individual, isolated radiator), when installed in their intended composite thinned array configuration. Extensive pattern measurements of the 16 elements that constitute the HYDROSTAR antenna subsystem were conducted to observe their relative features along the synthesis plane. Data was also collected for the mutual coupling between pairs of selected antennas. All antenna patterns had features different from that of an isolated element indicating some level of interaction among neighboring radiators. Those elements which had nearest neighbors at least five wavelengths away were located near the middle of the array. Their radiation patterns displayed sonic small, symmetric ripple across their full azimuth range. The patterns of elements that lie within 2.5 wavelengths of their neighbors showed stronger and asymmetric features. These are believed to be caused by mutual coupling among these structures. Evidence for this was seen when an antenna position was displaced by 0.05 wavelengths, Its pattern and those of its near neighbors were seen to change. Displacement within the plane of the array were observed to have different effects than displacements out-of-plane. A program of data analysis and theoretical development is in progress to provide a physical interpretation of the properties of these antenna patterns and to develop methods which can optimize the performance of this synthetic aperture imaging system. This includes compensation for pattern asymmetries and element position perturbation.

Weissman, David E.↗

A Decomposition-Based Learn-To-Optimize Approach with Feasibility Layer Assistance for Sub-Hourly Unit Commitment

Sub-hourly unit commitment (UC) with 15-min intervals is gaining significant attention as a way to respond rapidly to the fluctuations in electricity supply and demand introduced by renewable resources. However, the increased temporal resolution and complex inter-temporal dependencies pose substantial computational challenges for traditional optimization methods. To this end, this paper explores a decomposition-based learn-to-optimize approach. Building on recent advances in machine learning, our method revisits the long- overlooked Lagrangian relaxation framework, which is a classical decomposition technique that enables tractable subproblem solving. These smaller subproblems are inherently well-suited for machine learning, as their reduced dimensionality and structural regularity allow predictive models to efficiently learn and generalize solution patterns. We thus propose a generic predictive model, which embeds Gated Recurrent Units (GRUs) and Attention in the encoder-decoder structure, and integrate a rule-based feasibility layer to capture temporal dependencies, reduce training effort, and improve feasibility w.r.t. unit-level constraints. Our method has been validated on the IEEE 118-bus system, demonstrating promising performance in solving sub-hourly UC problems efficiently and feasibly.

97 MATHEMATICS AND COMPUTING↗

Nth-plant scenario for blended pellets of Miscanthus, Switchgrass, and Corn Stover using multi-modal transportation: Biorefineries and depots in the contiguous U.S.

The sustainability of the biofuel industry depends on the development of a mature conversion technology on a national level that can take advantage of the economies of scale: the nth-plant. Here, this study addresses the logistic challenge of mobilizing national cellulosic feedstock supplies for a sustainable bioenergy industry. A Mixed Integer Linear Programming (MILP) model was developed and updated to deliver on-spec biomass that considers both a desired quantity and quality at the biorefinery. Our supply chain analysis includes multi-modal transport (truck and rail), varying depot and biorefinery sizes, and feedstock blends of corn stover (harvested by either a two- or three-pass method), switchgrass, and miscanthus. The following US states: Illinois, Kansas, Missouri, North Carolina, Oklahoma, Georgia, and Texas were identified as key locations for producing accessible miscanthus. Based on our most optimistic scenario, using trucks as the only transportation mode in 2040 with a cost target of $\$$79/dt, corn stover, switchgrass, and miscanthus could help meet 48% of the EPA target, 173 million dry tons that translate into 7.8 billion GGE. The addition of rail transportation for biomass delivery to biorefineries could help meet 79% of the EPA target, 283 million dry tons that translate into 12.7 billion GGE.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Localization of Ad-Hoc Lunar Constellations in Communication Failure Modes for Distributed Spacecraft Autonomy

As lunar missions increase in complexity inspired by NASA’s Artemis Program, they will require reliable and sufficient capability of the Position, Navigation, and Timing (PNT) system to support their scientific objectives. In addition, NASA's Commercial Lunar Payload Services (CLPS) program initiates the proliferation of public and private exploration partnerships using small satellites from commercial and private organizations, expanding traditionally confined low Earth orbit to be used for missions beyond geosynchronous orbit (Zucherman et al., 2022). Therefore, the Lunar PNT system is also required to provide navigation services compatible with the smaller platforms being sent by the public and private sectors, like CubeSats. However, traditional approaches to deep space missions’ navigation based on ground radio facilities have difficulties in providing sufficient support for the increasing number of users and communication at a distance from the Earth (Kaplev et al., 2022). In particular, the existing Lunar navigation technologies such as weak signal global positioning system (GPS) and deep space network (DSN) are not able to ensure operations of the upcoming small-scale Lunar missions due to their limitations in localization performance as well as capacity aspects. Another way to provide Lunar PNT service is to create a dedicated Lunar global navigation satellite system (GNSS) constellation, like GNSS systems on Earth. Space agencies like NASA, ESA, and JAXA are now developing the lunar communications relay and navigation systems (LCRNS) and Lunar navigation satellite systems (LNSS). In their systems, satellites will be deployed in moon orbits to provide the communication, positioning, navigation, and timing (CPNT) service at the lunar south pole region where the Artemis base camp will be expected (Murata et al., 2022). Meanwhile, common challenges considered in lunar PNT research arise from poor geometry of the terrestrial GNSS satellites when seen from the lunar user, highly perturbed lunar orbits, and limitations in power, size, and cost of the equipment on lunar satellites (Iiyama et al., 2023). It is also not clear if there will be enough Lunar users to support the cost and resources this would require as the Low-cost surface missions may not be able to support the large power, mass, and weight requirements that these navigation solutions entail (Niemoeller et al., 2022). As an alternative, existing Lunar science and exploration assets could be used to create a low-cost, autonomous, ad-hoc, and on-demand mission-centric Lunar PNT swarm capable of providing PNT services to these low-cost lunar missions (Hagenau et al., 2021). Introducing the non-dedicated and ad-hoc Lunar navigation constellation gives a way to provide PNT services on-demand. The non-dedicated swarm assets of Lunar constellations are designed to localize themselves with minimal interaction with Earth by adding cooperative autonomous localization to lunar missions, freeing up valuable bandwidth and ground segment resources. An autonomous localization of Lunar constellations is based on the concept of the decentralized PNT system with a distributed extended Kalman filter (DEKF) approach to state estimation for minimal onboard operating costs. In the distributed data processing algorithm, computation is broken down and assigned to each satellite, resulting in a considerably decreased computational amount while maintaining the accuracy of the orbit ephemeris and clock offsets as the result of centralized data processing (Wen et al., 2019). The DEKF requires spacecraft to perform two-way ranging operations with each other to communicate simultaneously, leveraging neighbor two-way intersatellite link (ISL) measurements such as pseudoranges to, and relative velocities between, visible satellites as sensor values (Frank et al., 2021). The Lunar autonomous PNT simulation (LAPS) demonstrated the feasibility of orbital asset localization among ad-hoc Lunar small-sat constellations based on the DEKF in Hagenau et al. (2021) and evaluated the matching algorithm proposed by Frank et al. (2021) in scheduling position estimation updates. In previous papers, all assets and measurements are assumed to be always available without consideration of the impact of intermittent and permanent communication failure. This study presents localization performance with increasing levels of network degradation for swarm assets and users to demonstrate the robustness of the decentralized Lunar PNT service in more realistic scenarios. Main issues arising from communication failure include spacecraft permanent or transient loss, antenna failures, message delays, etc. We tested four possible reasons for network degradation for 7 days in 21 satellites frozen with an altitude of 5500 km, evenly spaced around 3 circular, 40 inclination orbital planes where each spacecraft has two directional antennas. As anchor nodes with an independent estimate of their position are required in the DEKF approach, two ground nodes in each pole and one node in the gateway were implemented in the simulation. First, the most probable failure scenario involves the loss of a single spacecraft due to solar interference and technical malfunctions of the assets. Losing the availability of a single spacecraft means losing the two-way ISL measurement of the asset in the DEKF update. In order to provide the best possible quality of PNT service with limited time and resources, the distributed Lunar constellations must schedule the communication activities. The scheduler leverages mixed-integer linear programming (MILP) for the coordination and scheduling of the desired “as-needed” localization service (Niemoeller et al., 2022). We assume the scheduler has completely excluded the spacecraft information before the DEKF update in the failure scenario. When a random spacecraft has been turned off at a specific time, the robustness of the autonomous Lunar PNT system is evaluated. The simulation results give an 11.5% degradation in median position accuracy compared to the idealized performance excluding the asset loss. Second, a large number of assets may vanish due to major hardware problems or meteor strikes around the moon. A multiple spacecraft loss can degrade the localization performance very fast by losing the communication ability to do cross-plane measurements and in-plane measurements in a 3-plane constellation. When the matching-based scheduler is aware of ISL availability, we investigate a large number of in-plane and cross-plane asset vanishments both in close proximity and equally spaced throughout the orbital plane. According to the simulations, the loss of in-plane measurements gives 40.2% degradation while cross-plane measurements degrade 50.5% of asset localization performance among available assets. Therefore, it is concluded that cross-plane measurements are more important in improving the position estimation accuracy. Third, spacecraft failure information can be lost due to the internal message delay, resulting in the DEKF update scheduler to solve the matching problem with unavailable assets. The DEKF update cycle is comprised of network setup, communication, and computations where a global broadcast network and a 2-way ISL network setup take 6 minutes in total (Frank et al., 2021). Once the broadcast network successfully transmits and receives information, a random spacecraft may lose its availability right before solving the matching problem. This means the matching solution is no longer optimal, resulting in degradation in the localization performance. A numerical assessment shows the matching-based scheduler with knowing failure holds 11.5% of position accuracy degradation, whereas the scheduler without knowing failure gives 34% degraded localization performance without asset loss. Fourth, a transient loss of a single or multiple spacecraft may occur due to their antenna outages. After losing the two-way ISL availability for a few DEKF update cycles, the availability of spacecraft can easily be recovered as their states have been independently updated using measurements from anchor nodes. It is likely that the longer failure will result in worse localization performance. We have tested the transient failure of a random single asset for 30 min in the simulation, which is losing 3 update cycles in the DEKF system. From the simulation results, the position accuracy has been degraded to 4.84% which is better than the degraded localization performance of 11.5% from the permanent loss scenario among available assets. In conclusion, the autonomous Lunar PNT system based on the DEKF approach shows the ability to maintain resilience and robustness in the possible communication failure scenarios, ensuring that localization accuracy is preserved across various network degradation and outages. Future studies on investigating user localization performance near the South Pole and the broadcast network system will be continued in the following months.

Yeji Kim↗

Building Load Control Using Distributionally Robust Chance-Constrained Programs with Right-Hand Side Uncertainty and the Risk-Adjustable Variants

Aggregation of heating, ventilation, and air conditioning (HVAC) loads can provide reserves to absorb volatile renewable energy, especially solar photo-voltaic (PV) generation. In this paper, we decide HVAC control schedules under uncertain PV generation, using a distributionally robust chance-constrained (DRCC) building load control model under two typical ambiguity sets: the moment-based and Wasserstein ambiguity sets. We derive mixed integer linear programming (MILP) reformulations for DRCC problems under both sets. Especially, for the Wasserstein ambiguity set, we use the right-hand side (RHS) uncertainty to derive a more compact MILP reformulation than the commonly known MILP reformulations with big-M constants. All the results also apply to general individual chance constraints with RHS uncertainty. Furthermore, we propose an adjustable chance-constrained variant to achieve tradeoff between the operational risk and costs. We derive MILP reformulations under the Wasserstein ambiguity set and second-order conic programming (SOCP) reformulations under the moment-based set. Using real-world data, we conduct computational studies to demonstrate the efficiency of the solution approaches and the effectiveness of the solutions. Summary of Contribution: The problem studied in this paper is motivated by a building load control problem that uses the aggregation of heating, ventilation, and air conditioning (HVAC) loads as flexible reserves to absorb uncertain solar photovoltaic (PV) generation. The problem is formulated as distributionally robust chance-constrained (DRCC) programs with right-hand side (RHS) uncertainty. In addition, we propose a risk-adjustable variant of the DRCC programs, where the risk level, instead of being predetermined, is treated as a decision variable. The paper aims to provide tractable reformulations and solution algorithms for both the (general) DRCC and the (general) adjustable DRCC models with RHS uncertainty.

97 MATHEMATICS AND COMPUTING↗