• Structural Engineering and Mechanics
• /
• v.32 no.5
• /
• pp.667-683
• /
• 2009

FE model-based dynamic analysis has been widely used to predict the dynamic characteristics of civil structures. In a physical point of view, an FE model is unavoidably different from the actual structure as being formulated based on extremely idealized engineering drawings and design data. The conventional model updating methods such as direct method and sensitivity-based parameter estimation are not flexible for model updating of complex and large structures. Thus, it is needed to develop a model updating method applicable to complex structures without restriction. The main objective of this paper is to present the model updating method based on the hybrid genetic algorithm (HGA) by combining the genetic algorithm as global optimization method and modified Nelder-Mead's Simplex method as local optimization method. This FE model updating method using HGA does not need the derivation of derivative function related to parameters and without application of complicated inverse analysis methods. In order to allow its application on diversified and complex structures, a commercial FEA tool is adopted to exploit previously developed element library and analysis algorithms. Moreover, an output-level objective function making use of measurement and analytical results is also presented to update simultaneously the stiffness and mass of the analysis model. The numerical examples demonstrated that the proposed method based on HGA is effective for the updating of the FE model of bridge structures.

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

• Proceedings of the KSME Conference
• /
• 2001.06c
• /
• pp.554-558
• /
• 2001

In this study, a hybrid method is used to search the pseudo-optimal solution for the I-dimentional nesting problem. This method is composed of the genetic algorithm for the global search and a simple heuristic one for the local search near the pseudo optimal solution. Several simulation results show that the hybrid method gives very satisfactory results.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.3
• /
• pp.360-368
• /
• 1999

We consider the problem of scheduling n jobs with sequence-dependent processing times on a set of parallel-identical machines. The processing time of each job consists of a pure processing time and a sequence-dependent setup time. The objective is to maximize the total remaining machine available time which can be used for other tasks. For the problem, a hybrid genetic algorithm is proposed. The algorithm combines a genetic algorithm for global search and a heuristic for local optimization to improve the speed of evolution convergence. The genetic operators are developed such that parallel machines can be handled in an efficient and effective way. For local optimization, the adjacent pairwise interchange method is used. The proposed hybrid genetic algorithm is compared with two heuristics, the nearest setup time method and the maximum penalty method. Computational results for a series of randomly generated problems demonstrate that the proposed algorithm outperforms the two heuristics.

• Proceedings of the KSME Conference
• /
• 2001.11a
• /
• pp.533-538
• /
• 2001

This paper describes a combinational method to compute the global and local solutions of optimization problems. The present hybrid algorithm uses both a genetic algorithm and a local concentrate search algorithm (e. g simplex method). The hybrid algorithm is not only faster than the standard genetic algorithm but also supplies a more accurate solution. In addition, this algorithm can find the global and local optimum solutions. The present algorithm can be supplied to minimize the resonance response (Q factor) and to yield the critical speeds as far from the operating speed as possible. These factors play very important roles in designing a rotor-bearing system under the dynamic behavior constraint. In the present work, the shaft diameter, the bearing length, and clearance are used as the design variables.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.1 no.1
• /
• pp.87-94
• /
• 2001

Silicon nitride films grown by plasma-enhanced chemical vapor deposition (PECVD) are useful for a variety of applications, including anti-reflecting coatings in solar cells, passivation layers, dielectric layers in metal/insulator structures, and diffusion masks. PECVD systems are controlled by many operating variables, including RF power, pressure, gas flow rate, reactant composition, and substrate temperature. The wide variety of processing conditions, as well as the complex nature of particle dynamics within a plasma, makes tailoring SiN film properties very challenging, since it is difficult to determine the exact relationship between desired film properties and controllable deposition conditions. In this study, SiN PECVD modeling using optimized neural networks has been investigated. The deposition of SiN was characterized via a central composite experimental design, and data from this experiment was used to train and optimize feed-forward neural networks using the back-propagation algorithm. From these neural process models, the effect of deposition conditions on film properties has been studied. A recipe synthesis (optimization) procedure was then performed using the optimized neural network models to generate the necessary deposition conditions to obtain several novel film qualities including high charge density and long lifetime. This optimization procedure utilized genetic algorithms, hybrid combinations of genetic algorithm and Powells algorithm, and hybrid combinations of genetic algorithm and simplex algorithm. Recipes predicted by these techniques were verified by experiment, and the performance of each optimization method are compared. It was found that the hybrid combinations of genetic algorithm and simplex algorithm generated recipes produced films of superior quality.

• International Journal of Control, Automation, and Systems
• /
• v.1 no.3
• /
• pp.289-300
• /
• 2003

In this paper, we introduce an identification method in Fuzzy Relation-based Fuzzy Neural Networks (FRFNN) through a hybrid identification algorithm. The proposed FRFNN modeling implement system structure and parameter identification in the efficient form of "If...., then... " statements, and exploit the theory of system optimization and fuzzy rules. The FRFNN modeling and identification environment realizes parameter identification through a synergistic usage of genetic optimization and complex search method. The hybrid identification algorithm is carried out by combining both genetic optimization and the improved complex method in order to guarantee both global optimization and local convergence. An aggregate objective function with a weighting factor is introduced to achieve a sound balance between approximation and generalization of the model. The proposed model is experimented with using two nonlinear data. The obtained experimental results reveal that the proposed networks exhibit high accuracy and generalization capabilities in comparison to other models.er models.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.26 no.6
• /
• pp.1008-1015
• /
• 2002

This paper proposes a combinatorial method to compute the global and local solutions of optimization problem. The present hybrid algorithm is the synthesis of a genetic algorithm and a local concentrate search algorithm (simplex method). The hybrid algorithm is not only faster than the standard genetic algorithm, but also gives a more accurate solution. In addition, this algorithm can find both the global and local optimum solutions. An optimization result is presented to demonstrate that the proposed approach successfully focuses on the advantages of global and local searches. Three numerical examples are also presented in this paper to compare with conventional methods.

• Proceedings of the KSME Conference
• /
• 2003.04a
• /
• pp.1639-1644
• /
• 2003

A hybrid genetic algorithm is developed for estimating the wall emissivities for an absorbing, emitting, and scattering media in a two-dimensional irregular geometry with diffusely emitting and reflecting opaque boundaries by minimizing an objective function, which is expressed by the sum of square errors between estimated and measured temperatures at only four data positions. The finite-volume method was employed to solve the radiative transfer equation for a two-dimensional irregular geometry. The results show that a developed hybrid genetic algorithms reduce the effect of genetic parameters on the performance of genetic algorithm and that the wall emissivities are estimated accurately without measurement errors.

• Korean Management Science Review
• /
• v.17 no.1
• /
• pp.135-144
• /
• 2000

This paper describes a scheduling problem of the panel block assembly shop in a shipbuilding industry. Because the shipbuilding is a labor intensive industry the most important consideration in a panel block assembly shop is the workload balancing. which balances man-hour weight and welding length and so on. It should be determined assembly schedule and workstation considering a daily load balancing and a workstation load balancing simultaneously. To solve the problem we develop a hybrid genetic algorithm. Hybrid genetic algorithm proposed in this paper consists of two phases. The first phase uses the heuristic method to find a initial feasible solution which provides a useful information about optimal solution. The second phase proposes the genetic algorithm to derive the optimal solution with the initial population consisting of feasible solutions based on the initial solution. Finally we carried out computational experiments for this load balancing problem which indicate that developed method is effective for finding good solutions.