Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Selection 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 253 records · Page 14

TPSAS-NF1676L-12441-DND

The increasing presence of airport surface surveillance technologies has spawned a strong interest in airport surface traffic management research; the vast majority has assumed that the airport’s runway configuration is known and constant. Tactical Runway Configuration Management (TRCM), one component of NASA’s System Oriented Runway Management concept, plans the airport configuration to optimize traffic efficiency for the forecast weather, traffic, and other factors. While planning runway configuration can provide benefit and is required by other automation concepts, larger benefits are possible by planning other airport configuration decisions, such as runway assignment policies, that are currently made manually by controllers. A laboratory prototype of the TRCM algorithm which selects optimal airport configuration schedules has been implemented and studied within a simulation environment. The presentation will describe simulation results for several airports, under various weather and traffic conditions. The sequence of airport configurations recommended by TRCM result in significantly less delay than the airport configurations that were actually used by controllers, illustrating both the potential benefit from airport configuration optimization and the ability of TRCM to provide effective airport configuration schedules. The application to several, distinct airports demonstrates the approach is capable of handling the differences between airports with a common algorithm, while providing decision support that respects the current procedures at those airports. Consequently, TRCM is able to be deployed to any airport within the current National Airspace System. The TRCM algorithmic approach is also extensible to future operational scenarios. NASA is in the process of transferring the initial TRCM technology to the FAA. Future research will extend the concept and algorithm to provide coordinated plans for metroplex airports and study NextGen applications.

Stephen Atkins↗

TPSAS-NF1676L-12263-DND

The increasing presence of airport surface surveillance technologies has spawned a strong interest in airport surface traffic management research; the vast majority has assumed that the airport’s runway configuration is known and constant. Tactical Runway Configuration Management (TRCM), one component of NASA’s System Oriented Runway Management concept, plans the airport configuration to optimize traffic efficiency for the forecast weather, traffic, and other factors. While planning runway configuration can provide benefit and is required by other automation concepts, larger benefits are possible by planning other airport configuration decisions, such as runway assignment policies, that are currently made manually by controllers. A laboratory prototype of the TRCM algorithm which selects optimal airport configuration schedules has been implemented and studied within a simulation environment. The presentation will describe simulation results for several airports, under various weather and traffic conditions. The sequence of airport configurations recommended by TRCM result in significantly less delay than the airport configurations that were actually used by controllers, illustrating both the potential benefit from airport configuration optimization and the ability of TRCM to provide effective airport configuration schedules. The application to several, distinct airports demonstrates the approach is capable of handling the differences between airports with a common algorithm, while providing decision support that respects the current procedures at those airports. Consequently, TRCM is able to be deployed to any airport within the current National Airspace System. The TRCM algorithmic approach is also extensible to future operational scenarios. NASA is in the process of transferring the initial TRCM technology to the FAA. Future research will extend the concept and algorithm to provide coordinated plans for metroplex airports and study NextGen applications.

Stephen Atkins↗

Framework to select robust energy retrofit measures for residential communities

Residential building energy retrofits are essential for enhancing environmental sustainability and reducing energy costs. The selection of retrofit measures is influenced by factors such as building systems, occupant behavior, government policy, weather variability, and climate change, all of which can significantly impact energy performance. Compared to retrofitting individual homes, evaluating and selecting optimal retrofit solutions for an entire community is challenging due to diverse residential compositions and variability present. Therefore, engineering robustness is crucial for ensuring consistent energy performance and resilience across different conditions. In this context, robustness refers to the ability of a retrofit measure to maintain its functionality and remain an optimal choice despite external disturbances or changes in inputs and conditions. This study presents a framework for evaluating the robustness of multiple retrofit measures across various building systems, occupant behaviors, and environmental scenarios at the community level. The framework comprises five key steps: scenario model development, integration of the National Residential Efficiency Measures database, energy performance simulation, cost-benefit aggregation, and retrofit solution selection. Each step enhances the framework’s robustness by incorporating the diversity of building characteristics, occupant behaviors, environmental conditions, retrofit options, and evaluation criteria. The framework’s effectiveness is demonstrated through a case study in southern Michigan in the United States, which includes 63 one-story single-family houses, 121 two-story single-family houses, and 8 townhouses. The study identifies furnace retrofits as the most robust solution for the entire community, consistently achieving source energy reductions of 4.7 %–8.0 % and payback period of 10–20 years across various scenarios. These findings are consistent with previous research, indicating the framework’s potential for broader applications in optimizing community-scale residential energy retrofits.

