• Journal of the Korean Operations Research and Management Science Society
• /
• v.32 no.1
• /
• pp.77-91
• /
• 2007

In this paper, we present a symbiotic evolutionary algorithm for multi-objective optimization. The goal in multi-objective evolutionary algorithms (MOEAs) is to find a set of well-distributed solutions close to the true Pareto optimal solutions. Most of the existing MOEAs operate one population that consists of individuals representing the entire solution to the problem. The proposed algorithm has a two-leveled structure. The structure is intended to improve the capability of searching diverse and food solutions. At the lower level there exist several populations, each of which represents a partial solution to the entire problem, and at the upper level there is one population whose individuals represent the entire solutions to the problem. The parallel search with partial solutions at the lower level and the Integrated search with entire solutions at the upper level are carried out simultaneously. The performance of the proposed algorithm is compared with those of the existing algorithms in terms of convergence and diversity. The optimization problems with continuous variables and discrete variables are used as test-bed problems. The experimental results confirm the effectiveness of the proposed algorithm.

• Proceedings of the KSME Conference
• /
• 2004.04a
• /
• pp.1005-1010
• /
• 2004

The structural optimization has been carried out in the continuous design space or in the discrete design space. Generally, available designs are discrete in design practice. But methods for discrete variables are extremely expensive in computational cost. In order to overcome this weakness, an iterative optimization algorithm was proposed for design in the discrete space, which is called as a sequential algorithm using orthogonal arrays (SOA). We focus to verify the fact that the local solution can be obtained throughout the optimization with this algorithm. The local solution is defined in discrete design space. Then the search space, which is the set of candidate values of each design variables formed by the neighborhood of current design point, is defined. It is verified that a local solution can be founded by moving sequentially the search space. The SOA algorithm has been applied to problems such as truss type structures. Then it is confirmed that a local solution can be obtained using the SOA algorithm

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.7 no.4
• /
• pp.566-576
• /
• 1995

A Computational code has been developed in order to design axial fans by the numerical optimization techniques incorporated with flow analysis code solving three-dimensional Navier-Stokes equation. The steepest descent method and the conjugate gradient method are used to look for the search direction in the design space, and the golden section method is used for one-dimensional search. To solve the constrained optimization problem, sequential unconstrained minimization technique, SUMT, is used with imposed quadratic extended interior penalty functions. In the optimization of two-dimensional cascade design, the ratio of drag coefficient to lift coefficient is minimized by the design variables such as maximum thickness, maximum ordinate of camber and chord wise position of maximum ordinate. In the application of this numerical optimization technique to the design of an axial fan, the efficiency is maximized by the design variables related to the sweep angle distributed by quadratic function along the hub to tip of fan.

• Economic Analysis
• /
• v.26 no.4
• /
• pp.39-64
• /
• 2020

Typical business cycle models have difficulties in explaining key macroeconomic labor market variables, such as employment and unemployment, as they usually consider labor hour choices only. In this paper, we introduce labor market search and matching frictions into a New Keynesian nominal rigidity model and estimate it by Bayesian methods to examine the dynamics of the key labor market variables and business cycles in Korea. The results show that unemployment rates are largely explained by technology shocks, which affect the labor demand side, as well as labor supply shocks. In addition, wage bargaining shocks originating from the bargaining process between firms and workers have non-negligible negative effects on output and employment growth, and careful measures need to be taken to limit their adverse effects.

• Journal of Ocean Engineering and Technology
• /
• v.21 no.2 s.75
• /
• pp.75-80
• /
• 2007

The design variables for structural systems, in most practical designs, are chosen from a list of discrete values, which are commercially available sizing. This paper presents the application of Genetic Algorithms for determining the optimum design for two-dimensional structures with discrete and pseudocontinuous design variables. Genetic Algorithms are heuristic search algorithms and are effective tools for finding global solutions for discrete optimization. In this paper, Genetic Algorithms are used as the method of Elitism and penalty parameters, in order to improve fitness in the reproduction process. Examples in this paper include: 10 bar planar truss and 1 bay 8-story frame. Truss with discrete and pseudoucontinuous design variables and steel frame with W-sections are used for the design of discrete optimization.

