• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.33 no.11
• /
• pp.1195-1201
• /
• 2009

In this study, effective methods for reliability estimation and reliability-based design optimization(RBDO) are proposed using kriging metamodel and genetic algorithm. In our previous study, we proposed the accurate method for reliability estimation using two-staged kriging metamodel and genetic algorithm. In this study, the possibility of applying the previously proposed method to RBDO is investigated. The efficiency and accuracy of that method were much improved than those of the first order reliability method(FORM). Finally, the effective method for RBDO is proposed and applied to numerical examples. The results are compared to the existing RBDO methods and shown to be very effective and accurate.

• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.5
• /
• pp.93-99
• /
• 2000

In many dynamic structural optimization problems, the goal is to reduce the total weight of the structure without causing the resonance. Up to now, gradient informations(i.e., design sensitivity) have been used to achieve the goal. For some class of dynamic problems, especially coalescent eigenvalue Problems with multiobjective optimization, the design sensitivity analysis is too much complicated mathematically and numerically. Therefore, this article proposes a new technique fur structural dynamic modification using a mode modification method with Genetic Algorithm(GA). In GA formulation, fitness is defined based on penalty function approach. Design variables are iteratively improved by using genetic algorithm. Two numerical examples are shown, (ⅰ) a cantilevered plate, and (ⅱ) H-shaped structure. The results demonstrate that the proposed method is highly efficient.

• 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.

• Journal of Computing Science and Engineering
• /
• v.10 no.4
• /
• pp.118-127
• /
• 2016

An improved sample balanced genetic algorithm and Extreme Learning Machine (iSBGA-ELM) was designed for accurate diagnosis of Alzheimer disease (AD) and identification of biomarkers associated with AD in this paper. The proposed AD diagnosis approach uses a set of magnetic resonance imaging scans in Open Access Series of Imaging Studies (OASIS) public database to build an efficient AD classifier. The approach contains two steps: "voxels selection" based on an iSBGA and "AD classification" based on the ELM. In the first step, the proposed iSBGA searches for a robust subset of voxels with promising properties for further AD diagnosis. The robust subset of voxels chosen by iSBGA is then used to build an AD classifier based on the ELM. A robust subset of voxels keeps a high generalization performance of AD classification in various scenarios and highlights the importance of the chosen voxels for AD research. The AD classifier with maximum classification accuracy is created using an optimal subset of robust voxels. It represents the final AD diagnosis approach. Experiments with the proposed iSBGA-ELM using OASIS data set showed an average testing accuracy of 87%. Experiments clearly indicated the proposed iSBGA-ELM was efficient for AD diagnosis. It showed improvements over existing techniques.

• Journal of Korea Multimedia Society
• /
• v.9 no.1
• /
• pp.119-126
• /
• 2006

The task scheduling in multiprocessor system is one of the key elements in the effective utilization of multiprocessor systems. The optimal assignment of tasks to multiprocessor is, in almost practical cases, an NP-hard problem. Consequently algorithms based on various modern heuristics have been proposed for practical reason. This paper proposes a new task scheduling algorithm using Genetic Algorithm which combines simulated annealing (GA+SA) in multiprocessor environment. In solution algorithms, the Genetic Algorithm (GA) and the simulated annealing (SA) are cooperatively used. In this method, the convergence of GA is improved by introducing the probability of SA as the criterion for acceptance of new trial solution. The objective of proposed scheduling algorithm is to minimize makespan. The effectiveness of the proposed algorithm is shown through simulation studies. In simulation studies, the result of proposed algorithm is better than that of any other algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.1
• /
• pp.177-182
• /
• 2010

The forward convener is one of power supplies used widely. This paper presents parameter tuning methods to obtain optimal circuit element values for the forward converter to minimize the output voltage variation under various load changing environments. The conventional method using the concept of the phase margin is extended to have optimal phase margin that gives slightly improved performance in the output voltage response. For this, the phase margin becomes the tuning parameter and is optimized with the genetic algorithm. Next, the circuit element values are directly chosen as the tuning parameters and also optimized using the genetic algorithm to have very improved performance in the output voltage control of the forward converter.

• International Journal of Contents
• /
• v.3 no.1
• /
• pp.34-38
• /
• 2007

Load redistribution is a critical resource in computer system. In sender-initiated load redistribution algorithms, the sender continues to send unnecessary request messages for load transfer until a receiver is found while the system load is heavy. These unnecessary request messages result in inefficient communications, low CPU utilization, and low system throughput in distributed systems. To solve these problems, we propose a genetic algorithm based approach for improved sender-initiated load redistribution in distributed systems. Compared with the conventional sender-initiated algorithms, the proposed algorithm decreases the response time and task processing time.

• Journal of the Korean Society of Radiology
• /
• v.14 no.1
• /
• pp.69-75
• /
• 2020

Multilayer mirrors have widely been used not only in the industry but also in the medical field. X-ray reflectivity was measured by X-ray diffractometer to evaluate the performance of W/C multilayer mirror with 40 layers. Genetic algorithm are used to obtain thickness, density, and interfacial roughness for each of the 40 layers. The existing uniform random selection causes a problem that the solution does not converge or the error increases even if it convergence. To reduce the time to calculate the fitness of the genetic algorithm, the genetic algorithm was written in C/C++ parallel programming. The genetic algorithm showed excellent scalability of linear time increase with increasing number of generation and population. The genetic algorithm was selected with uniform and Gaussian randomness of 1:1 to improve the convergence of solution. The improved genetic algorithm can be applied to characterize each layer of a sample with more than a few tens of layers, such as a multilayer mirror.

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.1
• /
• pp.50-56
• /
• 2003

In electrical impedance tomography(EIT), various image reconstruction algorithms have been used in order to compute the internal resistivity distribution of the unknown object with its electric potential data at the boundary. Mathematically the EIT image reconstruction algorithm is a nonlinear ill-posed inverse problem. This paper presents a new combined method based on genetic algorithm(GA) and modified Newton-Raphson(mNR) algorithm via two-step approach for the solution of the static EIT inverse problem. In the first step, each mesh is classified into three mesh groups: target, background, and temporary groups. The mNR algorithm can be used to determine the region of group. In the second step, the values of these resistivities are determined using genetic algorithm. Computer simulations with the 32 channels synthetic data show that the spatial resolution of reconstructed images by the proposed scheme is improved compared to that of the mNR algorithm at the expense of increased computational burden.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.8 no.5
• /
• pp.1279-1288
• /
• 2007

A vehicle routing problem with time constraint is one of the must important problem in distribution and logistics. In practice, the service for a customer must start and finish within a given delivery time. This study is concerned about the development of a model to optimize vehicle routing problem under the multi-logistics center problem. And we used a two-step approach with an improved genetic algorithm. In step one, a sector clustering model is developed by transfer the multi-logistics center problem to a single logistics center problem which is more easy to be solved. In step two, we developed a GA-TSP model with an improved genetic algorithm which can search a optimize vehicle routing with given time constraints. As a result, we developed a Network VRP computer programs according to the proposed solution VRP used ActiveX and distributed object technology.