Shu, Lei↗

OPTIMAL TIME-SERIES SELECTION OF QUASARS

We present a novel method for the optimal selection of quasars using time-series observations in a single photometric bandpass. Utilizing the damped random walk model of Kelly et al., we parameterize the ensemble quasar structure function in Sloan Stripe 82 as a function of observed brightness. The ensemble model fit can then be evaluated rigorously for and calibrated with individual light curves with no parameter fitting. This yields a classification in two statistics-one describing the fit confidence and the other describing the probability of a false alarm-which can be tuned, a priori, to achieve high quasar detection fractions (99% completeness with default cuts), given an acceptable rate of false alarms. We establish the typical rate of false alarms due to known variable stars as {approx}<3% (high purity). Applying the classification, we increase the sample of potential quasars relative to those known in Stripe 82 by as much as 29%, and by nearly a factor of two in the redshift range 2.5 < z < 3, where selection by color is extremely inefficient. This represents 1875 new quasars in a 290 deg{sup 2} field. The observed rates of both quasars and stars agree well with the model predictions, with >99% of quasars exhibiting the expected variability profile. We discuss the utility of the method at high redshift and in the regime of noisy and sparse data. Our time-series selection complements well-independent selection based on quasar colors and has strong potential for identifying high-redshift quasars for Baryon Acoustic Oscillations and other cosmology studies in the LSST era.

79 ASTRONOMY AND ASTROPHYSICS↗

Predictive Tools for Customizing Heat Treatment of Additively Manufactured Aerospace Components

Laser-bed powder fusion (LBPF) additive manufacturing is increasingly being used to produce components of complex geometries using the Ni-base superalloy Inconel 718. The composition and the microstructure of the alloy are currently well optimized for wrought components made using conventional manufacturing processes such as rolling, forging, extrusion, etc. The attractive mechanical properties of the alloy result from the underlying austenitic matrix with fine equiaxed grains, and a high density and uniform distribution of the precipitation hardening phase, γ". Heat treatment steps such as homogenization, solutioning and aging are well documented for the wrought alloy. However, when the same wrought alloy compositions are used for the additive manufacturing (AM) processes, the asprocessed microstructure is significantly different, because of the different thermal history associated with LBPF, including rapid solidification and multiple temperature excursions that lead to multiple re-melting and reheating in the solid state. Rapid solidification introduces potential non-equilibrium effects at the moving solid-liquid interfaces that impact the extent of solute segregation, as well as the morphology of the dendritic grains that form. In order to recover the target mechanical properties, AM components have to undergo post-process heat treatments. However, such heat treatments have to be custom designed for the AM process and the component geometry because of the expected vast differences in the microstructure at various locations of a component with complex geometry. The homogenization and precipitation steps should be optimized for the component so that target mechanical properties can be obtained throughout the part. The objective of this research is to utilize High Performance Computing in phase field simulations of microstructure evolution during post-processing of AM components. The physics-based modeling will be beneficial in reducing the experimental effort required for heat treatment process selection, optimization, and certification, thus leading to a significant reduction in energy consumption for AM and post-processing heat treatment. The optimization study will help identify heat treatments steps that are critical for development of a final desired microstructure with the minimum energy input. This combined with shortening of the production cycle (time-to-market) by reducing the number of failed parts (property targets), and reduction in the number of iterations for process optimization, will enable 30-40% savings in the energy costs. Phase field simulations of the degree of homogenization and the effect of local matrix composition on the nucleation and growth of competing precipitating phases were performed using the Microstructure Evolution Using Massively Parallel Phase Field Simulations code developed in-house at the Oak Ridge National Laboratory. The simulations were able to successfully capture the kinetics of nucleation and growth, and morphologies of various precipitating phases as a function of local matrix compositions and composition gradients characteristic of local microstructures arising from location-dependent variations in the thermal conditions. Future work will involve extending the simulations to a length scale consisting of multiple dendrites, so that the effect of homogenization on the coarsening of the dendrites can be simulated and used as an additional input to the optimization of the heat treatment process.

36 MATERIALS SCIENCE↗

Solvent Selection for the Separation of Lignin-Derived Monomers Using the Conductor-like Screening Model for Real Solvents

