• Title/Summary/Keyword: global optimization

Search Result 1,118, Processing Time 0.024 seconds

Development of NASTRAN-based Optimization Framework for Vibration Optimum Design of Ship Structure. (선박 구조물의 진동 최적설계를 위한 NASTRAN 기반 최적화 프레임웍의 제안)

  • Kong, Y.M.;Choi, S.H.;Chae, S.I.;Song, J.D.;Kim, Y.H.;Yang, B.S.
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.15 no.11 s.104
    • /
    • pp.1223-1231
    • /
    • 2005
  • Recently, the issue of ship nitration due to the large scale, high speed and lightweight of ship is emerging. For pleasantness in the cabin, shipbuilders are asked for strict vibration criteria and the degree of nitration level at a deckhouse became an important condition for taking order from customers. This study proposes a new optimization framework that is NASTRAN external call type optimization method (OptShip) and applies to an optimum design to decrease the nitration level of a deckhouse. The merits of this method are capable of using of global searching method and selecting of various objective function and design variables. The global optimization algorithms used here are random tabu search method which has fast converging speed and searches various size domains and genetic algorithm which searches multi-point solutions and has a good search capability in a complex space. By adapting OptShip to full-scale model, the validity of the suggested method was investigated.

Evolutionary-base finite element model updating and damage detection using modal testing results

  • Vahidi, Mehdi;Vahdani, Shahram;Rahimian, Mohammad;Jamshidi, Nima;Kanee, Alireza Taghavee
    • Structural Engineering and Mechanics
    • /
    • v.70 no.3
    • /
    • pp.339-350
    • /
    • 2019
  • This research focuses on finite element model updating and damage assessment of structures at element level based on global nondestructive test results. For this purpose, an optimization system is generated to minimize the structural dynamic parameters discrepancies between numerical and experimental models. Objective functions are selected based on the square of Euclidean norm error of vibration frequencies and modal assurance criterion of mode shapes. In order to update the finite element model and detect local damages within the structural members, modern optimization techniques is implemented according to the evolutionary algorithms to meet the global optimized solution. Using a simulated numerical example, application of genetic algorithm (GA), particle swarm (PSO) and artificial bee colony (ABC) algorithms are investigated in FE model updating and damage detection problems to consider their accuracy and convergence characteristics. Then, a hybrid multi stage optimization method is presented merging advantages of PSO and ABC methods in finding damage location and extent. The efficiency of the methods have been examined using two simulated numerical examples, a laboratory dynamic test and a high-rise building field ambient vibration test results. The implemented evolutionary updating methods show successful results in accuracy and speed considering the incomplete and noisy experimental measured data.

Optimal seismic retrofit design method for asymmetric soft first-story structures

  • Dereje, Assefa Jonathan;Kim, Jinkoo
    • Structural Engineering and Mechanics
    • /
    • v.81 no.6
    • /
    • pp.677-689
    • /
    • 2022
  • Generally, the goal of seismic retrofit design of an existing structure using energy dissipation devices is to determine the optimum design parameters of a retrofit device to satisfy a specified limit state with minimum cost. However, the presence of multiple parameters to be optimized and the computational complexity of performing non-linear analysis make it difficult to find the optimal design parameters in the realistic 3D structure. In this study, genetic algorithm-based optimal seismic retrofit methods for determining the required number, yield strength, and location of steel slit dampers are proposed to retrofit an asymmetric soft first-story structure. These methods use a multi-objective and single-objective evolutionary algorithms, each of which varies in computational complexity and incorporates nonlinear time-history analysis to determine seismic performance. Pareto-optimal solutions of the multi-objective optimization are found using a non-dominated sorting genetic algorithm (NSGA-II). It is demonstrated that the developed multi-objective optimization methods can determine the optimum number, yield strength, and location of dampers that satisfy the given limit state of a three-dimensional asymmetric soft first-story structure. It is also shown that the single-objective distribution method based on minimizing plan-wise stiffness eccentricity turns out to produce similar number of dampers in optimum locations without time consuming nonlinear dynamic analysis.

