Search NASA⌕ Search

SEARCH · Search NASA

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.

756 records · Page 42

Rapid Crossing of a Resonance During Tune Modulation by Synchrotron Oscillations

It had become a standard practice to constrain the particle’s tune footprint while designing the ring lattice so that the particle tunes fit between harmful resonances that limit ring dynamic aperture (DA). This approach, known as “tune confinement”, puts tight limits on the magnitude of the tune shifts with amplitude and with momentum. The latter requires labor-intensive optimization of the off-energy dynamic aperture and control over the corresponding tune footprint for the large energy deviations and is a prerequisite to achieving reasonable lifetime if it is dominated by the Touschek scattering. As nonlinearities of the modern ring lattices are much enhanced as compared with the previous generation of synchrotron light sources, it is becoming more and more difficult to keep the off-momentum tune footprint confined. While one could reach reasonable on-energy DA suitable for injection into the machine, the off-energy DA optimization is much more complex and needs to satisfy more constraints so to reach large energy acceptance and secure decent lifetime at the high ring current. In certain cases when the lattice solution with the confined off-energy tune footprint cannot be found, one may ask whether crossing of a resonance stopband from off-momentum particle will lead to loss of this particle. Intuitively, if the particle crosses the stopband quickly, one may expect that the betatron oscillation amplitude will not increase substantially thereby keeping the particle within the machine acceptance. At the same time the tight tolerances of the modern lattice elements as designed and produced afford much narrower resonance stopbands being compared with the machines built decades ago. Under these circumstances the question above may be asked as what are the conditions for operating a ring with a large chromatic tune footprint, which crosses resonances, while not observing particle losses. In this paper we try to answer the questions above by studying the model of a particle with large initial momentum deviation (as, for example, driven by the Touschek scattering event), which crosses stopband of a half-integer resonance while executing synchrotron oscillations in the highly chromatic ring lattice.

36 MATERIALS SCIENCE↗

Data Locality Enhancement of Dynamic Simulations for Exascale Computing (Final Report)