The separation of desired monomers from a liquid-phase mixture of lignin depolymerization products is necessary to facilitate their upscaling and upgrading for industrial applications. One effective method to separate multiple liquid-phase products is countercurrent chromatography (CCC), which is a common liquid chromatography technique that separates target solutes based on differences in their partitioning in a biphasic solvent system. Effective CCC separation requires the selection of solvent compositions to tune solute partition coefficients. Here, to alleviate the experimental burden of selecting optimal solvent systems, we apply the conductor-like screening model for real solvents (COSMO-RS) method to compute partition coefficients of representative lignin monomers from four currently used depolymerization strategies in standard solvent systems. We further design new ternary and quaternary solvent systems that are predicted to further improve separation efficacy. On the basis of these predicted partition coefficients and empirical solvent selection criteria for CCC measurements, we suggest a range of solvent systems that would be suitable for the effective separation of aromatic lignin-derived products via CCC or similar liquid–liquid extraction methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

RADAR: Runtime Asymmetric Data-access Driven Scientific Data Replication

Efficient I/O on large-scale spatiotemporal scientific data requires scrutiny of both the logical layout of the data (e.g., row-major vs. column-major) and the physical layout (e.g., distribution on parallel filesystems). For increasingly complex datasets, hand optimization is a difficult matter prone to error and not scalable to the increasing heterogeneity of analysis workloads. Given these factors, we present a partial data replication system called RADAR. We capture datatype- and collective-aware I/O access patterns (indicating logical access) via MPI-IO tracing and use a combination of coarse-grained and fine-grained performance modeling to evaluate and select optimized physical data distributions for the task at hand. Unlike conventional methods, we store all replica data and metadata, along with the original untouched data, under a single file container using the object abstraction in parallel filesystems. Our system results in manyfold improvements in some commonly used subvolume decomposition access patterns.Moreover, the modeling approach can determine whether such optimizations should be undertaken in the first place.

access pattern↗

Sensor placement algorithm development to maximize the efficiency of acid gas removal unit for integrated gasifiction combined sycle (IGCC) power plant with CO2 capture

Future integrated gasification combined cycle (IGCC) power plants with CO{sub 2} capture will face stricter operational and environmental constraints. Accurate values of relevant states/outputs/disturbances are needed to satisfy these constraints and to maximize the operational efficiency. Unfortunately, a number of these process variables cannot be measured while a number of them can be measured, but have low precision, reliability, or signal-to-noise ratio. In this work, a sensor placement (SP) algorithm is developed for optimal selection of sensor location, number, and type that can maximize the plant efficiency and result in a desired precision of the relevant measured/unmeasured states. In this work, an SP algorithm is developed for an selective, dual-stage Selexol-based acid gas removal (AGR) unit for an IGCC plant with pre-combustion CO{sub 2} capture. A comprehensive nonlinear dynamic model of the AGR unit is developed in Aspen Plus Dynamics® (APD) and used to generate a linear state-space model that is used in the SP algorithm. The SP algorithm is developed with the assumption that an optimal Kalman filter will be implemented in the plant for state and disturbance estimation. The algorithm is developed assuming steady-state Kalman filtering and steady-state operation of the plant. The control system is considered to operate based on the estimated states and thereby, captures the effects of the SP algorithm on the overall plant efficiency. The optimization problem is solved by Genetic Algorithm (GA) considering both linear and nonlinear equality and inequality constraints. Due to the very large number of candidate sets available for sensor placement and because of the long time that it takes to solve the constrained optimization problem that includes more than 1000 states, solution of this problem is computationally expensive. For reducing the computation time, parallel computing is performed using the Distributed Computing Server (DCS®) and the Parallel Computing® toolbox from Mathworks®. In this presentation, we will share our experience in setting up parallel computing using GA in the MATLAB® environment and present the overall approach for achieving higher computational efficiency in this framework.

97 MATHEMATICS AND COMPUTING↗

Sensor placement algorithm development to maximize the efficiency of acid gas removal unit for integrated gasification combined cycle (IGCC) power plant with CO{sub 2} capture

