Search NASA⌕ Search

SEARCH · Search NASA

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

At least 1,333 records · Page 74

Combining On-Line Characterization Tools with Modern Software Environments for Optimal Operation of Polymerization Processes

Here, this paper discusses the initial steps towards the formulation and implementation of a generic and flexible model centric framework for integrated simulation, estimation, optimization and feedback control of polymerization processes. For the first time it combines the powerful capabilities of the automatic continuous on-line monitoring of polymerization system (ACOMP), with a modern simulation, estimation and optimization software environment towards an integrated scheme for the optimal operation of polymeric processes. An initial validation of the framework was performed for modelling and optimization using literature data, illustrating the flexibility of the method to apply under different systems and conditions. Subsequently, off-line capabilities of the system were fully tested experimentally for model validations, parameter estimation and process optimization using ACOMP data. Experimental results are provided for free radical solution polymerization of methyl methacrylate.

42 ENGINEERING↗

Fuel Efficient Speed Optimization for Real-World Highway Cruising

This paper introduces an eco-driving highway cruising algorithm based on optimal control theory that is applied to a conventionally-powered connected and automated vehicle. Thanks to connectivity to the cloud and/or to infrastructure, speed limit and slope along the future route can be known with accuracy. This can in turn be used to compute the control variable trajectory that will minimize energy consumption without significantly impacting travel time. Automated driving is necessary to the implementation of this concept, because the chosen control variables (e.g., torque and gear) impact vehicle speed. An optimal control problem is built up where quadratic models are used for the powertrain. The optimization is solved by applying Pontryagin’s minimum principle, which reduces the problem to the minimization of a cost function with parameters called co-states. The proposed algorithm assumes piecewise constant slopes and speed limits, and it solves the transition vehicle speeds for each junction of such segments. In addition, a method to extract route information from digital maps is presented, which complies with the proposed optimization algorithm. The algorithms are evaluated in simulation, using Autonomie, a simulation tool for vehicle energy consumption modeling. The optimal control trajectory (e.g., torque, gear) is first computed offline. It is then applied in an open-loop fashion in online simulation, using a forward-looking model of the vehicle in Autonomie. Simulation results show over 8% fuel saving for two selected real-world routes.

Simulation and modeling, Optimization, Vehicle net↗

Land-based wind turbines with flexible rail-transportable blades – Part 2: 3D finite element design optimization of the rotor blades

Abstract. Increasing growth in land-based wind turbine blades to enable higher machine capacities and capacity factors is creating challenges in design, manufacturing, logistics, and operation. Enabling further blade growth will require technology innovation. An emerging solution to overcome logistics constraints is to segment the blades spanwise and chordwise, which is effective, but the additional field-assembled joints result in added mass and loads, as well as increased reliability concerns in operation. An alternative to this methodology is to design slender flexible blades that can be shipped on rail lines by flexing during transport. However, the increased flexibility is challenging to accommodate with a typical glass-fiber, upwind design. In a two-part paper series, several design options are evaluated to enable slender flexible blades: downwind machines, optimized carbon fiber, and active aerodynamic controls. Part 1 presents the system-level optimization of the rotor variants as compared to conventional and segmented baselines, with a low-fidelity representation of the blades. The present work, Part 2, supplements the system-level optimization in Part 1 with high-fidelity blade structural optimization to ensure that the designs are at feasible optima with respect to material strength and fatigue limits, as well as global stability and structural dynamics constraints. To accommodate the requirements of the design process, a new version of the Numerical Manufacturing And Design (NuMAD) code has been developed and released. The code now supports laminate-level blade optimization and an interface to the International Energy Agency Wind Task 37 blade ontology. Transporting long, flexible blades via controlled flapwise bending is found to be a viable approach for blades of up to 100 m. The results confirm that blade mass can be substantially reduced by going either to a downwind design or to a highly coned and tilted upwind design. A discussion of active and inactive constraints consisting of material rupture, fatigue damage, buckling, deflection, and resonant frequencies is presented. An analysis of driving load cases revealed that the downwind designs are dominated by loads from sudden, abrupt events like gusts rather than fatigue. Finally, an analysis of carbon fiber spar caps for downwind machines finds that, compared to typical carbon fibers, the use of a new heavy-tow carbon fiber in the spar caps is found to yield between 9 % and 13 % cost savings.