The development of modern processors exhibits two trends that complicate the optimizations of modern software. The first is the increasing sensitivity of processors' throughput to irregularities in computation. With more processors produced through a massive integration of simple cores, future systems will increasingly favor regular data-level parallel computations, but deviate from the needs of applications with complex patterns. Some evidences are already shown on Graphic Processing Units (GPU): Irregular data accesses (e.g., indirect references A[D[i]]) and conditional branches are limiting many GPU applications' performance at a level an order of magnitude lower than the peak of GPU. The second hardware trend is the growing gap between memory bandwidth and the aggregate speed—that is, the sum of all cores' computing power—of a Chip Multiprocessor (CMP). Despite the capped growth of the peak CPU speed, the aggregate speed of a CMP keeps increasing as more cores get into a single chip. It is expected that by 2018, node concurrency in an exascale system will increase by hundreds of times, whereas, memory bandwidth will expand by only 10 to 20 times. Consequently, data movement and storage is expected to consume more than 70% of the total system power. Bridging this gap is difficult; the complexities of modern CMP memory hierarchy make it even harder: Data cache becomes shared among computing units, and the sharing is often non-uniform—whether two computing units share a cache depends on their proximity and the level of the cache. On the recent IBM Power7 architecture, for instance, four hardware contexts (or SMT threads) in a core share the entire memory hierarchy, all cores in one chip share an on-chip L3 cache, and cores across chips share L3 and main memory through off-chip connections. These two trends complicate the translation of computing power into performance, especially for a program with either intensive data accesses or complex patterns in data accesses or control flow paths. Unfortunately, both attributes present and will persist in a class of important applications. For instance, many scientific simulations deal with a large volume of data. And meanwhile, as most real-world processes are non-uniform and evolving (e.g., the evolution of a galaxy or the process of a drug injection), both the computations and data accesses of these programs tend to be irregular and dynamically changing. Currently, the lack of support to these applications on modern CMP severely limits their performance. On GPU, as our recent study shows and other studies echo, performance enhancement of a factor of integers is possible when memory accesses or control flows are streamlined for a set of GPU applications. On multicore CPU, our studies show that traditional locality enhancement, for being oblivious to the new features of multicore memory hierarchy, may even cause large slowdown to data-intensive dynamic applications. The severity of the issues is expected to worsen as the two hardware trends continue. Some recent studies try to match software with the trends, but in a limited scope or manner. For irregularities on GPU, most studies focus on irregularities analyzable through static analysis (e.g., data accesses in regular loops). Dynamic irregularities are harder to address because the needed analysis and transformations typically have to happen at run time. Some other research resorts to hardware extensions, an actual adoption of which is unclear for the entailed space cost and complexity. For data locality, recent years have seen some exploitations of the new memory hierarchy on multicore for performance, but most of them are on process or thread scheduling, rather than program transformations. Our recent study reveals that program-level transformations may magnify the scheduling benefits by a factor of seven, concluding that program-level transformation should play a central role for data locality enhancement on modern CMP. But research in this direction has been sparse, and most have focused on data layout or cache performance modeling, rather than program transformations to match with the new memory hierarchy features. Overall, it is still an open question how to bridge the gap between dynamic computations and the two prominent properties of modern processors. The goal of this project is to develop a set of techniques and software tools to enhance the matching between memory accesses in dynamic simulations and the prominent features of modern and future CMP, alleviating the memory performance issues for petascale and exascale computing. This report summarizes the discoveries and products produced throughout this project. It includes free launch, a new software approach to overcoming the shortcomings of both methods; coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution; algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Supporting dynamic parallelism is important for GPU to benefit a broad range of applications. There are currently two fundamental ways for programs to exploit dynamic parallelism on GPU: a software-based approach with software-managed worklists, and a hardware-based approach through dynamic subkernel launches. Neither is satisfactory. The former is complicated to program and is often subject to some load imbalance; the latter suffers large runtime overhead. In this work, we propose free launch, a new software approach to overcoming the shortcomings of both methods. It allows programmers to use subkernel launches to express dynamic parallelism. It employs a novel compiler-based code transformation named subkernel launch removal to replace the subkernel launches with the reuse of parent threads. Coupled with an adaptive task assignment mechanism, the transformation reassigns the tasks in the subkernels to the parent threads with a good load balance. The technique requires no hardware extensions, immediately deployable on existing GPUs. It keeps the programming convenience of the subkernel launch-based approach while avoiding its large runtime overhead. Meanwhile, its superior load balancing makes it outperform manual worklist-based techniques by 3X on average. The work was published at the 48th Annual IEEE/ACM International Symposium on Microarchitecture (Micro'2015). A Graphic Processing Unit (GPU) system is typically equipped with many types of memory (e.g., global, constant, texture, shared, cache). Data placement determines what data are placed on which type of memory, essential for GPU memory performance. Prior optimizations of data placement always require a single view of a data object on memory, which limits the optimization effectiveness. In this work, we propose coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution. We demonstrate that under certain conditions, the multiple views can remain incoherent while facilitating enhanced data placement. We present a theorem and some compiler support to ensure the soundness of the usage of coherence-free multiview. We further develop reference-discerning data placement, a new way to enhance data placements on GPU. It enables more flexible data placements by using coherence-free multiview to leverage the slack in coherence requirement of some GPU programs. Experiments on three types of GPU systems show that, with less than 200KB space cost, the new data placement technique can provide a 1.6X average (up to 4.27X) speedup. In addition, we have examined algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Computing distances among data points is an essential part of many important algorithms in data analytics, graph analysis, and other domains. In each of these domains, developers have spent significant manual effort optimizing algorithms, often through novel applications of the triangle equality, in order to minimize the number of distance computations in the algorithms. In this work, we observe that many algorithms across these domains can be generalized as an instance of a generic distance-related abstraction. Based on this abstraction, we derive seven principles for correctly applying the triangular inequality to optimize distance-related algorithms. Guided by the findings, we develop Triangular OPtimizer (TOP), the first software framework that is able to automatically produce optimized algorithms that either matches or outperforms manually designed algorithms for solving distance-related problems. TOP achieves up to 237x speedups and 2.5X on average. The work has been published at the 32nd International Conference on Machine Learning (ICML'15) and the 41st International Conference on Very Large Data Bases (VLDB'15).