Future integrated gasification combined cycle (IGCC) power plants with CO{sub 2} capture will face stricter operational and environmental constraints. Accurate values of relevant states/outputs/disturbances are needed to satisfy these constraints and to maximize the operational efficiency. Unfortunately, a number of these process variables cannot be measured while a number of them can be measured, but have low precision, reliability, or signal-to-noise ratio. In this work, a sensor placement (SP) algorithm is developed for optimal selection of sensor location, number, and type that can maximize the plant efficiency and result in a desired precision of the relevant measured/unmeasured states. In this work, an SP algorithm is developed for an selective, dual-stage Selexol-based acid gas removal (AGR) unit for an IGCC plant with pre-combustion CO{sub 2} capture. A comprehensive nonlinear dynamic model of the AGR unit is developed in Aspen Plus Dynamics® (APD) and used to generate a linear state-space model that is used in the SP algorithm. The SP algorithm is developed with the assumption that an optimal Kalman filter will be implemented in the plant for state and disturbance estimation. The algorithm is developed assuming steady-state Kalman filtering and steady-state operation of the plant. The control system is considered to operate based on the estimated states and thereby, captures the effects of the SP algorithm on the overall plant efficiency. The optimization problem is solved by Genetic Algorithm (GA) considering both linear and nonlinear equality and inequality constraints. Due to the very large number of candidate sets available for sensor placement and because of the long time that it takes to solve the constrained optimization problem that includes more than 1000 states, solution of this problem is computationally expensive. For reducing the computation time, parallel computing is performed using the Distributed Computing Server (DCS®) and the Parallel Computing® toolbox from Mathworks®. In this presentation, we will share our experience in setting up parallel computing using GA in the MATLAB® environment and present the overall approach for achieving higher computational efficiency in this framework.

20 FOSSIL-FUELED POWER PLANTS↗

Optimization of battery swapping infrastructure for e-commerce drone delivery

Drone delivery is widely-researched to alter the current e-commerce delivery convention for providing short delivery lead times. Yet, flight range of drones, constrained by the available battery technology, sets a milestone toward realizing the sole-drone delivery. To tackle with the flight range limitation, locating automated battery swapping machines (ABSM) have been proposed and a few studies modeled the problem. Using the ABSMs, drones can be loaded with fully-charged batteries along the route to a demand location. Here, we introduce a mixed-integer nonlinear program to model the problem. The objective of the program is to optimally select ABSM locations, determine the delivery-mode choices (drone-only, truck-only, and mixed delivery) of demand locations, find drone delivery routes, and approximate the baseline requirements for the number of drones and batteries needed. The program minimizes the overall delivery system costs including: ABSM, delivery, drone ownership, battery inventory, and service congestion. A cutting-plane method is developed to find exact solutions in finite iterations. Computational experiments showed that the method quickly yields the optimal solution to instances with less than 60 ABSM candidates and 20 demand locations. A case study shows that the optimal drone delivery infrastructure can save almost 20% cost compared to the conventional truck-only delivery. Sensitivity analyses were conducted to reveal the impact of key parameters in the decision-making and found that a decrease in the ABSM and drone costs highly affect the system cost.

25 ENERGY STORAGE↗

H-P adaptive methods for finite element analysis of aerothermal loads in high-speed flows

The commitment to develop the National Aerospace Plane and Maneuvering Reentry Vehicles has generated resurgent interest in the technology required to design structures for hypersonic flight. The principal objective of this research and development effort has been to formulate and implement a new class of computational methodologies for accurately predicting fine scale phenomena associated with this class of problems. The initial focus of this effort was to develop optimal h-refinement and p-enrichment adaptive finite element methods which utilize a-posteriori estimates of the local errors to drive the adaptive methodology. Over the past year this work has specifically focused on two issues which are related to overall performance of a flow solver. These issues include the formulation and implementation (in two dimensions) of an implicit/explicit flow solver compatible with the hp-adaptive methodology, and the design and implementation of computational algorithm for automatically selecting optimal directions in which to enrich the mesh. These concepts and algorithms have been implemented in a two-dimensional finite element code and used to solve three hypersonic flow benchmark problems (Holden Mach 14.1, Edney shock on shock interaction Mach 8.03, and the viscous backstep Mach 4.08).

Chang, H. J.↗

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

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

09 BIOMASS FUELS↗

Partial and complete reduction of O2 by hydrogen on transition metal surfaces

