• Title/Summary/Keyword: Algorithm optimization

Search Result 5,667, Processing Time 0.028 seconds

Structural Optimization for Non-Linear Behavior Using Equivalent Static Loads (I) (선형 등가정하중을 이용한 비선형 거동 구조물의 최적설계 (I) - 알고리듬 -)

  • Park Ki-Jong;Park Gyung-Jin
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.29 no.8 s.239
    • /
    • pp.1051-1060
    • /
    • 2005
  • Nonlinear Response Optimization using Equivalent Static Loads (NROESL) method/algorithm is proposed to perform optimization of non-linear response structures. The conventional method spends most of the total design time on nonlinear analysis. The NROESL algorithm makes the equivalent static load cases for each response and repeatedly performs linear response optimization and uses them as multiple loading conditions. The equivalent static loads are defined as the loads in the linear analysis, which generates the same response field as those in non-linear analysis. The algorithm is validated for the convergence and the optimality. The proposed algorithm is applied to a simple mathematical problem to verify the convergence and the optimality.

Shape Optimization of High Voltage Gas Circuit Breaker Using Kriging-Based Model And Genetic Algorithm (크리깅 메타모델과 유전자 알고리즘을 이용한 초고압 가스차단기의 형상 최적 설계)

  • Kwak, Chang-Seob;Kim, Hong-Kyu;Cha, Jeong-Won
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.62 no.2
    • /
    • pp.177-183
    • /
    • 2013
  • We describe a new method for selecting design variables for shape optimization of high-voltage gas circuit breaker using a Kriging meta-model and a genetic algorithm. Firstly we sample balance design variables using the Latin Hypercube Sampling. Secondly, we build meta-model using the Kriging. Thirdly, we search the optimal design variables using a genetic algorithm. To obtain the more exact design variable, we adopt the boundary shifting method. With the proposed optimization frame, we can get the improved interruption design and reduce the design time by 80%. We applied the proposed method to the optimization of multivariate optimization problems as well as shape optimization of a high - voltage gas circuit breaker.

Jaya algorithm to solve single objective size optimization problem for steel grillage structures

  • Dede, Tayfun
    • Steel and Composite Structures
    • /
    • v.26 no.2
    • /
    • pp.163-170
    • /
    • 2018
  • The purpose of this paper is to present a new and efficient optimization algorithm called Jaya for optimum design of steel grillage structure. Constrained size optimization of this type of structure based on the LRFD-AISC is carried out with integer design variables by using cross-sectional area of W-shapes. The objective function of the problem is to find minimum weight of the grillage structure. The maximum stress ratio and the maximum displacement in the inner point of steel grillage structure are taken as the constraint for this optimization problem. To calculate the moment and shear force of the each member and calculate the joint displacement, the finite elements analysis is used. The developed computer program for the analysis and design of grillage structure and the optimization algorithm for Jaya are coded in MATLAB. The results obtained from this study are compared with the previous works for grillage structure. The results show that the Jaya algorithm presented in this study can be effectively used in the optimal design of grillage structures.

Direction Vector for Efficient Structural Optimization with Genetic Algorithm (효율적 구조최적화를 위한 유전자 알고리즘의 방향벡터)

  • Lee, Hong-Woo
    • Journal of Korean Association for Spatial Structures
    • /
    • v.8 no.3
    • /
    • pp.75-82
    • /
    • 2008
  • In this study, the modified genetic algorithm, D-GA, is proposed. D-GA is a hybrid genetic algorithm combined a simple genetic algorithm and the local search algorithm using direction vectors. Also, two types of direction vectors, learning direction vector and random direction vector, are defined without the sensitivity analysis. The accuracy of D-GA is compared with that of simple genetic algorithm. It is demonstrated that the proposed approach can be an effective optimization technique through a minimum weight structural optimization of ten bar truss.

  • PDF

Simplified dolphin echolocation algorithm for optimum design of frame

  • Kaveh, Ali;Vaez, Seyed Rohollah Hoseini;Hosseini, Pedram
    • Smart Structures and Systems
    • /
    • v.21 no.3
    • /
    • pp.321-333
    • /
    • 2018
  • Simplified Dolphin Echolocation (SDE) algorithm is a recently developed meta-heuristic algorithm. This algorithm is an improved and simplified version of the Dolphin Echolocation Optimization (DEO) method, based on the baiting behavior of the dolphins. The main advantage of the SDE algorithm is that it needs no empirical parameter. In this paper, the SDE algorithm is applied for optimization of three well-studied frame structures. The designs are then compared with those of other meta-heuristic methods from the literature. Numerical results show the efficiency of the SDE algorithm and its competitive ability with other well-established meta-heuristics methods.

Machine learning-based design automation of CMOS analog circuits using SCA-mGWO algorithm

  • Vijaya Babu, E;Syamala, Y
    • ETRI Journal
    • /
    • v.44 no.5
    • /
    • pp.837-848
    • /
    • 2022
  • Analog circuit design is comparatively more complex than its digital counterpart due to its nonlinearity and low level of abstraction. This study proposes a novel low-level hybrid of the sine-cosine algorithm (SCA) and modified grey-wolf optimization (mGWO) algorithm for machine learning-based design automation of CMOS analog circuits using an all-CMOS voltage reference circuit in 40-nm standard process. The optimization algorithm's efficiency is further tested using classical functions, showing that it outperforms other competing algorithms. The objective of the optimization is to minimize the variation and power usage, while satisfying all the design limitations. Through the interchange of scripts for information exchange between two environments, the SCA-mGWO algorithm is implemented and simultaneously simulated. The results show the robustness of analog circuit design generated using the SCA-mGWO algorithm, over various corners, resulting in a percentage variation of 0.85%. Monte Carlo analysis is also performed on the presented analog circuit for output voltage and percentage variation resulting in significantly low mean and standard deviation.