17 WIND ENERGY↗

Performance Optimization and Auto-Tuning

In the broader computational research community, one subject of recent research is the problem of adapting algorithms to make effective use of multi- and many-core processors. Effective use of these architectures, which have complex memory hierarchies with many layers of cache, typically involves a careful examination of how an algorithm moves data through the memory hierarchy. Unfortunately, there is often a non-obvious relationship between algorithmic parameters like blocking strategies, and their impact on memory utilization, and, in turn, the relationship with runtime performance. Auto-tuning is an empirical method used to discover optimal values for tunable algorithmic parameters under such circumstances. The challenge is compounded by the fact that the settings that produce the best performance for a given problem and a given platform may not be the best for a different problem on the same platform, or the same problem on a different platform. The high performance visualization research community has begun to explore and adapt the principles of auto-tuning for the purpose of optimizing codes on modern multi- and many-core processors. This report focuses on how performance optimization studies reveal a dramatic variation in performance for two fundamental visualization algorithms: one based on a stencil operation having structured, uniform memory access, and the other is ray casting volume rendering, which uses unstructured memory access patterns. The two case studies highlighted in this report show the extra effort required to optimize such codes by adjusting the tunable algorithmic parameters can return substantial gains in performance. Additionally, these case studies also explore the potential impact of and the interaction between algorithmic optimizations and tunable algorithmic parameters, along with the potential performance gains resulting from leveraging architecture-specific features.

97 MATHEMATICS AND COMPUTING↗

Galerkin v. discrete-optimal projection in nonlinear model reduction

