• Title/Summary/Keyword: Local Optimization Algorithm

Search Result 482, Processing Time 0.033 seconds

Topology and size optimization of truss structures using an improved crow search algorithm

  • Mashayekhi, Mostafa;Yousefi, Roghayeh
    • Structural Engineering and Mechanics
    • /
    • v.77 no.6
    • /
    • pp.779-795
    • /
    • 2021
  • In the recent decades, various optimization algorithms have been considered for the optimization of structures. In this research, a new enhanced algorithm is used for the size and topology optimization of truss structures. This algorithm, which is obtained from the combination of Crow Search Algorithm (CSA) and the Cellular Automata (CA) method, is called CA-CSA method. In the first iteration of the CA-CSA method, some of the best designs of the crow's memory are first selected and then located in the cells of CA. Then, a random cell is selected from CA, and the best design is chosen from the selected cell and its neighborhood; it is considered as a "local superior design" (LSD). In the optimization process, the LSD design is used to modify the CSA method. Numerical examples show that the CA-CSA method is more effective than CSA in the size and topology optimization of the truss structures.

A Local Path Planning Algorithm considering the Mobility of UGV based on the Binary Map (무인차량의 주행성능을 고려한 장애물 격자지도 기반의 지역경로계획)

  • Lee, Young-Il;Lee, Ho-Joo;Ko, Jung-Ho
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.13 no.2
    • /
    • pp.171-179
    • /
    • 2010
  • A fundamental technology of UGV(Unmanned Ground Vehicle) to perform a given mission with success in various environment is a path planning method which generates a safe and optimal path to the goal. In this paper, we suggest a local path-planning method of UGV based on the binary map using world model data which is gathered from terrain perception sensors. In specially, we present three core algorithms such as shortest path computation algorithm, path optimization algorithm and path smoothing algorithm those are used in the each composition module of LPP component. A simulation is conducted with M&S(Modeling & Simulation) system in order to verify the performance of each core algorithm and the performance of LPP component with scenarios.

A Study on Hybrid Approach for Improvement of Optimization Efficiency using a Genetic Algorithm and a Local Minimization Algorithm (최적화의 효율향상을 위한 유전해법과 직접탐색법의 혼용에 관한 연구)

  • Lee, Dong-Kon;Kim, S.Y.;Lee, C.U.
    • IE interfaces
    • /
    • v.8 no.1
    • /
    • pp.23-30
    • /
    • 1995
  • Optimization in the engineering design is to select the best of many possible design alternatives in a complex design space. One major problem of local minimization algorithm is that they often result in local optima. In this paper, a hybrid method was developed by coupling the genetic algorithm and a traditional direct search method. The proposed method first finds a region for possible global optimum using the genetic algorithm and then searchs for a global optimum using the direct search method. To evaluate the performance of the hybrid method, it was applied to three test problems and a problem of designing corrugate bulkhead of a ship.

  • PDF

Electromagnetic topology optimization using large-step markov chain method with novel local optimization algorithm (LSMC를 이용한 전자기 위상 최적화)

  • Koh Yuri;Im Chang-Hwan;Jung Hyun-Kyo
    • Proceedings of the KIEE Conference
    • /
    • summer
    • /
    • pp.944-946
    • /
    • 2004
  • In this paper, a new technique for electromagnetic topology optimization is proposed. The proposed technique is based on the large-step Markov chain (LSMC) method with novel local optimization algorithm. Because the proposed algorithm keeps a good convergence characteristic of LSMC, fast convergence is assured. The proposed LSMC is verified by an application to an inverse reconstruction problem.

  • PDF

Study on Aerodynamic Optimization Design Process of Multistage Axial Turbine

  • Zhao, Honglei;Tan, Chunqing;Wang, Songtao;Han, Wanjin;Feng, Guotai
    • Proceedings of the Korean Society of Propulsion Engineers Conference
    • /
    • 2008.03a
    • /
    • pp.130-135
    • /
    • 2008
  • An aerodynamic optimization design process of multistage axial turbine is presented in this article: first, applying quasi-three dimensional(Q3D) design methods to conduct preliminary design and then adopting modern optimization design methods to implement multistage local optimization. Quasi-three dimensional(Q3D) design methods, which mainly refer to S2 flow surface direct problem calculation, adopt the S2 flow surface direct problem calculation program of Harbin Institute of Technology. Multistage local optimization adopts the software of Numeca/Design3D, which jointly adopts genetic algorithm and artificial neural network. The major principle of the methodology is that the successive design evaluation is performed by using an artificial neural network instead of a flow solver and the genetic algorithms may be used in an efficient way. Flow computation applies three-dimensional viscosity Navier Stokes(N-S) equation solver. Such optimization process has three features: (i) local optimization based on aerodynamic performance of every cascade; (ii) several times of optimizations being performed to every cascade; and (iii) alternate use of coarse grid and fine grid. Such process was applied to optimize a three-stage axial turbine. During the optimization, blade shape and meridional channel were respectively optimized. Through optimization, the total efficiency increased 1.3% and total power increased 2.4% while total flow rate only slightly changed. Therefore, the total performance was improved and the design objective was achieved. The preliminary design makes use of quasi-three dimensional(Q3D) design methods to achieve most reasonable parameter distribution so as to preliminarily enhance total performance. Then total performance will be further improved by adopting multistage local optimization design. Thus the design objective will be successfully achieved without huge expenditure of manpower and calculation time. Therefore, such optimization design process may be efficiently applied to the aerodynamic design optimization of multistage axial turbine.

  • PDF