The metal-catalyzed reduction of di-oxygen (O{sub 2}) by hydrogen is at the heart of direct synthesis of hydrogen peroxide (HOOH) and power generation by proton exchange membrane fuel cells. Despite its apparent simplicity, how the reaction proceeds on different metals is not yet well understood. We present a systematic study of O{sub 2} reduction on the (111) facets of eight transition metals (Rh, Ir, Ni, Pd, Pt, Cu, Ag, and Au) based on periodic density functional theory (DFT-GGA) calculations. Analysis of ten surface elementary reaction steps suggests three selectivity regimes as a function of the binding energy of atomic oxygen (BEO), delineated by the opposite demands to catalyze O-O bond scission and O-H bond formation: The dissociative adsorption of O{sub 2} prevails on Ni, Rh, Ir, and Cu; the complete reduction to water via associative (peroxyl, peroxide, and aquoxyl) mechanisms prevails on Pd, Pt, and Ag; and HOOH formation prevails on Au. The reducing power of hydrogen is decreased electrochemically by increasing the electrode potential. This hinders the hydrogenation of oxygen species and shifts the optimal selectivity for water to less reactive metals. Our results point to the important role of the intrinsic reactivity of metals in the selectivity of O{sub 2} reduction, provide a unified basis for understanding the metal-catalyzed reduction of O{sub 2} to H{sub 2}O and HOOH, and offer useful insights for identifying new catalysts for desired oxygen reduction products.

08 HYDROGEN↗

Identification of the Selective Sites for Electrochemical Reduction of CO to C 2+ Products on Copper Nanoparticles by Combining Reactive Force Fields, Density Functional Theory, and Machine Learning

Recent experiments have shown that CO reduction on oxide derived Cu nanoparticles (NP) are highly selective toward C 2+ products. However, understanding of the active sites on such NPs is limited, because the NPs have ~200 000 atoms with more than 10 000 surface sites, far too many for direct quantum mechanical calculations and experimental identifications. We show here how to overcome the computational limitation by combining multiple levels of theoretical computations with machine learning. This approach allows us to map the machine learned CO adsorption energies on the surface of the copper nanoparticle to construct the active site visualization (ASV). Furthermore, we identify the structural criteria for optimizing selective reduction by predicting the reaction energies of the potential determining step, $ΔE_{OCCOH}$, for the C 2+ product. Based on this structural criterion, we design a new periodic copper structure for CO reduction with a theoretical faradaic efficiency of 97%.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Experimental decoy-state Bennett-Brassard 1984 quantum key distribution through a turbulent channel

In free-space quantum key distribution (QKD) in turbulent conditions, scattering and beam wandering cause intensity fluctuations which decrease the detected signal-to-noise ratio. This effect can be mitigated by rejecting received bits when the channel's transmittance is below a threshold. Thus, the overall error rate is reduced and the secure key rate increases despite the deletion of bits. In this work, we implement recently proposed selection methods focusing on the prefixed-threshold real-time selection (P-RTS) where a cutoff can be chosen prior to data collection and independently of the transmittance distribution. We perform finite-size decoy-state Bennett-Brassard 1984 QKD in a laboratory setting where we simulate the atmospheric turbulence using an acousto-optical modulator. We show that P-RTS can yield considerably higher secure key rates for a wide range of the atmospheric channel parameters. In addition, we evaluate the performance of the P-RTS method for a realistically finite sample size. We demonstrate that a near-optimal selection threshold can be predetermined even with imperfect knowledge of the channel transmittance distribution parameters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The Handicap Principle, Strategic Information Warfare and the Paradox of Asymmetry