42 ENGINEERING↗

Security-Constrained Unit Commitment for Electricity Market: Modeling, Solution Methods, and Future Challenges

This paper summarizes the technical activities of the IEEE Task Force on Solving Large Scale Optimization Problems in Electricity Market and Power System Applications. This Task Force was established by the IEEE Technology and Innovation Subcommittee to first review the state-of-the-art of the security-constrained unit commitment (SCUC) business model, its mathematical formulation, and solution techniques in solving electricity market clearing problems. The Task Force then investigated the emerging challenges of future market clearing problems and presented efforts in building benchmark mathematical and business models.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Probabilistic N - k failure-identification for power systems

This work considers a probabilistic generalization of the N - k failure-identification problem in power transmission networks, where the probability of failure of each component in the network is known a priori and the goal of the problem is to find a set of k components that maximizes disruption to the system loads weighted by the probability of simultaneous failure of the k components. The resulting problem is formulated as a bilevel mixed-integer nonlinear program. Convex relaxations, linear approximations, and heuristics are developed to obtain feasible solutions that are close to the optimum. A general cutting-plane algorithm is proposed to solve the convex relaxation and linear approximations of the N - k problem. Extensive numerical results corroborate the effectiveness of the proposed algorithms on small-, medium-, and large-scale test instances; the test instances include the IEEE 14-bus system, the IEEE single-area and three-area RTS96 systems, the IEEE 118-bus system, the WECC 240-bus test system, the 1354-bus PEGASE system, and the 2383-bus Polish winter-peak test system.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Optimizing ensemble NV − spin properties of fluorescent diamond microparticles by systematic low pressure high temperature annealing

Low pressure high temperature annealing is a means for driving nitrogen and defect diffusion in diamond to reduce internal lattice damage without the need for technically complicated high-pressure cells. Herein, we perform a systematic time (5, 15, and 30 min) and temperature (1200 °C–1800 °C) study of effects of low-pressure high temperature annealing on photoluminescence, spin concentrations, and spin relaxation properties of NV centers in ca. 3 μm synthetic type 1b diamond particles. Annealing in the temperature range of ca. 1400 °C–1700 °C for even 5 min leads to a higher optically detected magnetic resonance contrast as compared to standard annealing at 900 °C for 2 h. Particles annealed at 1700 °C for 5 min exhibit a contrast close to about 13% as compared to about 9% for those annealed at 900 °C for 2 h. A reduction in the zero-field splitting strain parameter from E ≈ 4.5 MHz to ≈ 2.5 MHz and spectral linewidth from Δν ≈ 7 MHz to ≈ 4 MHz are observed even after 5 min annealing at 1700 °C. Improvements in these spectral parameters resulted in a roughly 2-fold reduction in the noise level of temperature monitoring experiment utilizing an ensemble of NV centers in the particles. Annealing in the temperature range of 1600 °C for 15 or 30 min or 1700 °C for 5 min resulted in NV T 1 relaxation times approaching ca. 5 ms typically observed for bulk diamond. Quantitative electron paramagnetic resonance (EPR) allowed for estimations of thermal activation energies of paramagnetic center annihilation. Monitoring the primary defect concentration (P1 and other defects with half integer spins) and utilizing second order kinetic modeling, an activation energy of 3.63 ± 0.28 eV was estimated. Alternatively, using the NV half field EPR signal and first order kinetic modeling, a similar activation energy 3.89 ± 0.29 eV was estimated.