• Journal of Ocean Engineering and Technology
• /
• v.24 no.6
• /
• pp.109-113
• /
• 2010

We present the minimum weight optimum design of cross sectional for frame structures subject to natural frequency. The optimum design in this paper employ discrete and continuous design variables and Genetic Algorithms. In this paper, Genetic Algorithms is used in optimization process, and be used the method of Elitism and penalty parameters in order to improved fitness in the reproduction process. For 1-Bay 2-Story frame structure, in examples, continuous and discrete design variables are used, and W-section (No.1~No.64), from AISC, discrete data are used in discrete optimization. In this case, Exhaustive search are used for finding global optimum. Continuous variables are used for 1-Bay 7-Story frame structure. Two typical frame structure optimization examples are employed to demonstrate the availability of Genetic Algorithms for solving minimum weight optimum of frame structures with fundamental and multi frequency.

• Transactions of Materials Processing
• /
• v.16 no.1 s.91
• /
• pp.54-60
• /
• 2007

Optimum injection molding condition for a box mold was searched by the Response Surface Analysis(RSA) with the aid of process monitoring system(PMS). Process variables on the control panel of the injection molding machine such as barrel temperatures, screw speed profile, holding pressures, etc. cannot guarantee the uniformity of the material variables directly related with the state of the product in the mold cavity. In order to make sure the state of the resin in the cavity, pressures and temperatures in the cavity, runner and nozzle were monitored in the experiment with the PMS. To accomplish the consistency of the molding process, dependent variables such as the switchover point and holding time were searched with the PMS. With a proper objective function about deflection of the box-type product, the optimum injection molding condition was obtained.

• The KSFM Journal of Fluid Machinery
• /
• v.12 no.4
• /
• pp.44-53
• /
• 2009

Numerical design optimization of a fan-shaped hole for film-cooling has been carried out to improve film-cooling effectiveness by combining a three-dimensional Reynolds-averaged Navier-Stokes analysis with the radial basis neural network method, a well known surrogate modeling technique for optimization. The injection angle of hole, lateral expansion angle of hole and ratio of length-to-diameter of the hole are chosen as design variables and spatially averaged film-cooling effectiveness is considered as an objective function which is to be maximized. Twenty training points are obtained by Latin Hypercube sampling for three design variables. Sequential quadratic programming is used to search for the optimal point from the constructed surrogate. The film-cooling effectiveness has been successfully improved by the optimization with increased value of all design variables as compared to the reference geometry.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2000.10a
• /
• pp.115-124
• /
• 2000

An efficient multi-level (EML) optimization algorithm using discrete variables of framed structures is proposed in this paper. For the efficiency of the proposed algorithm multi-level optimization techniques using a decomposition method that separates both system-level and element-level are incorporated in the algorithm In the system-level, to save the numerical efforts an efficient reanalysis technique through approximated structural responses such as moments and frequencies with respect to intermediate variables is proposed in the paper. Sensitivity analysis of dynamic structural response is executed by automatic differentiation (AD) that is a powerful technique for computing complex or implicit derivatives accurately and efficiently with minimal human effort. In the element-level, to use AISC W-sections a section search algorithm is introduced. The efficiency and robustness of the EML algorithm, compared with a conventional multi-level (CML) algorithm and single-level genetic algorithm is successfully demonstrated in the numerical examples.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.12
• /
• pp.43-53
• /
• 1997

In this paper, the optimal synthesis algorithm of multiple-valued logic circuits using universal logic modules (ULM) U$_{f}$ based on 3-variable ternary reed-muller expansions is presented. We check the degree of each varable for the coefficients of reed-muller expansions and determine the order of optimal control input variables that minimize the number of ULM U$_{f}$ modules. The order of optimal control input variables is utilized the realization of multiple-valued logic circuits to be constructed by ULM U$_{f}$ modules based on reed-muller expansions using the circuit cost matrix. This algorithm is performed only unit time in order to search for the optimal control input variables. Also, this algorithm is able to be programmed by computer and the run time on programming is O(p$^{n}$ ).