Discrete-optimal model-reduction techniques such as the Gauss{Newton with Approximated Tensors (GNAT) method have shown promise, as they have generated stable, accurate solutions for large-scale turbulent, compressible ow problems where standard Galerkin techniques have failed. However, there has been limited comparative analysis of the two approaches. This is due in part to difficulties arising from the fact that Galerkin techniques perform projection at the time-continuous level, while discrete-optimal techniques do so at the time-discrete level. This work provides a detailed theoretical and experimental comparison of the two techniques for two common classes of time integrators: linear multistep schemes and Runge{Kutta schemes. We present a number of new ndings, including conditions under which the discrete-optimal ROM has a time-continuous representation, conditions under which the two techniques are equivalent, and time-discrete error bounds for the two approaches. Perhaps most surprisingly, we demonstrate both theoretically and experimentally that decreasing the time step does not necessarily decrease the error for the discrete-optimal ROM; instead, the time step should be `matched' to the spectral content of the reduced basis. In numerical experiments carried out on a turbulent compressible- ow problem with over one million unknowns, we show that increasing the time step to an intermediate value decreases both the error and the simulation time of the discrete-optimal reduced-order model by an order of magnitude.

CFD↗

Optimal Operation and Dispatch of Voltage Regulation Devices Considering High Penetrations of Distributed Photovoltaic Generation

Voltage regulation devices have been traditionally installed and utilized to support distribution voltages. Installations of distributed energy resources (DERs) in distribution systems are rapidly increasing, and many of these generation resources have variable and uncertain power output. These generators can significantly change the voltage profile for a feeder; therefore, in the distribution system planning stage of the optimal operation and dispatch of voltage regulation devices, possible high penetrations of DERs should be considered. In this paper, we model the IEEE 34-bus test feeder, including all essential equipment. An optimization method is adopted to determine the optimal siting and operation of the voltage regulation devices in the presence of distributed solar power generation. Finally, we verify the optimal configuration of the entire system through the optimization and simulation results.

14 SOLAR ENERGY↗

Optimal Operation of a Hybrid Hydraulic Electric Architecture (HHEA) for Off-Road Vehicles Over Discrete Operating Decisions

Many off-highway machines including construction and agriculture equipment use hydraulics for power transmission and throttling as a means for control. Trends towards better efficiency and electrification have led to the creation of a novel Hybrid Hydraulic-Electric Architecture (HHEA) which could significantly reduce energy consumption and maintain control performance, even in machines that are too large to be directly electrified. This is achieved by using a set of common pressure rails to transmit the majority of power via power dense hydraulics and modulating the power with small electric motor-drives to achieve precise control. This paper proposes a computationally efficient method for computing the optimal sequence of pressure rail selections for the HHEA over finite drive cycles. This is useful for fairly comparing the novel architecture’s energy performance to existing architectures and for use in iterative optimal design of the architecture. The optimal control technique makes use of a static model of the architecture and losses. Constraints are enforced such that the drive cycle is repeatable. The constrained optimal operation is solved using a Lagrange multiplier technique that transforms the optimization into a small set of sub-problems by considering combinations of active constraints. Each of these sub-problems can be solved efficiently because loss calculations for all time steps can be computed in parallel. A case study of an off-road construction machine demon-strates that the HHEA reduces energy consumption by 2/3 compared to the baseline load sensing architecture.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

OPTIMAL CONTROL AND ENERGY-SAVING ANALYSIS OF COMMON PRESSURE RAIL ARCHITECTURES: HHEA & STEAM

In recent years several novel hydraulic architectures have been proposed with the intention of significantly increasing system efficiency. Two of these architectures, Steigerung der Energieeffizienz in der Arbeitshydraulik mobiler Arbeitsmaschinen (STEAM), and the Hybrid Hydraulic-Electric Architecture (HHEA), use a system of multiple common pressure rails (CPRs) to serve the multiple degrees-of-freedom of the machine. The key difference is that STEAM throttles hydraulic power from these rails while HHEA combines electric and hydraulic power to meet actuator demands. As a throttle-less architecture, HHEA is expected to save more energy than STEAM at the expense of added complexity. Therefore, it is useful to quantify this additional energy saving. Both systems have discrete operational choices corresponding to how the CPRs are utilized for each actuator. It is necessary to determine optimal operation for each of these architectures for analysis and fair comparison. Techniques for optimal operation of the HHEA have been developed previously from the Langrange multiplier method. Applying the same optimal control method to STEAM encountered some technical challenge leading to the optimal control algorithm not being able to satisfy certain constraints. The issue is analyzed and solved by adding noise to the optimization. Using this proposed algorithm, case studies are performed to compare the energy-saving potentials of STEAM and HHEA for two sizes of excavators and a wheel-loader performing representative duty cycles. The baseline is a standard load-sensing architecture. Results show that STEAM and HHEA can reduce energy consumption between 35-65% and 50-80% respectively

24 POWER TRANSMISSION AND DISTRIBUTION↗

Total variation vs L1 regularization: a comparison of compressive sensing optimization methods for chemical detection

One of the fundamental assumptions of compressive sensing (CS) is that a signal can be reconstructed from a small number of samples by solving an optimization problem with the appropriate regularization term. Two standard regularization terms are the L1 norm and the total variation (TV) norm. We present a comparison of CS reconstruction results based on these two approaches in the context of chemical detection, and we demonstrate that optimization based on the L1 norm outperforms optimization based on the TV norm. Our comparison is driven by CS sampling, reconstruction, and chemical detection in two real-world datasets: the Physical Sciences Inc. Fabry-Perot interferometer sensor multispectral dataset and the Johns Hopkins Applied Physics Lab FTIR-based longwave infrared sensor hyperspectral dataset. Both datasets contain the release of a chemical simulant such as glacial acetic acid, triethyl phosphate, and sulfur hexafluoride. For chemical detection we use the adaptive coherence estimator (ACE) and bulk coherence, and we propose algorithmic ACE thresholds to define the presence or absence of a chemical of interest in both un-compressed data cubes and reconstructed data cubes. The un-compressed data cubes provide an approximate ground truth. We demonstrate that optimization based on either the L1 norm or TV norm results in successful chemical detection at a compression rate of 90%, but we show that L1 optimization is preferable. We present quantitative comparisons of chemical detection on reconstructions from the two methods, with an emphasis on the number of pixels with an ACE value above the threshold.

Hyperspectral imagery, L1-norm, total variation, A↗

Real-Time Distributed Control of Smart Inverters for Network-level Optimization

The limitations of centralized optimization methods in managing electric power distribution systems operations have led to the distributed paradigm of computing and decision-making. Unfortunately, the existing distributed optimization algorithms are limited in their applicability to managing fast varying phenomena such as those resulting from highly variable Distributed Energy Resource (DER) generation patterns. They require a large number of communication rounds (in the order of 10 2 to 10 3 ) among the computing agents to solve one instance of the optimization problem. Related real-time distributed control methods are equally limited in their applications to power distribution systems with fast-changing DER generation; they require hundreds of rounds of communication and thus are slow in tracking the network-level optimal solutions. In this paper, we propose a novel distributed voltage controller that provides a fast-tracking of rapidly varying DER generation profiles while simultaneously converging to network-level optimal solutions within a few communication rounds. The proposed control algorithm leverages the radial topology of the system, which reduces the required communication rounds to reach the network-level optimum solution by order of magnitude. The novelty lies in carefully reducing the electrical network model from the perspective of each distributed controller and enabling appropriate data sharing among upstream and downstream nodes to achieve fast convergence. The simulation results demonstrate the effectiveness of the proposed approach in minimizing the feeder losses while maintaining the node voltage within the pre-specified limits.

voltage control, optimization, reactive power, inv↗

Optimization of Energy Storage System Economics and Controls by Incorporating Battery Degradation Costs in REopt

The use of stationary electrochemical energy storage systems utilizing lithium-ion batteries has increased rapidly as the production scale and price for lithium-ion batteries has decreased. These energy storage systems are crucial for maintaining grid resiliency, especially for grids operating with high penetration of renewable energy generation assets or for with a variety of distributed energy generation and storage systems. One challenging factor for the development of battery energy storage systems is estimating the proper sizing, in terms of both power and energy, that minimizes total costs over the lifetime of the systems; this calculation is difficult in simple cases, where a battery is costed independently, but is extremely challenging when building loads and electrical generation by photovoltaic resources are also considered. REopt is a techoeconomic optimization tool developed by NREL to address these challenges. Previously, battery degradation has been priced by simply assuming a 10-year replacement schedule for battery systems. However, this does not account for varying degradation trends observed across real-world batteries, or allow for batteries to be operated in a degradation-aware manner that optimizes battery dispatch based on operating costs. This work incorporates a battery life model into REopt. This battery life model is simple, so that it may be solvable within the constrains of a mixed-integer linear optimization problem, but is fit to accelerated aging data recorded in the lab. To achieve the best possible accuracy for lifetime estimates given these constraints, parameters for the battery life model in REopt are estimated by fitting 20-year simulations of battery life after identifying state-space battery degradation model from accelerated aging data. Comparisons of battery life predicted in REopt and from the state-space battery degradation model to ensure validity of lifetime estimates made by REopt. Battery life and cost is optimized by controlling three decision to minimize system life cost: battery sizing, daily state-of-charge, and daily energy-throughput. The cost of battery degradation as a function of these control variables is then estimated assuming two possible maintenance strategies: replacement, where the entire battery system is replaced if cell reach an end-of-life capacity threshold; and augmentation, which establishes a fund to pay for continual purchase of new batteries to maintain the initial energy capacity of the system. These two strategies offer conservative (for replacement) and optimistic (for augmentation) bounds for total system cost. The degradation cost incurred by these strategies is then used to control battery dispatch decisions, operating the battery in a degradation-aware manner that maximizes battery lifetime while also providing energy when favorable. Because the mixed-integer linear program has perfect foresight of future energy needs, batteries with degradation costs are always operated using 'just-in-time' charging, which is unrealistic, as no energy is left in the storage system to perform other energy services or to serve as emergency back-up power. To combat this, an inequality constraint on the average annual state-of-charge is imposed, and the sensitivity of system cost to average stored energy, e.g., the cost of system resiliency, can be quantified. Analysis of results has several conclusions, for instance, oversizing of battery storage systems is not a cost burden when battery storage is an optimal solution, as any additional battery capacity can simply be utilized to avoid costs of purchasing energy from a utility.

battery↗

Waste Characterization Using Gamma Ray Spectrometry with Automated Efficiency Optimization - 13404

Gamma ray spectrometry using High Purity Germanium (HPGe) detectors is commonly employed in assaying radioactive waste streams from a variety of sources: nuclear power plants, Department of Energy (DOE) laboratories, medical facilities, decontamination and decommissioning activities etc. The radioactive material is typically packaged in boxes or drums (for e.g. B-25 boxes or 208 liter drums) and assayed to identify and quantify radionuclides. Depending on the origin of the waste stream, the radionuclides could be special nuclear materials (SNM), fission products, or activation products. Efficiency calibration of the measurement geometry is a critical step in the achieving accurate quantification of radionuclide content. Due to the large size of the waste items, it is impractical and expensive to manufacture gamma ray standard sources for performing a measurement based calibration. For well over a decade, mathematical efficiency methods such as those in Canberra's In Situ Object Counting System (ISOCS) have been successfully employed in the efficiency calibration of gamma based waste assay systems. In the traditional ISOCS based calibrations, the user provides input data such as the dimensions of the waste item, the average density and fill height of the matrix, and matrix composition. As in measurement based calibrations, the user typically defines a homogeneous matrix with a uniform distribution of radioactivity. Actual waste containers can be quite nonuniform, however. Such simplifying assumptions in the efficiency calibration could lead to a large Total Measurement Uncertainty (TMU), thus limiting the amount of waste that can be disposed of as intermediate or low activity level waste. To improve the accuracy of radionuclide quantification, and reduce the TMU, Canberra has developed the capability to optimize the efficiency calibration using the ISOCS method. The optimization is based on benchmarking the efficiency shape and magnitude to the data available in the analyzed gamma ray spectra. Data from measurements of a given item in multiple counting geometries are among the powerful benchmarks that could be used in the optimization. Also, while assaying a waste stream with fission products and activation products emitting gamma lines of multiple energies, optimizing the efficiency on the basis of line activity consistency is very effective. In the present paper, the ISOCS- based optimization methodology is applied to measurement scenarios involving multiple counting geometries, and multi-gamma-line radionuclides. Results will be presented along with accuracy and precision estimates for each measurement. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Achieving groundwater monitoring optimization at SRS: a core team process based on rigorous technical assessment - 15273

The optimization of groundwater monitoring at Savannah River Site (SRS) was achieved through a core team process based on the application of a comprehensive, technical evaluation of individual regulated groundwater units. Groundwater monitoring at SRS is required at dozens of waste sites and includes about 4,000 samples annually. The expected longevity of groundwater contamination and associated groundwater monitoring and reporting constitutes a significant long-term cost to the environmental management budget. The core team, consisting of representatives from the Department of Energy (DOE); U.S. Environmental Protection Agency (USEPA); and the South Carolina Department of Health and Environmental Control (SCDHEC), recognized that monitoring needs for individual plumes evolve as remediation work progresses. The technical evaluation plan was generally based on the availability of many years of monitoring data. In addition, it was recognized that the well network, sampling frequency, and analytical suite had been the same for years and warranted evaluation to determine if the existing monitoring was meeting the current objectives. In order to systematically evaluate monitoring at eighteen different groundwater units, SRS developed a decision-logic analysis using flow sheets to address five areas of optimization identified with core team agreement, including: (1) current monitoring vs regulatory requirements, (2) spatial optimization, (3) temporal assessment, (4) analyte assessment, and (5) reporting assessment. The evaluation resulted in SRS proposing changes in the spatial, temporal, analyte, and reporting aspects of groundwater monitoring for fifteen of the eighteen individual groundwater units evaluated. Overall, these changes have resulted in annual savings of $370 K to date, with an additional $200 K in annual savings pending. Early and frequent core team deliberations helped ensure the success of this optimization effort. The technical evaluation was conducted after receiving core team buy-in for the goals and methods of the project. Technical evaluations for each unit were proposed to the regulators in unit-specific regulatory submittals. The technical justifications and core team decisions were all documented and implemented in accordance within the framework of the SRS Federal Facility Agreement or Resource Conservation and Recovery Act (RCRA) Permit process. This optimization approach can be expected to be highly successful for sites with rich historical data sets and where the requirements in regulatory monitoring plans can be negotiated. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Optimization of Material Recycling During the Decommissioning Process of Nuclear Power Plants - 16123

The German Government decided in 2011 to phase out nuclear power. Therefore, in the near future there will be several nuclear power plants queued up, in parallel, for dismantling. In nuclear decommissioning there is no standardized procedure available, so that a high level of optimization potential can be assumed. We present the results of a preliminary study, in which the optimization potential of metal recycling during the dismantling process should be estimated. The project can be roughly divided into four sections: - Determination of the metal inventory of an exemplarily selected plant; - Analysis of the recycling routes of scrap metal fractions and assessment of the potential for optimization of each process step during the dismantling; - Conduction of activation calculations to uncover the potential of interim storage allowing for radioactive decay; - In collaboration with the Institute of Process Metallurgy and Metal Recycling at the RWTH Aachen, appropriate process steps and process chains of an optimized metal recycling for each of the resulting scrap metal fractions are identified. The paper and the presentation summarize the status and the results of the project implementation and will address for the optimization potentials for decommissioning projects. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Comparison of Fuel Loading Pattern Optimization Results using Exhaustive Search for Fresh Fuels and Local Search for Burned Fuels

Fuel loading pattern optimization is a combinatorial optimization problem from the mathematical point of view. However, exhaustive search is impractical because enormous computational cost is necessary due to huge search space. For this reason, various optimization methods have been developed so far, but no methods are able to guarantee to reach the optimum solution. In the present study, search space is divided into subspaces using key parameters that well represent characteristics of a loading pattern and then promising subspaces are extensively searched. In the present method, balance between division of a search space into subspaces and a search method used in a subspace is essential. For example, when the number of division is set to be one, it is equivalent to the exhaustive search thus is impractical. Similarly, when the division to subspaces is too coarse, an optimum (or near optimum) solution cannot be found through local search in each subspace since design space of a subspace is still too large. Contrary, if division to subspaces is too fine, number of subspaces becomes to large thus promising subspaces cannot be found. In the present study, search space is divided focusing on the location of fresh fuel assemblies with gadolinia since it has significant impact on core characteristics. Number of possible loading patterns of gadolinia bearing fresh fuel assemblies is not very large thus exhaustive search is possible. Local fine search is executed by considering location of burned fuels for each loading pattern of gadolinia bearing fresh fuel assembly. If the same solution is obtained by multiple local searches starting from different initial burnt fuel locations (but the same loading patterns for gadolinia bearing fresh fuel assemblies), the obtained solution is highly likely the optimum in the subspace. In more general, the present method is based on the 'divide and conquer' approach, which is familiar in the optimization field. Namely, after division of search space into subspaces and then promising subspace is searched. Once the promising subspace is found, the subspace is further subdivided into subspaces and repeat the above procedures. This method would be efficient when appropriate balance between search space division method and performance of local search is achieved. The previous works utilizes the similar approach. In reference [1], exhaustive search in small region in a core is carried out focusing on loading patterns of gadolinia bearing fresh fuel assemblies. In reference [2], rough exhaustive search based on the 'batch-wise' loading pattern is performed with the assist of the linear programming. By contrast, in the present study, exhaustive search is carried out for loading patterns of gadolinia bearing fresh fuel assemblies. The random Multi-start Local Search (MSLS) with the direct search or the exhaustive binary swap is used to find out optimal solutions in a subspace, which consists of loading patterns having the same arrangement of gadolinia bearing fresh fuel assemblies. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Optimization of the Shielding of a Canister Loading Machine with the deterministic Code Attila{sup R} - Paper 61

In general shielding components are designed with very conservative assumptions and boundary conditions to cover all possibly occurring situations. This often results in an overestimated shielding design in a lot of different fields of application; the shielding of components will be heavier and more expensive than needed. In most cases an initial shielding calculation in the design process shows an unbalanced shielding effect of the shielded radiation source. Sometimes the dose rate limits are slightly exceeded in several areas. From this arises a need for an optimization of the shielding structure. The goal is to decrease the radiation level in the accessible areas to keep the dose rate limits and to reduce the amount of the used shielding material if possible. Shielding material is moved from areas with higher shielding factors to which with lower ones. The optimization process is shown in an example of a loading machine for vitrified waste in canisters. The design review with an optimization of the shielding geometry was done with the deterministic code Attila{sup R} of the company Transpire, Inc. Attila{sup R} is a powerful tool to calculate and optimize the shielding effect of handling facilities for radioactive materials. It is easy to handle with its CAD integration module and an easy setup of the calculation cases. Areas with a low shielding effect which results in an exceeding of the dose rate limits can be found quickly with the illustration due to an Iso-Dose-Rate-Surface in the 3D Model. In these areas the shielding effect has to be improved. Otherwise there is material, which has no significant influence on the shielding effect and makes the handling facilities heavier and more expensive as needed. The optimization of the shielding design of the canister loading machine in the current case results in lower dose rates outside the facility to keep the dose rate limits. The demand of shielding material could be reduced and resulted in a cost reduction on the facility itself and furthermore in the caring facilities to transport this facility (cranes, etc.). (authors)

42 ENGINEERING↗

Integrating Crack Detection and Pipe Shape Optimization for Enhanced Sewage System Durability

Crack detection in underground reinforced concrete pipes has been essential in determining the state of stormwater infrastructure. Detection models have been implemented for detecting cracks and other defects in pipes using CCTV footage for stormwater drainage systems. In addition, Finite element models have been used to determine optimum shapes and pipe thickness for different boundary conditions such as header pipes in power plants. The concept of shape optimization emerges as a crucial factor in power plant design and operation, with the potential to maximize performance while minimizing the use of materials. Shape optimization not only enhances efficiency but also contributes to reducing the environmental footprint. This paper discusses the integration of both topics by using the cracks detected in underground pipes as boundary conditions for shape optimization of the pipes. A machine learning model has been developed which uses limited data for training and outlines the location of detected cracks. A shape optimization methodology is proposed in which ANSYS modules are used to analyze fluid flow and then optimize the shape of the pipe. The crack detection model developed has been applied to a crack detected in lab setting and machine learning model used has an accuracy of 98% using a random forest algorithm.

20 FOSSIL-FUELED POWER PLANTS↗

Integrated Transmission-Distribution Multi-Period Switching for Wildfire Risk Mitigation: Improving Speed and Scalability with Distributed Optimization: Preprint

With increasingly severe wildfire conditions driven by climate change, utilities must manage the risk of wildfire ignitions from electric power lines. During "public safety power shutoff'" events, utilities de-energize power lines to reduce wildfire ignition risk, which may result in load shedding. Distributed energy resources provide flexibility that can help support the system to reduce load shedding when lines are de-energized. We investigate a coordinated transmission-distribution optimization problem that balances wildfire risk mitigation and load shedding. We model distribution systems that include battery energy storage systems which may support loads when transmission lines are de-energized. This multi-period integrated transmission-distribution optimal switching problem jointly optimizes line switching decisions, the generators' setpoints, load shedding, and the batteries' states of charge, resulting in significant computational challenges. To improve scalability, we decompose the problem over both space and time and apply a distributed optimization algorithm. Using a large-scale synthetic California test case with realistic distribution models and real wildfire risk data, we show that distributed optimization can solve large-scale multi-period switching problems that are otherwise intractable for centralized solvers. We also discuss challenges and future directions for improving the distributed algorithm's convergence performance as the number of time periods increases.

24 POWER TRANSMISSION AND DISTRIBUTION↗