scholarly journals Correction to: An effective solution to numerical and multi-disciplinary design optimization problems using chaotic slime mold algorithm

Author(s):  
Dinesh Dhawale ◽  
Vikram Kumar Kamboj ◽  
Priyanka Anand
Author(s):  
Po Ting Lin ◽  
Wei-Hao Lu ◽  
Shu-Ping Lin

In the past few years, researchers have begun to investigate the existence of arbitrary uncertainties in the design optimization problems. Most traditional reliability-based design optimization (RBDO) methods transform the design space to the standard normal space for reliability analysis but may not work well when the random variables are arbitrarily distributed. It is because that the transformation to the standard normal space cannot be determined or the distribution type is unknown. The methods of Ensemble of Gaussian-based Reliability Analyses (EoGRA) and Ensemble of Gradient-based Transformed Reliability Analyses (EGTRA) have been developed to estimate the joint probability density function using the ensemble of kernel functions. EoGRA performs a series of Gaussian-based kernel reliability analyses and merged them together to compute the reliability of the design point. EGTRA transforms the design space to the single-variate design space toward the constraint gradient, where the kernel reliability analyses become much less costly. In this paper, a series of comprehensive investigations were performed to study the similarities and differences between EoGRA and EGTRA. The results showed that EGTRA performs accurate and effective reliability analyses for both linear and nonlinear problems. When the constraints are highly nonlinear, EGTRA may have little problem but still can be effective in terms of starting from deterministic optimal points. On the other hands, the sensitivity analyses of EoGRA may be ineffective when the random distribution is completely inside the feasible space or infeasible space. However, EoGRA can find acceptable design points when starting from deterministic optimal points. Moreover, EoGRA is capable of delivering estimated failure probability of each constraint during the optimization processes, which may be convenient for some applications.


2012 ◽  
Vol 215-216 ◽  
pp. 592-596
Author(s):  
Li Gao ◽  
Rong Rong Wang

In order to deal with complex product design optimization problems with both discrete and continuous variables, mix-variable collaborative design optimization algorithm is put forward based on collaborative optimization, which is an efficient way to solve mix-variable design optimization problems. On the rule of “divide and rule”, the algorithm decouples the problem into some relatively simple subsystems. Then by using collaborative mechanism, the optimal solution is obtained. Finally, the result of a case shows the feasibility and effectiveness of the new algorithm.


Proceedings ◽  
2018 ◽  
Vol 2 (22) ◽  
pp. 1400
Author(s):  
Johannes Schmelcher ◽  
Max Kleine Büning ◽  
Kai Kreisköther ◽  
Dieter Gerling ◽  
Achim Kampker

Energy-efficient electric motors are gathering an increased attention since they are used in electric cars or to reduce operational costs, for instance. Due to their high efficiency, permanent-magnet synchronous motors are used progressively more. However, the need to use rare-earth magnets for such high-efficiency motors is problematic not only in regard to the cost but also in socio-political and environmental aspects. Therefore, an increasing effort has to be put in finding the best design possible. The goals to achieve are, among others, to reduce the amount of rare-earth magnet material but also to increase the efficiency. In the first part of this multipart paper, characteristics of optimization problems in engineering and general methods to solve them are presented. In part two, different approaches to the design optimization problem of electric motors are highlighted. The last part will evaluate the different categories of optimization methods with respect to the criteria: degrees of freedom, computing time and the required user experience. As will be seen, there is a conflict of objectives regarding the criteria mentioned above. Requirements, which a new optimization method has to fulfil in order to solve the conflict of objectives will be presented in this last paper.


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.


2020 ◽  
Vol 6 (8) ◽  
pp. 1411-1427 ◽  
Author(s):  
Yan-Cang Li ◽  
Pei-Dong Xu

In order to find a more effective method in structural optimization, an improved wolf pack optimization algorithm was proposed. In the traditional wolf pack algorithm, the problem of falling into local optimum and low precision often occurs. Therefore, the adaptive step size search and Levy's flight strategy theory were employed to overcome the premature flaw of the basic wolf pack algorithm. Firstly, the reasonable change of the adaptive step size improved the fineness of the search and effectively accelerated the convergence speed. Secondly, the search strategy of Levy's flight was adopted to expand the search scope and improved the global search ability of the algorithm. At last, to verify the performance of improved wolf pack algorithm, it was tested through simulation experiments and actual cases, and compared with other algorithms. Experiments show that the improved wolf pack algorithm has better global optimization ability. This study provides a more effective solution to structural optimization problems.


Sign in / Sign up

Export Citation Format

Share Document