SEARCH · Search NASA
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.
The layout of power modules is one of the key points in power module design, especially for high power densities, where couplings are increased. In this paper, along with the design example, an automatic design processes by using a genetic algorithm are presented. Some practical considerations and implementations are introduced in the optimization of module layout design.
Not Available
This work evaluates different optimization algorithms for computational fluid dynamics (CFD) simulations of engine combustion. Due to the computational expense of CFD simulations, emulators built with machine learning algorithms were used as surrogates for the optimizers. Two types of emulators were used: a Gaussian process (GP) and a weighted variety of machine learning methods called SuperLearner (SL). The emulators were trained using a dataset of 2048 CFD simulations that were run concurrently on a supercomputer. The design of experiments (DOE) for the CFD runs was obtained by perturbing nine input parameters using a Monte-Carlo method. The CFD simulations were of a heavy duty engine running with a low octane gasoline-like fuel at a partially premixed compression ignition mode. Ten optimization algorithms were tested, including types typically used in research applications. Each optimizer was allowed 800 function evaluations and was randomly tested 100 times. The optimizers were evaluated for the median, minimum, and maximum merits obtained in the 100 attempts. Some optimizers required more sequential evaluations, thereby resulting in longer wall clock times to reach an optimum. The best performing optimization methods were particle swarm optimization (PSO), differential evolution (DE), GENOUD (an evolutionary algorithm), and micro-genetic algorithm (GA). These methods found a high median optimum as well as a reasonable minimum optimum of the 100 trials. Moreover, all of these methods were able to operate with less than 100 successive iterations, which reduced the wall clock time required in practice. Two methods were found to be effective but required a much larger number of successive iterations: the DIRECT and MALSCHAINS algorithms. A random search method that completed in a single iteration performed poorly in finding optimum designs but was included to illustrate the limitation of highly concurrent search methods. The last three methods, Nelder–Mead, bound optimization by quadratic approximation (BOBYQA), and constrained optimization by linear approximation (COBYLA), did not perform as well.
Background: Primer design for highly variable DNA sequences is difficult, and experimental success requires attention to many interacting constraints. The advent of next-generation sequencing methods allows the investigation of rare variants otherwise hidden deep in large populations, but requires attention to population diversity and primer localization in relatively conserved regions, in addition to recognized constraints typically considered in primer design. Results: Design constraints include degenerate sites to maximize population coverage, matching of melting temperatures, optimizing de novo sequence length, finding optimal bio-barcodes to allow efficient downstream analyses, and minimizing risk of dimerization. To facilitate primer design addressing these and other constraints, we created a novel computer program (PrimerDesign) that automates this complex procedure. We show its powers and limitations and give examples of successful designs for the analysis of HIV-1 populations. Conclusions: PrimerDesign is useful for researchers who want to design DNA primers and probes for analyzing highly variable DNA populations. It can be used to design primers for PCR, RT-PCR, Sanger sequencing, next generation sequencing, and other experimental protocols targeting highly variable DNA samples.
The zigzag search algorithm has been applied in engineering fields, such as oil well placement, with satisfactory results. Here, the zigzag search algorithm is introduced, modified with enhancement, and effectively applied to solve an economic emission dispatch problem and to demonstrate its practicability in power systems. The problem is formulated as a non-linear multi-objective optimization model taking energy constraints, generation limits, and transmission constraints into consideration. A set of non-dominant solutions can be obtained to form the Pareto front. Case studies are carried out with the IEEE 30-bus system and IEEE 118-bus system. The results indicate that the proposed zigzag search algorithms have the ability to deal with relevant power system problems. Comparisons are made with algorithms which have been widely used in literatures, such as the genetic algorithm (GA) and particle swarm optimization (PSO). Finally, this demonstrates that the zigzag search is easy to implement and is superior to other multi-objective (MO) techniques in both accuracy and efficiency.
Optimization algorithms/techniques such as genetic algorithm, particle swarm optimization, and Gaussian process have been widely used in the accelerator field to tackle complex design/online optimization problems. However, connecting the algorithm with the optimization problem can be difficult, as the algorithms and the problems may be implemented in different languages, or they may require specific resources. We introduce an optimization platform named Teeport that is developed to address the above issues. This real-time communication-based platform is designed to minimize the effort of integrating the algorithms and problems. Once integrated, the users are granted a rich feature set, such as monitoring, controlling, and benchmarking. Some real-life applications of the platform are also discussed.
To enable the deployment of molten salt reactor technology, the development of off-gas treatment systems and advanced monitoring tools capable of operating with high temperatures and radiation fields while delivering near real-time information is necessary. Here, we aim to fulfill this requirement and proposes laser-induced breakdown spectroscopy (LIBS) for monitoring molten salt aerosol streams. A sheath gas measuring method was developed to protect optical elements from aerosol particles and to ensure a relatively constant aerosol stream for measurement. An aqueous system was studied to demonstrate the utility of LIBS for monitoring possible fission products in an aerosol stream: Gd, Nd, and Sm up to 2000 parts per million (ppm). A calibration model was built using partial least squares (PLS) regression with five, six, and nine latent variables for Gd, Nd, and Sm, respectively. This calibration model successfully estimated the concentrations of three test samples, which were validated with inductively charged plasma optical emission spectroscopy measurements at a 99.9% confidence interval. To enhance these models, a genetic algorithm was used to filter the spectra before entering the PLS model, thereby limiting the spectral features being regressed to those with greater correlations to concentration. This allowed for the number of latent variables used in the PLS models to be reduced to four, three, and three for Gd, Nd, and Sm, respectively. Finally, the genetic algorithm-filtered PLS models were used to predict the concentrations of the aerosol stream on a real-time dataset and resulted in a 73%, 18%, and 25% improvement in root mean squared error of prediction compared to the original PLS models developed.
Selection of primary controlled variables (CVs) with due consideration of economic loss and ease of control is an important step for achieving optimal plant operation under design and off-design conditions. However, the computational expense of the combinatorial optimization step that is undertaken for CV selection renders the existing approaches unaffordable for fast selection of optimal CVs. Two approaches are proposed in this paper for improving the computational efficiency of the optimization step. Typically, the CV selection process is typically executed by considering the entire plant together. Opposed to that, the first approach proposed here seeks to decompose the process plant into multiple partitions based on the connectivity strength. Then the CV selection algorithm can be executed on each partition independently. The decomposition algorithm is biomimetic and has been developed, in analogy to neuroscience, mimicking how the information about the connectivity information is extracted using a dynamic casual model. This approach can significantly decrease the number of combinatorial optimization problems that needs to be solved and facilitates parallelization of the solution. In the second approach, a multiagent optimization framework is proposed that utilizes metaheuristic optimization strategies such as the efficient ant colony algorithm, simulated annealing and the genetic algorithm. These two approaches can be used by themselves or in combination. This framework enables cooperative search by a group of algorithmic agents facilitated through an information sharing protocol. These two approaches are applied to a toy problem and an acid gas removal unit as part of an integrated gasification combined cycle. This study shows how the computational time and economic and control performance of the optimal CV sets vary as the number of partitions are changed.
Traditional interconnection network design approaches focus on building general network topologies by optimizing the bisection bandwidth or minimizing the network’s diameter to reduce the maximum distance between any two nodes, thus amortizing the overall execution time of the HPC workloads. While such network topologies may accommodate a wide variety of applications in general, this may result in sub-optimal performance for many frequently-executed or dynamic workloads. In this paper, instead of focusing on designing an all-encompassing, general-purpose network topology, we develop a methodology to design customized network interconnects, evolved by “finding” the optimal topologies for a particular target workload given by its communication and contention profiles. To this end, we implement a Genetic Algorithm (GA)-based approach for network topology design tailored to improve the overall execution time of a particular workload of interest. We conducted extensive experiments with well-known motifs in physics-based workloads (Sweep3D and FFT), as well as with a representative graph application (MiniVite), using the well-known Structural Simulation Toolkit (SST) Macroscale Element Library (SST/macro) simulator for network interconnect evaluation. We demonstrate that our genetic algorithm-based approach is robust enough to find the underlying optimal topology of a particular workload.
In this paper, we propose several algorithms to recover the location and intensity of a radiation source located in a simulated 250 × 180 m block of an urban center based on synthetic measurements. Radioactive decay and detection are Poisson random processes, so we employ likelihood functions based on this distribution. Owing to the domain geometry and the proposed response model, the negative logarithm of the likelihood is only piecewise continuous differentiable, and it has multiple local minima. To address these difficulties, we investigate three hybrid algorithms composed of mixed optimization techniques. For global optimization, we consider simulated annealing, particle swarm, and genetic algorithm, which rely solely on objective function evaluations; that is, they do not evaluate the gradient in the objective function. By employing early stopping criteria for the global optimization methods, a pseudo-optimum point is obtained. This is subsequently utilized as the initial value by the deterministic implicit filtering method, which is able to find local extrema in non-smooth functions, to finish the search in a narrow domain. These new hybrid techniques, combining global optimization and implicit filtering address, difficulties associated with the non-smooth response, and their performances, are shown to significantly decrease the computational time over the global optimization methods. To quantify uncertainties associated with the source location and intensity, we employ the delayed rejection adaptive Metropolis and DiffeRential Evolution Adaptive Metropolis algorithms. Finally, marginal densities of the source properties are obtained, and the means of the chains compare accurately with the estimates produced by the hybrid algorithms.
The hub location and revenue management problems are two interesting research fields in the transportation and network design studies. The hub location model designs the transportation network structure and the revenue management model allocates the network’s capacity for customer classes based on their sensitivity to prices. In this paper, we consider the integrated hub location and revenue management problem in the airline industry to maximize the revenue of transportation network and minimize hub installation costs. p hubs have been chosen from a set of n nodes and connected to a central node based on star–star network design. The capacity of the installed links between the hubs and the central node and the hubs and non-hub nodes is limited. This limited capacity has been allocated to the stochastic demands of customer classes using the revenue management approach. A two-stage stochastic model has been derived to determine the locations of hubs and protection levels in the ticket sale process, and an efficient modification of genetic algorithm has been proposed for the large-scale problems. Numerical experiments have been carried out to assess the effectiveness of the proposed algorithm.
Additive Manufacturing (AM) of porous polymeric materials, such as foams, recently became a topic of intensive research due their unique combination of low density, impressive mechanical properties, and stress dissipation capabilities. Conventional methods for fabricating foams rely on complex and stochastic processes, making it challenging to achieve precise architectural control of structured porosity. In contrast, AM provides access to a wide range of printable materials, where precise spatial control over structured porosity can be modulated during the fabrication process enabling the production of foam replacement structures (FRS). Current approaches for designing FRS are based on intuitive understanding of their properties or an extensive number of finite element method (FEM) simulations. These approaches, however, are computationally expensive and time consuming. As such, in this work, we present a novel methodology for determining the mechanical compression response of direct ink write (DIW) 3D printed FRS using a simple cross-sectional image. By obtaining measurement data for a relatively small number of samples, an artificial neural network (ANN) was trained, and a computer vision algorithm was used to make inferences about foam compression characteristics from a single cross-sectional image. Finally, a genetic algorithm (GA) was used to solve the inverse design problem, generating the AM printing parameters that an engineer should use to achieve a desired compression response from a DIW printed FRS. The methods developed herein present an avenue for entirely autonomous design and analysis of additively manufactured structures using artificial intelligence.
Here, this paper presents a novel battery model parameterization method using actual field measurement and manufacturer datasheet for real-time hardware-in-the-loop (HIL) applications. It is critical that real-time HIL models can accurately reproduce field test results so that tests can be conducted on HIL testbeds instead of in the field. In the past, numerical heuristic optimization algorithms were often used to derive parameters for battery models. However, the deterministic algorithms often reach a locally optimal solution and stochastic heuristic searching strategies suffer from low searching efficiency. Therefore, in this paper, we propose a global-local searching enhanced genetic algorithm (GL-SEGA). By applying the generalized opposition-based learning mechanism, GL-SEGA can efficiently explore the global solution space. By using the trust-region-reflective method to perform the local search, the GL-SEGA can improve the accuracy and convergence in its local exploitations. Field measurements and manufactory datasheets are used to test and validate the accuracy and robustness of the GL-SEGA algorithm.
Battery-electric buses (BEBs) are a promising technology for replacing diesel buses and reducing their environmental burden. However, their charging process can take several hours, depending on the charging technique and strategy, making them susceptible to schedule disruptions. Furthermore, the selection of the charging strategy and battery size can increase the total capital investment and operational expenses of a BEB fleet, which is a major obstacle to its adoption. Therefore, to minimize the total cost of ownership (TCO) and prevent schedule disruptions, it is essential to establish a well-defined approach to determine an appropriate battery size and charging strategy for BEB fleets. This paper presents a method for reducing the TCO of BEB by determining the optimal battery size and charging strategy for each bus while satisfying operating constraints. The method involves a two-step optimization algorithm that uses Dynamic Programming and Genetic Algorithm. Further, the study applies this approach to the bus fleet serving line 21 in Paris and generates the optimal battery sizing, charging strategy, and required charging infrastructure. The results indicate that 100 kWh batteries offer the best trade-off between capital and operational expenditure for the fleet deployment if used with 65–85 kW chargers at bus terminals.
The optimization of a Sodium-cooled Fast Reactor (SFR) core is a challenging process, due to the large number of design parameters, the nonlinearities among inputs and outputs, and the complicated correlation among output parameters. This study attempts to develop a generalized framework for the SFR core optimization by coupling the sensitivity analysis, advanced optimization algorithm, and optionally the surrogate modeling. The framework is built based on the fast reactor modeling capability of the Argonne Reactor Computation (ARC) suite and the sensitivity analysis and optimization modules embedded in the DAKOTA code, both have been integrated within the NEAMS Workbench. The genetic algorithm is selected as the optimization method for its robustness, while the option of surrogate modeling is also explored to alleviate the computational burden caused by employing the ARC direct core physics simulation and thus enhance the efficiency of the optimization. Finally, the normalized deviations of performance parameters of the near-optimal solution from those of the ideal core are calculated and used as criteria to down select the final core design. The developed framework is applied to the Advanced Burner Test Reactor (ABTR) core, and optimal solutions are determined by balancing various objectives simultaneously, including peak fast flux, core volume, power, reactivity swing, plutonium mass feed, while at the same time satisfying the predefined constraints due to safety or economics considerations. The optimal ABTR core design obtained using the direct physical simulation and surrogated model are compared and discussed. It is found that using the accurately constructed surrogate models can significantly reduce the required computational time while maintaining satisfactory accuracy.
The U.S. nuclear sector encounters a difficulty in upholding essential safety standards while also securing economic viability for continued operation. Safety stands as a pivotal factor across all facets of operations within light-water reactor nuclear power plants. Achieving economic feasibility alongside safety can be facilitated through the utilization of a risk-informed framework, exemplified by the ongoing development within the Risk-Informed Systems Analysis Pathway under the auspices of the U.S. Department of Energy's LWRS Program. This initiative advocates for a diverse array of research and development endeavors aimed at optimizing both safety and economic efficacy within nuclear power plants, particularly pertinent as many plants contemplate second license renewals. The Risk-Informed Systems Analysis Pathway has two main goals: deploy methodologies and technologies that better represent safety margins and cost and safety factors and develop advanced applications that enable cost-effective plant operation. This report assesses the potential for resolving multi-cycle plant reload challenges through real-world scenarios utilizing the Plant ReLoad Optimization (PRLO) framework. This framework offers reactor core design developers analytic tools of reactor safety and fuel performance with the assistance of artificial intelligence (AI) to enhance core design solutions. Multi-objective genetic algorithm alongside acceleration techniques is explored as an enabling technology for improving fuel efficiency while upholding safety thresholds. The demonstration of multi-cycle core design optimization is performed. This report investigates the practical application of the PRLO platform in addressing real-world core design challenges, supporting AI efforts, and contrasting outcomes with those derived from heuristic or conventional algorithms.
New designs of unipolar magnetic bearings in electrical industrial machines are optimized by means of genetic algorithms. As a result, the optimal geometric dimensions are determined. On that basis, a design is developed for an electric motor with a unipolar active magnetic bearing.
Wake interactions in wind farms cause losses in annual energy production (AEP) on the order of 10%. Wind farm designers optimize the layout of the farm to mitigate wake losses, especially in the dominant site-specific wind directions. As wind turbines and wind farms grow in scale, optimization becomes more complex. Offshore wind farms regularly comprise more than 100 wind turbines and are characterized by complex boundaries due to shipping lanes, neighboring wind farms, and other constraints. Layout optimization methods are broadly split between gradient-based and gradient-free approaches. Gradient-based approaches can converge quickly and perform well for smaller, academic problems but are often sensitive to initial conditions and tuning parameters and require expert knowledge to use. On the other hand, gradient-free approaches can be more robust to problem complexities. We present a robust layout optimization approach based on a random search algorithm. The algorithm is intended for those who are not optimization experts and has few tuning parameters that need specification to achieve satisfactory results. Unlike off-the-shelf methods, which use generally available, non-domain-specific optimization routines that accept as inputs an optimization function and constraint definitions, this approach takes advantage of the relative computational costs of the different evaluations by evaluating cheaper computations first (boundary and minimum distance constraints) and running expensive AEP evaluations only if all other checks pass. Moreover, an outer genetic algorithm allows multiple solutions to evolve in parallel, enabling rapid solution development on high-performance computers. We discuss the relative ease of selecting necessary tuning parameters and demonstrate the efficacy of the genetic random search on a complex layout problem consisting of placing 70 turbines in a nonconvex and unconnected boundary region.