Training Artificial Neural Networks and Convolutional Neural Networks using WFSO Algorithm (WFSO 알고리즘을 이용한 인공 신경망과 합성곱 신경망의 학습)

  • Jang, Hyun-Woo;Jung, Sung Hoon
    • Journal of Digital Contents Society
    • /
    • v.18 no.5
    • /
    • pp.969-976
    • /
    • 2017
  • This paper proposes the learning method of an artificial neural network and a convolutional neural network using the WFSO algorithm developed as an optimization algorithm. Since the optimization algorithm searches based on a number of candidate solutions, it has a drawback in that it is generally slow, but it rarely falls into the local optimal solution and it is easy to parallelize. In addition, the artificial neural networks with non-differentiable activation functions can be trained and the structure and weights can be optimized at the same time. In this paper, we describe how to apply WFSO algorithm to artificial neural network learning and compare its performances with error back-propagation algorithm in multilayer artificial neural networks and convolutional neural networks.

A Hybrid Genetic Algorithm for Generating Cutting Paths of a Laser Torch (레이저 토치의 절단경로 생성을 위한 혼합형 유전알고리즘)

  • 이문규;권기범
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.8 no.12
    • /
    • pp.1048-1055
    • /
    • 2002
  • The problem of generating torch paths for 2D laser cutting of a stock plate nested with a set of free-formed parts is investigated. The objective is to minimize the total length of the torch path starting from a blown depot, then visiting all the given Parts, and retuning back to the depot. A torch Path consists of the depot and Piercing Points each of which is to be specified for cutting a part. The torch path optimization problem is shown to be formulated as an extended version of the standard travelling salesman problem To solve the problem, a hybrid genetic algorithm is proposed. In order to improve the speed of evolution convergence, the algorithm employs a genetic algorithm for global search and a combination of an optimization technique and a genetic algorithm for local optimization. Traditional genetic operators developed for continuous optimization problems are used to effectively deal with the continuous nature of piercing point positions. Computational results are provided to illustrate the validity of the proposed algorithm.

Intelligent Control of Induction Motor Using Hybrid System GA-PSO

  • Kim, Dong-Hwa;Park, Jin-Il
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.1086-1091
    • /
    • 2005
  • This paper focuses on intelligent control of induction motor by hybrid system consisting of GA-PSO. Induction motor has been using in industrial area. However, it is challengeable on how we control effectively. From this point, an optimal solution using GA (Genetic Algorithm) and PSO (Particle Swarm Optimization) is introduced to intelligent control. In this case, it is possible to obtain local solution because chromosomes or individuals which have only a close affinity can convergent. To improve an optimal learning solution of control, This paper deal with applying PSO and Euclidian data distance to mutation procedure on GA's differentiation. Through this approaches, we can have global and local optimal solution together, and the faster and the exact optimal solution without any local solution. Four test functions are used for proof of this suggested algorithm.

  • PDF

HS-PSO Hybrid Optimization Algorithm for HS Performance Improvement (HS 성능 향상을 위한 HS-PSO 하이브리드 최적화 알고리즘)

  • Tae-Bong Lee
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.16 no.4
    • /
    • pp.203-209
    • /
    • 2023
  • Harmony search(HS) does not use the evaluation of individual harmony when referring to HM when constructing a new harmony, but particle swarm optimization(PSO), on the contrary, uses the evaluation value of individual particles and the evaluation value of the population to find a solution. However, in this study, we tried to improve the performance of the algorithm by finding and identifying similarities between HS and PSO and applying the particle improvement process of PSO to HS. To apply the PSO algorithm, the local best of individual particles and the global best of the swam are required. In this study, the process of HS improving the worst harmony in harmony memory(HM) was viewed as a process very similar to that of PSO. Therefore, the worst harmony of HM was regarded as the local best of a particle, and the best harmony was regarded as the global best of swam. In this way, the performance of the HS was improved by introducing the particle improvement process of the PSO into the HS harmony improvement process. The results of this study were confirmed by comparing examples of optimization values for various functions. As a result, it was found that the suggested HS-PSO was much better than the existing HS in terms of accuracy and consistency.

Topology optimization of nonlinear single layer domes by a new metaheuristic

  • Gholizadeh, Saeed;Barati, Hamed
    • Steel and Composite Structures
    • /
    • v.16 no.6
    • /
    • pp.681-701
    • /
    • 2014
  • The main aim of this study is to propose an efficient meta-heuristic algorithm for topology optimization of geometrically nonlinear single layer domes by serially integration of computational advantages of firefly algorithm (FA) and particle swarm optimization (PSO). During the optimization process, the optimum number of rings, the optimum height of crown and tubular section of the member groups are determined considering geometric nonlinear behaviour of the domes. In the proposed algorithm, termed as FA-PSO, in the first stage an optimization process is accomplished using FA to explore the design space then, in the second stage, a local search is performed using PSO around the best solution found by FA. The optimum designs obtained by the proposed algorithm are compared with those reported in the literature and it is demonstrated that the FA-PSO converges to better solutions spending less computational cost emphasizing on the efficiency of the proposed algorithm.