A Fast Global Mobility Supporting Scheme for IPv6 Using Global Mobility Agent (GMA) (Global Mobility Agent (GMA) 기반의 신속한 IPv6 전역 이동성 지원 방안)

  • Ahn, Jin-Su;Seo, Won-Kyeong;Choi, Jae-In;Cho, You-Ze
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.8B
    • /
    • pp.1105-1114
    • /
    • 2010
  • The Proxy Mobile IPv6 (PMIPv6) has been standardized by the IETF NETLMM WG for network-based mobility management. The PMIPv6 can provide IP mobility for Mobile Nodes (MNs) with low handover latency and less wireless resource usage. But, since the PMIPv6 is basically designed for local mobility management, it cannot support directly global mobility management between different PMIPv6 domains. In the PMIPv6, since all traffic is routed through a Local Mobility Anchor (LMA), it causes a long end-to-end delay and triangular routing problem. Therefore, in this paper, we propose a fast network-based global mobility management scheme and route optimization scheme with a new network entity, called Global Mobility Agent (GMA). Numerical analysis and simulation results show that the proposed scheme is able to support global mobility between different public domains with low handover latency and low end-to-end delay, compared with the PMIPv6.

Physics-based Surrogate Optimization of Francis Turbine Runner Blades, Using Mesh Adaptive Direct Search and Evolutionary Algorithms

  • Bahrami, Salman;Tribes, Christophe;von Fellenberg, Sven;Vu, Thi C.;Guibault, Francois
    • International Journal of Fluid Machinery and Systems
    • /
    • v.8 no.3
    • /
    • pp.209-219
    • /
    • 2015
  • A robust multi-fidelity optimization methodology has been developed, focusing on efficiently handling industrial runner design of hydraulic Francis turbines. The computational task is split between low- and high-fidelity phases in order to properly balance the CFD cost and required accuracy in different design stages. In the low-fidelity phase, a physics-based surrogate optimization loop manages a large number of iterative optimization evaluations. Two derivative-free optimization methods use an inviscid flow solver as a physics-based surrogate to obtain the main characteristics of a good design in a relatively fast iterative process. The case study of a runner design for a low-head Francis turbine indicates advantages of integrating two derivative-free optimization algorithms with different local- and global search capabilities.

Base Station Location Optimization in Mobile Communication System (이동 통신 시스템에서 기지국 위치의 최적화)

  • 변건식;이성신;장은영;오정근
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.14 no.5
    • /
    • pp.499-505
    • /
    • 2003
  • In the design of mobile wireless communication system, base station location is one of the most important parameters. Designing base station location, the cost must be minimized by combining various, complex parameters. We can solve this problem by combining optimization algorithm, such as Simulated Annealing, Tabu Search, Genetic Algorithm, Random Walk Algorithm that have been used extensively fur global optimization. This paper shows the 4 kinds of algorithm to be applied to the optimization of base station location for communication system and then compares, analyzes the results and shows optimization process of algorithm.

Implementation of Particle Swarm Optimization Method Using CUDA (CUDA를 이용한 Particle Swarm Optimization 구현)

  • Kim, Jo-Hwan;Kim, Eun-Su;Kim, Jong-Wook
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.5
    • /
    • pp.1019-1024
    • /
    • 2009
  • In this paper, particle swarm optimization(PSO) is newly implemented by CUDA(Compute Unified Device Architecture) and is applied to function optimization with several benchmark functions. CUDA is not CPU but GPU(Graphic Processing Unit) that resolves complex computing problems using parallel processing capacities. In addition, CUDA helps one to develop GPU softwares conveniently. Compared with the optimization result of PSO executed on a general CPU, CUDA saves about 38% of PSO running time as average, which implies that CUDA is a promising frame for real-time optimization and control.

