scholarly journals An Automated Structural Optimisation Methodology for Scissor Structures Using a Genetic Algorithm

2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
Aushim Koumar ◽  
Tine Tysmans ◽  
Rajan Filomeno Coelho ◽  
Niels De Temmerman

We developed a fully automated multiobjective optimisation framework using genetic algorithms to generate a range of optimal barrel vault scissor structures. Compared to other optimisation methods, genetic algorithms are more robust and efficient when dealing with multiobjective optimisation problems and provide a better view of the search space while reducing the chance to be stuck in a local minimum. The novelty of this work is the application and validation (using metrics) of genetic algorithms for the shape and size optimisation of scissor structures, which has not been done so far for two objectives. We tested the feasibility and capacity of the methodology by optimising a 6 m span barrel vault to weight and compactness and by obtaining optimal solutions in an efficient way using NSGA-II. This paper presents the framework and the results of the case study. The in-depth analysis of the influence of the optimisation variables on the results yields new insights which can help in making choices with regard to the design variables, the constraints, and the number of individuals and generations in order to obtain efficiently a trade-off of optimal solutions.

Author(s):  
H S Ismail ◽  
K K B Hon

The general two-dimensional cutting stock problem is concerned with the optimum layout and arrangement of two-dimensional shapes within the spatial constraints imposed by the cutting stock. The main objective is to maximize the utilization of the cutting stock material. This paper presents some of the results obtained from applying a combination of genetic algorithms and heuristic approaches to the nesting of dissimilar shapes. Genetic algorithms are stochastically based optimization approaches which mimic nature's evolutionary process in finding global optimal solutions in a large search space. The paper discusses the method by which the problem is defined and represented for analysis and introduces a number of new problem-specific genetic algorithm operators that aid in the rapid conversion to an optimum solution.


2014 ◽  
Vol 984-985 ◽  
pp. 419-424
Author(s):  
P. Sabarinath ◽  
M.R. Thansekhar ◽  
R. Saravanan

Arriving optimal solutions is one of the important tasks in engineering design. Many real-world design optimization problems involve multiple conflicting objectives. The design variables are of continuous or discrete in nature. In general, for solving Multi Objective Optimization methods weight method is preferred. In this method, all the objective functions are converted into a single objective function by assigning suitable weights to each objective functions. The main drawback lies in the selection of proper weights. Recently, evolutionary algorithms are used to find the nondominated optimal solutions called as Pareto optimal front in a single run. In recent years, Non-dominated Sorting Genetic Algorithm II (NSGA-II) finds increasing applications in solving multi objective problems comprising of conflicting objectives because of low computational requirements, elitism and parameter-less sharing approach. In this work, we propose a methodology which integrates NSGA-II and Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) for solving a two bar truss problem. NSGA-II searches for the Pareto set where two bar truss is evaluated in terms of minimizing the weight of the truss and minimizing the total displacement of the joint under the given load. Subsequently, TOPSIS selects the best compromise solution.


2010 ◽  
Vol 34 (3-4) ◽  
pp. 463-474 ◽  
Author(s):  
Abolfazl Khalkhali ◽  
Mohamadhosein Sadafi ◽  
Javad Rezapour ◽  
Hamed Safikhani

Net energy stored (Q net) and the discharge time of Phase Change Material (t PCM) in a solar system, are important conflicting objectives to be optimized simultaneously. In the present paper, multi-objective genetic algorithms (GAs) are used for Pareto approach optimization of a solar system using modified NSGA II algorithms. The competing objectives are Q net and t PCM and design variables are some geometrical parameters of solar system. It is shown that some interesting and important relationships as useful optimal design principles involved in the performance of solar system can be discovered. These important results can be used for better design of a solar system.


2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Anis Ammous ◽  
Abdulrahman Alahdal ◽  
Kaiçar Ammous

