Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA nested genetic algorithm strategy for the optimal plastic design of frames
139
0
0.0
(
0
)
Added by
Alessandro Pluchino
Publication date
2020
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
An innovative strategy for the optimal design of planar frames able to resist to seismic excitations is here proposed. The procedure is based on genetic algorithms (GA) which are performed according to a nested structure suitable to be implemented in parallel computing on several devices. In particular, this solution foresees two nested genetic algorithms. The first one, named External GA, seeks, among a predefined list of profiles, the size of the structural elements of the frame which correspond to the most performing solution associated to the highest value of an appropriate fitness function. The latter function takes into account, among other considerations, of the seismic safety factor and the failure mode which are calculated by means of the second algorithm, named Internal GA. The details of the proposed procedure are provided and applications to the seismic design of two frames of different size are described.
rate research
Read More
We review algorithms for protein design in general. Although these algorithms have a rich combinatorial, geometric, and mathematical structure, they are almost never covered in computer science classes. Furthermore, many of these algorithms admit provable guarantees of accuracy, soundness, complexity, completeness, optimality, and approximation bounds. The algorithms represent a delicate and beautiful balance between discrete and continuous computation and modeling, analogous to that which is seen in robotics, computational geometry, and other fields in computational science. Finally, computer scientists may be unaware of the almost direct impact of these algorithms for predicting and introducing molecular therapies that have gone in a short time from mathematics to algorithms to software to predictions to preclinical testing to clinical trials. Indeed, the overarching goal of these algorithms is to enable the development of new therapeutics that might be impossible or too expensive to discover using experimental methods. Thus the potential impact of these algorithms on individual, community, and global health has the potential to be quite significant.
This paper presents a Material Mask Overlay Strategy topology optimization approach with improved material assignment at the element level for achieving close to black-and-white designs for pressure-loaded problems. Hexagonal elements are employed to parametrize the design domain as this tessellation provides nonsingular local connectivity. Elliptical negative masks are used to find the optimized material layout. The material dilation and material erosion variables of each mask are systematically varied in association with a gray-scale measure constraint to achieve designs close to 0-1. Darcys law in association with a drainage term is used to formulate the pressure field. The obtained pressure field is converted into the consistent nodal forces using Wachspress shape functions. Sensitivities of the objective and pressure load are evaluated using the adjoint-variable method. The approach is demonstrated by solving various pressure-loaded structures and pressure-actuated compliant mechanisms. Compliance is minimized for loadbearing structures, whereas a multicriteria objective is minimized for mechanism designs.
Quality by design in pharmaceutical manufacturing hinges on computational methods and tools that are capable of accurate quantitative prediction of the design space. This paper investigates Bayesian approaches to design space characterization, which determine a feasibility probability that can be used as a measure of reliability and risk by the practitioner. An adaptation of nested sampling---a Monte Carlo technique introduced to compute Bayesian evidence---is presented. The nested sampling algorithm maintains a given set of live points through regions with increasing probability feasibility until reaching a desired reliability level. It furthermore leverages efficient strategies from Bayesian statistics for generating replacement proposals during the search. Features and advantages of this algorithm are demonstrated by means of a simple numerical example and two industrial case studies. It is shown that nested sampling can outperform conventional Monte Carlo sampling and be competitive with flexibility-based optimization techniques in low-dimensional design space problems. Practical aspects of exploiting the sampled design space to reconstruct a feasibility probability map using machine learning techniques are also discussed and illustrated. Finally, the effectiveness of nested sampling is demonstrated on a higher-dimensional problem, in the presence of a complex dynamic model and significant model uncertainty.
Graph representation of structured data can facilitate the extraction of stereoscopic features, and it has demonstrated excellent ability when working with deep learning systems, the so-called Graph Neural Networks (GNNs). Choosing a promising architecture for constructing GNNs can be transferred to a hyperparameter optimisation problem, a very challenging task due to the size of the underlying search space and high computational cost for evaluating candidate GNNs. To address this issue, this research presents a novel genetic algorithm with a hierarchical evaluation strategy (HESGA), which combines the full evaluation of GNNs with a fast evaluation approach. By using full evaluation, a GNN is represented by a set of hyperparameter values and trained on a specified dataset, and root mean square error (RMSE) will be used to measure the quality of the GNN represented by the set of hyperparameter values (for regression problems). While in the proposed fast evaluation process, the training will be interrupted at an early stage, the difference of RMSE values between the starting and interrupted epochs will be used as a fast score, which implies the potential of the GNN being considered. To coordinate both types of evaluations, the proposed hierarchical strategy uses the fast evaluation in a lower level for recommending candidates to a higher level, where the full evaluation will act as a final assessor to maintain a group of elite individuals. To validate the effectiveness of HESGA, we apply it to optimise two types of deep graph neural networks. The experimental results on three benchmark datasets demonstrate its advantages compared to Bayesian hyperparameter optimization.
Multitasking optimization is an incipient research area which is lately gaining a notable research momentum. Unlike traditional optimization paradigm that focuses on solving a single task at a time, multitasking addresses how multiple optimization problems can be tackled simultaneously by performing a single search process. The main objective to achieve this goal efficiently is to exploit synergies between the problems (tasks) to be optimized, helping each other via knowledge transfer (thereby being referred to as Transfer Optimization). Furthermore, the equally recent concept of Evolutionary Multitasking (EM) refers to multitasking environments adopting concepts from Evolutionary Computation as their inspiration for the simultaneous solving of the problems under consideration. As such, EM approaches such as the Multifactorial Evolutionary Algorithm (MFEA) has shown a remarkable success when dealing with multiple discrete, continuous, single-, and/or multi-objective optimization problems. In this work we propose a novel algorithmic scheme for Multifactorial Optimization scenarios - the Multifactorial Cellular Genetic Algorithm (MFCGA) - that hinges on concepts from Cellular Automata to implement mechanisms for exchanging knowledge among problems. We conduct an extensive performance analysis of the proposed MFCGA and compare it to the canonical MFEA under the same algorithmic conditions and over 15 different multitasking setups (encompassing different reference instances of the discrete Traveling Salesman Problem). A further contribution of this analysis beyond performance benchmarking is a quantitative examination of the genetic transferability among the problem instances, eliciting an empirical demonstration of the synergies emerged between the different optimization tasks along the MFCGA search process.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