An Optimization Method Based on Hybrid Genetic Algorithm for Scramjet Forebody/Inlet Design

  • Zhou, Jianxing;Piao, Ying;Cao, Zhisong;Qi, Xingming;Zhu, Jianhong
    • Proceedings of the Korean Society of Propulsion Engineers Conference
    • /
    • 2008.03a
    • /
    • pp.469-475
    • /
    • 2008
  • The design of a scramjet inlet is a process to search global optimization results among those factors influencing the geometry of scramjet in their ranges for some requirements. An optimization algorithm of hybrid genetic algorithm based on genetic algorithm and simplex algorithm was established for this purpose. With the sample provided by a uniform method, the compressive angles which also are wedge angles of the inlet were chosen as the inlet design variables, and the drag coefficient, total pressure recovery coefficient, pressure rising ratio and the combination of these three variables are designed specifically as different optimization objects. The contrasts of these four optimization results show that the hybrid genetic algorithm developed in this paper can capably implement the optimization process effectively for the inlet design and demonstrate some good adaptability.

  • PDF

Performance Improvement of Genetic Algorithms through Fusion of Queen-bee Evolution into the Rank-based Control of Mutation Probability (등급기준 돌연변이 확률조절에 여왕벌진화의 융합을 통한 유전자알고리즘의 성능 향상)

  • Jung, Sung-Hoon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.49 no.4
    • /
    • pp.54-61
    • /
    • 2012
  • This paper proposes a fusion method of the queen-bee evolution into the rank-based control of mutation probability for improving the performances of genetic algorithms. The rank-based control of mutation probability which showed some performance improvements than the original method was a method that prevented individuals of genetic algorithms from falling into local optimum areas and also made it possible for the individuals to get out of the local optimum areas if they fell into there. This method, however, showed not good performances at the optimization problems that had a global optimum located in a small area regardless of the number of local optimum areas. We think that this is because the method is insufficient in the convergence into the global optimum, so propose a fusion method of the queen-bee evolution into this method in this paper. The queen-bee evolution inspired by reproduction process of queen-bee is a method that can strengthen the convergency of genetic algorithms. From the extensive experiments with four function optimization problems in order to measure the performances of proposed method we could find that the performances of proposed method was considerably good at the optimization problems whose global optimum is located in a small area as we expected. Our method, however, showed not good performances at the problems whose global optima were distributed in broad ranges and even showed bad performances at the problems whose global optima were located far away. These results indicate that our method can be effectively used at the problems whose global optimum is located in a small area.

Dual-Algorithm Maximum Power Point Tracking Control Method for Photovoltaic Systems based on Grey Wolf Optimization and Golden-Section Optimization

  • Shi, Ji-Ying;Zhang, Deng-Yu;Ling, Le-Tao;Xue, Fei;Li, Ya-Jing;Qin, Zi-Jian;Yang, Ting
    • Journal of Power Electronics
    • /
    • v.18 no.3
    • /
    • pp.841-852
    • /
    • 2018
  • This paper presents a dual-algorithm search method (GWO-GSO) combining grey wolf optimization (GWO) and golden-section optimization (GSO) to realize maximum power point tracking (MPPT) for photovoltaic (PV) systems. First, a modified grey wolf optimization (MGWO) is activated for the global search. In conventional GWO, wolf leaders possess the same impact on decision-making. In this paper, the decision weights of wolf leaders are automatically adjusted with hunting progression, which is conducive to accelerating hunting. At the later stage, the algorithm is switched to GSO for the local search, which play a critical role in avoiding unnecessary search and reducing the tracking time. Additionally, a novel restart judgment based on the quasi-slope of the power-voltage curve is introduced to enhance the reliability of MPPT systems. Simulation and experiment results demonstrate that the proposed algorithm can track the global maximum power point (MPP) swiftly and reliably with higher accuracy under various conditions.