A new approach to the optimal design of power inverters for on-grid photovoltaic systems that uses genetic algorithms (GA) is provided in this article. The nonlinear average model is adopted to model the conversion stage in order to accurately evaluate and quickly estimate the power losses of the power devices. The hysteresis current control that guarantees a quasi-sinusoidal output current is applied to generate the inverter control signals. The design of the solar inverter must meet three contradictory objectives that need to be optimized at the same time. In fact, the aim is to maximize the efficiency of the converter while minimizing its size and price under electrical constraints. The problem variables are the output current ripple and the passive and active components available on the market (IGBTs/MOSFETs, Diodes, Inductors). NSGA-II (Elitist Nondominated Sorting Genetic Algorithm) is appropriate in the case where discrete design variables are used to search for optimal Pareto solutions. It carries out a systematic and efficient search among the developed databases for a set of components which define the optimal structures of the inverter. The introduced method makes the design task easier since the best solutions depend on the components available on the market and significantly reduces the time to market for manufacturers.


2019 ◽  
Vol 3 (Special Issue on First SACEE'19) ◽  
pp. 173-180
Author(s):  
Giorgia Di Gangi ◽  
Giorgio Monti ◽  
Giuseppe Quaranta ◽  
Marco Vailati ◽  
Cristoforo Demartino

The seismic performance of timber light-frame shear walls is investigated in this paper with a focus on energy dissipation and ductility ensured by sheathing-to-framing connections. An original parametric finite element model has been developed in order to perform sensitivity analyses. The model considers the design variables affecting the racking load-carrying capacity of the wall. These variables include aspect ratio (height-to-width ratio), fastener spacing, number of vertical studs and framing elements cross-section size. A failure criterion has been defined based on the observation of both the global behaviour of the wall and local behaviour of fasteners in order to identify the ultimate displacement of the wall. The equivalent viscous damping has been numerically assessed by estimating the damping factor which is in use in the capacity spectrum method. Finally, an in-depth analysis of the results obtained from the sensitivity analyses led to the development of a simplified analytical procedure which is able to predict the capacity curve of a timber light-frame shear wall.


Author(s):  
Yugang Chen ◽  
Jingyu Zhai ◽  
Qingkai Han

In this paper, the damping capacity and the structural influence of the hard coating on the given bladed disk are optimized by the non-dominated sorting genetic algorithm (NSGA-II) coupled with the Kriging surrogate model. Material and geometric parameters of the hard coating are taken as the design variables, and the loss factors, frequency variations and weight gain are considered as the objective functions. Results of the bi-objective optimization are obtained as curved line of Pareto front, and results of the triple-objective optimization are obtained as Pareto front surface with an obvious frontier. The results can give guidance to the designer, which can help to achieve more superior performance of hard coating in engineering application.


Author(s):  
Abdullah Türk ◽  
Dursun Saral ◽  
Murat Özkök ◽  
Ercan Köse

Outfitting is a critical stage in the shipbuilding process. Within the outfitting, the construction of pipe systems is a phase that has a significant effect on time and cost. While cutting the pipes required for the pipe systems in shipyards, the cutting process is usually performed randomly. This can result in large amounts of trim losses. In this paper, we present an approach to minimize these losses. With the proposed method it is aimed to base the pipe cutting process on a specific systematic. To solve this problem, Genetic Algorithms (GA), which gives successful results in solving many problems in the literature, have been used. Different types of genetic operators have been used to investigate the search space of the problem well. The results obtained have proven the effectiveness of the proposed approach.


2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
V. Gonuguntla ◽  
R. Mallipeddi ◽  
Kalyana C. Veluvolu

Differential evolution (DE) is simple and effective in solving numerous real-world global optimization problems. However, its effectiveness critically depends on the appropriate setting of population size and strategy parameters. Therefore, to obtain optimal performance the time-consuming preliminary tuning of parameters is needed. Recently, different strategy parameter adaptation techniques, which can automatically update the parameters to appropriate values to suit the characteristics of optimization problems, have been proposed. However, most of the works do not control the adaptation of the population size. In addition, they try to adapt each strategy parameters individually but do not take into account the interaction between the parameters that are being adapted. In this paper, we introduce a DE algorithm where both strategy parameters are self-adapted taking into account the parameter dependencies by means of a multivariate probabilistic technique based on Gaussian Adaptation working on the parameter space. In addition, the proposed DE algorithm starts by sampling a huge number of sample solutions in the search space and in each generation a constant number of individuals from huge sample set are adaptively selected to form the population that evolves. The proposed algorithm is evaluated on 14 benchmark problems of CEC 2005 with different dimensionality.


Sign in / Sign up

Export Citation Format

Share Document