The term asymmetric threat (or warfare) often refers to tactics utilized by countries, terrorist groups, or individuals to carry out attacks on a superior opponent while trying to avoid direct confrontation. Information warfare is sometimes also referred to as a type of asymmetric warfare perhaps due to its asymmetry in terms of cost and efficacy. Obviously, there are differences and commonalities between two types of asymmetric warfare. One major difference lies in the goal to avoid confrontation and one commonality is the asymmetry. Regardless, the unique properties surrounding asymmetric warfare warrant a strategic-level study. Despite enormous studies conducted in the last decade, a consensus on the strategy a nation state should take to deal with asymmetric threat seems still intriguing. In this article, we try to shed some light on the issue from the handicap principle in the context of information warfare. The Handicap principle was first proposed by Zahavi (1975) to explain the honesty or reliability of animal communication signals. He argued that in a signaling system such as one used in mate selection, a superior male is able to signal with a highly developed "handicap" to demonstrate its quality, and the handicap serves "as a kind of (quality) test imposed on the individual" (Zahavi 1975, Searcy and Nowicki 2005). The underlying thread that inspires us for the attempt to establish a connection between the two apparently unrelated areas is the observation that competition, communication and cooperation (3C), which are three fundamental processes in nature and against which natural selection optimize living things, may also make sense in human society. Furthermore, any communication networks, whether it is biological networks (such as animal communication networks) or computer networks (such as the Internet) must be reasonably reliable (honest in the case of animal signaling) to fulfill its missions for transmitting and receiving messages. The strategic goal of information warfare is then to destroy or defend the reliability (honesty) of communication networks. The handicap principle that governs the reliability (honesty) of animal communication networks can be considered as the nature s version of information warfare strategy because it is a product of natural selection. What is particularly interesting is to transfer the evolutionary game theory models [e.g., Sir Philip Sydney (SPS) game] for the handicap principle to the study of information warfare. In a broad perspective, we realize that the handicap principle may actually contradict the principle of asymmetry in asymmetric warfare. Anyway, not every species of animals has evolved expensive signaling equipments like male peacocks (whose exaggerated train is an example of handicap). Furthermore, the handicap principle is not only about communication, and it also embodies the spirits of cooperation and competition. In human societies, communication modulates cooperation and competition; so does in animal communication networks. Therefore, to evolve or maintain a sustainable communication network, the proper strategy should be to balance (modulate) the cooperation and competition with communication tools (information warfare tools), which is perhaps in contradiction with the asymmetric strategy. There might be a paradox in the strategy of asymmetric warfare, and whether or not information warfare can be used as an asymmetric tool is still an open question.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Accelerating manufacturing for biomass conversion via integrated process and bench digitalization: a perspective

We present a perspective for accelerating biomass manufacturing via digitalization. We summarize the challenges for manufacturing and identify areas where digitalization can help. A profound potential in using lignocellulosic biomass and renewable feedstocks, in general, is to produce new molecules and products with unmatched properties that have no analog in traditional refineries. Discovering such performance-advantaged molecules and the paths and processes to make them rapidly and systematically can transform manufacturing practices. Furthermore, we discuss retrosynthetic approaches, text mining, natural language processing, and modern machine learning methods to enable digitalization. Laboratory and multiscale computation automation via active learning are crucial to complement existing literature and expedite discovery and valuable data collection without a human in the loop. Such data can help process simulation and optimization select the most promising processes and molecules according to economic, environmental, and societal metrics. We propose the close integration between bench and process scale models and data to exploit the low dimensionality of the data and transform the manufacturing for renewable feedstocks.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Strategies for automatic online treatment plan reoptimization using clinical treatment planning system: A planning parameters study

Purpose: Adaptive radiation therapy for prostate cancer using online reoptimization provides an improved control of interfractional anatomy variations. However, the clinical implementation of online reoptimization is currently limited by the low efficiency of current strategies and the difficulties associated with integration into the current treatment planning system. This study investigates the strategies for performing fast (∼2 min) automatic online reoptimization with a clinical fluence-map-based treatment planning system; and explores the performance with different input parameters settings: dose-volume histogram (DVH) objective settings, starting stage, and iteration number (in the context of real time planning).Methods: Simulated treatments of 10 patients were reoptimized daily for the first week of treatment (5 fractions) using 12 different combinations of optimization strategies. Options for objective settings included guideline-based RTOG objectives, patient-specific objectives based on anatomy on the planning CT, and daily-CBCT anatomy-based objectives adapted from planning CT objectives. Options for starting stages involved starting reoptimization with and without the original plan's fluence map. Options for iteration numbers were 50 and 100. The adapted plans were then analyzed by statistical modeling, and compared both in terms of dosimetry and delivery efficiency.Results: All online reoptimized plans were finished within ∼2 min with excellent coverage and conformity to the daily target. The three input parameters, i.e., DVH objectives, starting stage, and iteration number, contributed to the outcome of optimization nearly independently. Patient-specific objectives generally provided better OAR sparing compared to guideline-based objectives. The benefit in high-dose sparing from incorporating daily anatomy into objective settings was positively correlated with the relative change in OAR volumes from planning CT to daily CBCT. The use of the original plan fluence map as the starting stage reduced OAR dose at the mid-dose region, but increased the monitor units by 17%. Differences of only 2cc or less in OAR V50%/V70Gy/V76Gy were observed between 100 and 50 iterations.Conclusions: It is feasible to perform automatic online reoptimization in ∼2 min using a clinical treatment planning system. Selecting optimal sets of input parameters is the key to achieving high quality reoptimized plans, and should be based on the individual patient's daily anatomy, delivery efficiency, and time allowed for plan adaptation.

61 RADIATION PROTECTION AND DOSIMETRY↗