Adaptive symbiotic organisms search (SOS) algorithm for structural design optimization

  • Tejani, Ghanshyam G.;Savsani, Vimal J.;Patel, Vivek K.
    • Journal of Computational Design and Engineering
    • /
    • v.3 no.3
    • /
    • pp.226-249
    • /
    • 2016
  • The symbiotic organisms search (SOS) algorithm is an effective metaheuristic developed in 2014, which mimics the symbiotic relationship among the living beings, such as mutualism, commensalism, and parasitism, to survive in the ecosystem. In this study, three modified versions of the SOS algorithm are proposed by introducing adaptive benefit factors in the basic SOS algorithm to improve its efficiency. The basic SOS algorithm only considers benefit factors, whereas the proposed variants of the SOS algorithm, consider effective combinations of adaptive benefit factors and benefit factors to study their competence to lay down a good balance between exploration and exploitation of the search space. The proposed algorithms are tested to suit its applications to the engineering structures subjected to dynamic excitation, which may lead to undesirable vibrations. Structure optimization problems become more challenging if the shape and size variables are taken into account along with the frequency. To check the feasibility and effectiveness of the proposed algorithms, six different planar and space trusses are subjected to experimental analysis. The results obtained using the proposed methods are compared with those obtained using other optimization methods well established in the literature. The results reveal that the adaptive SOS algorithm is more reliable and efficient than the basic SOS algorithm and other state-of-the-art algorithms.

Improvement of Topology Algorithm's Convergence Rate Using Chaotic Map (카오틱 맵을 이용한 위상 최적화 알고리즘의 수렴속도 향상)

  • Kim, Yong-Ho;Kim, Gi-Chul;Lee, Jae-Hwan;Jang, Hyo-Jae;Han, Seog-Young
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.23 no.3
    • /
    • pp.279-283
    • /
    • 2014
  • Recently, a topology algorithm based on the artificial bee colony algorithm (ABCA) has been proposed for static and dynamic topology optimization. From the results, the convergence rate of the algorithm was determined to be slightly slow. Therefore, we propose a new search method to improve the convergence rate of the algorithm using a chaotic map. We investigate the effect of the chaotic map on the convergence rate of the algorithm in static and dynamic topology optimization. The chaotic map has been applied to three cases, namely, employ bee search, onlooker bee search, and both employ bee as well as onlooker bee search steps. It is verified that the case in which the logistic function of the chaotic map is applied to both employ bee as well as onlooker bee search steps shows the best dynamic topology optimization, improved by 5.89% compared to ABCA. Therefore, it is expected that the proposed algorithm can effectively be applied to dynamic topology optimization to improve the convergence rate.

A new swarm intelligent optimization algorithm: Pigeon Colony Algorithm (PCA)

  • Yi, Ting-Hua;Wen, Kai-Fang;Li, Hong-Nan
    • Smart Structures and Systems
    • /
    • v.18 no.3
    • /
    • pp.425-448
    • /
    • 2016
  • In this paper, a new Pigeon Colony Algorithm (PCA) based on the features of a pigeon colony flying is proposed for solving global numerical optimization problems. The algorithm mainly consists of the take-off process, flying process and homing process, in which the take-off process is employed to homogenize the initial values and look for the direction of the optimal solution; the flying process is designed to search for the local and global optimum and improve the global worst solution; and the homing process aims to avoid having the algorithm fall into a local optimum. The impact of parameters on the PCA solution quality is investigated in detail. There are low-dimensional functions, high-dimensional functions and systems of nonlinear equations that are used to test the global optimization ability of the PCA. Finally, comparative experiments between the PCA, standard genetic algorithm and particle swarm optimization were performed. The results showed that PCA has the best global convergence, smallest cycle indexes, and strongest stability when solving high-dimensional, multi-peak and complicated problems.

Simulated squirrel search algorithm: A hybrid metaheuristic method and its application to steel space truss optimization

  • Pauletto, Mateus P.;Kripka, Moacir
    • Steel and Composite Structures
    • /
    • v.45 no.4
    • /
    • pp.579-590
    • /
    • 2022
  • One of the biggest problems in structural steel calculation is the design of structures using the lowest possible material weight, making this a slow and costly process. To achieve this objective, several optimization methods have been developed and tested. Nevertheless, a method that performs very efficiently when applied to different problems is not yet available. Based on this assumption, this work proposes a hybrid metaheuristic algorithm for geometric and dimensional optimization of space trusses, called Simulated Squirrel Search Algorithm, which consists of an association of the well-established neighborhood shifting algorithm (Simulated Annealing) with a recently developed promising population algorithm (Squirrel Search Algorithm, or SSA). In this study, two models are tried, being respectively, a classical model from the literature (25-bar space truss) and a roof system composed of space trusses. The structures are subjected to resistance and displacement constraints. A penalty function using Fuzzy Logic (FL) is investigated. Comparative analyses are performed between the Squirrel Search Algorithm (SSSA) and other optimization methods present in the literature. The results obtained indicate that the proposed method can be competitive with other heuristics.