NV centers↗

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↗

General study on the crystal, electronic and band structures, the morphological characterization, and the magnetic properties of the Sr{sub 2}DyRuO{sub 6} complex perovskite

A comprehensive investigation of the general properties of the Sr{sub 2}DyRuO{sub 6} complex perovskite was undertaken. Crystal structure characterization performed by X-ray diffraction measurements and Rietveld analysis allowed establishing that the material crystallizes in a distorted monoclinic perovskite-like structure belonging to the P2{sub 1}/n (#14) space group, with alternating distribution of Dy{sup 3} {sup +} (2c: 0, 0.5, 0) and Ru{sup 5} {sup +} (2d: 0.5, 0, 0). Because of the mismatch in the ionic radii, the DyO{sub 6} and RuO{sub 6} octahedra are forced to tilt around the cubic directions so as to optimize the Sr–O inter-atomic bond lengths. Morphological characterization carried out by scanning electron microscopy indicated a particle size D = 37.17 nm and an activation energy Q = 109.8 kJ/mol. Semi-quantitative compositional study, performed through energy-dispersive X-ray experiments, corroborated that the pure phase of the Sr{sub 2}DyRuO{sub 6} was correctly obtained. Magnetic properties determined from the fit of the Curie–Weiss law to the curves of magnetic susceptibility as a function of temperature showed that Sr{sub 2}DyRuO{sub 6} exhibits an antiferromagnetic-like behavior at low temperatures as a consequence of a magnetic transition at T = 38 K. Data collected with respect to the field dependence of the magnetization showed the existence of a weak ferromagnetic moment relationship with antiferromagnetic-like behavior. Density functional theory allowed establishing the optimum electronic structure for Sr{sub 2}DyRuO{sub 6}, and the study of the density of states showed that Dy{sup 3} {sup +} and Ru{sup 5} {sup +} are responsible for the magnetic character of the compound, with the prediction that at T = 0 K it behaves as a half-metallic material. The spin magnetic moment of the cell is close to 16 μ{sub B}, and the integer number of Bohr magneton is a signature of half-metallic character. Evolution of crystal structure at high temperature revealed that Sr{sub 2}DyRuO{sub 6} does not undergo any structural phase transitions, since the Bragg reflections [hkl] do not undergo changes, and the structure is preserved. - Highlights: • General properties of the Sr{sub 2}DyRuO{sub 6} complex perovskite are widely discussed. • Structural description of octahedral distortions from X-ray diffraction analysis is performed. • Morphological and compositional characteristics are related with the physical properties reported. • Antiferromagnetic response is discussed form experimental results. • Theoretical calculations reveal the possible half-metallic character of material.

36 MATERIALS SCIENCE↗

A Heuristic Approach to the Post-disturbance and Stochastic Pre-disturbance Microgrid Formation Problem

Microgrid formation is a potential solution in post-disaster electric grid recovery efforts. Recent works propose distribution level microgrid formation models using mixed-integer linear programming techniques. However, these models can only be solved for small and medium size power systems due to their computational intractability. In this article we introduce a heuristic approach that allows to approximately solve the post-disturbance microgrid formation problem for medium to large, more realistic, instances. Furthermore, the proposed approach allows to approximately solve the pre-disturbance microgrid formation problem (a stochastic version of the post-disturbance problem), in which the aim is to allocate extra generation capacity to the network to immunize it, as best as possible, against an uncertain cascading failure. Our results are illustrated by solving versions of the problem on ten test cases with up to 3012 buses.

24 POWER TRANSMISSION AND DISTRIBUTION↗

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↗

Designing Metabolic Division of Labor in Microbial Communities

ABSTRACT Microbes face a trade-off between being metabolically independent and relying on neighboring organisms for the supply of some essential metabolites. This balance of conflicting strategies affects microbial community structure and dynamics, with important implications for microbiome research and synthetic ecology. A “gedanken” (thought) experiment to investigate this trade-off would involve monitoring the rise of mutual dependence as the number of metabolic reactions allowed in an organism is increasingly constrained. The expectation is that below a certain number of reactions, no individual organism would be able to grow in isolation and cross-feeding partnerships and division of labor would emerge. We implemented this idealized experiment using in silico genome-scale models. In particular, we used mixed-integer linear programming to identify trade-off solutions in communities of Escherichia coli strains. The strategies that we found revealed a large space of opportunities in nuanced and nonintuitive metabolic division of labor, including, for example, splitting the tricarboxylic acid (TCA) cycle into two separate halves. The systematic computation of possible solutions in division of labor for 1-, 2-, and 3-strain consortia resulted in a rich and complex landscape. This landscape displayed a nonlinear boundary, indicating that the loss of an intracellular reaction was not necessarily compensated for by a single imported metabolite. Different regions in this landscape were associated with specific solutions and patterns of exchanged metabolites. Our approach also predicts the existence of regions in this landscape where independent bacteria are viable but are outcompeted by cross-feeding pairs, providing a possible incentive for the rise of division of labor. IMPORTANCE Understanding how microbes assemble into communities is a fundamental open issue in biology, relevant to human health, metabolic engineering, and environmental sustainability. A possible mechanism for interactions of microbes is through cross-feeding, i.e., the exchange of small molecules. These metabolic exchanges may allow different microbes to specialize in distinct tasks and evolve division of labor. To systematically explore the space of possible strategies for division of labor, we applied advanced optimization algorithms to computational models of cellular metabolism. Specifically, we searched for communities able to survive under constraints (such as a limited number of reactions) that would not be sustainable by individual species. We found that predicted consortia partition metabolic pathways in ways that would be difficult to identify manually, possibly providing a competitive advantage over individual organisms. In addition to helping understand diversity in natural microbial communities, our approach could assist in the design of synthetic consortia.

59 BASIC BIOLOGICAL SCIENCES↗

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 influence of interfaces on properties of thin-film inorganic structural isomers containing SnSe—NbSe₂ Subunits

Inorganic isomers ([SnSe] 1+δ ) m (NbSe₂) n ([SnSe] 1+δ ) p (NbSe₂) q ([SnSe] 1+δ ) r (NbSe₂) s where m , n , p , q , r , and s are integers and m + p + r = n + q + s = 4 were prepared using the modulated elemental reactant technique. This series of all six possible isomers provides an opportunity to study the influence of interface density on properties while maintaining the same unit cell size and composition. As expected, all six compounds were observed to have the same atomic compositions and an almost c-axis lattice parameter of ≈4.90 (5) nm, with a slight trend in the c-axis lattice parameter correlated with the different number of interfaces in the isomers: two, four and six. The structures of the constituents in the ab-plane were independent of one another, confirming the nonepitaxial relationship between them. The temperature dependent electrical resistivities revealed metallic behavior for all the six compounds. Surprisingly, the electrical resistivity at room temperature decreases with increasing number of interfaces. Hall measurements suggest this results from changes in carrier concentration, which increases with increasing thickness of the thickest SnSe block in the isomer. Carrier mobility scales with the thickness of the thickest NbSe₂ block due to increased interfacial scattering as the NbSe₂ blocks become thinner. The observed behavior suggests that the two constituents serve different purposes with respect to electrical transport. SnSe acts as a charge donor and NbSe₂ acts as the charge transport layer. This separation of function suggests that such heterostructures can be designed to optimize performance through choice of constituent, layer thickness, and layer sequence. A simplistic model, which predicts the properties of the complex isomers from a weighted sum of the properties of building blocks, was developed. A theoretical model is needed to predict the optimal compound for specific properties among the many potential compounds that can be prepared.

Alemayehu, Matti B.↗

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↗

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↗

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↗