• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.7 no.3
• /
• pp.3-11
• /
• 2008

Robust design pioneered by Dr. G. Taguchi has been applied to versatile engineering problems for improving quality. Since 1980s, the Taguchi method has been introduced to numerical optimization, complementing the deficiencies of deterministic optimization, which is often called the robust optimization. In this study, the robust optimization strategy is proposed by considering the robustness of objective and constraint functions. The statistics of responses in the functions are surrogated by kriging models. In addition, objective and/or constraint function is represented by the probability of success, thus facilitating robust optimization. The mathematical problem and the two-bar design problem are investigated to show the validity of the proposed method.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2004.04a
• /
• pp.151-160
• /
• 2004

Genetic algorithm is the theory of grafting the principle of survival of the fittest in genetics on to the computer algorithm and it is used to solve the optimization problems, especially the shape and size optimization of the structure in Architectural problems. In the size optimization problem discrete variables are used, but series variables have to be used in the shape optimization problem because of the incongruenty. The purpose of this study is to obtain the optimum shape of cable domes by using the real coding genetic algorithm. Generally, the structural performance of the cable domes is influenced very sensitively by pre-stress, geometry and length of the mast because of its flexible characteristic. So, it is very important to decide the optimum shape to get maximum stiffness of cable domes. We use the model to verify the usefulness of this algorithm for shape optimization and analyze the roof system of Seoul Olympic Gymnastic Arena as analytical model of a practical structures. It is confirmed lastly that the optimum shape domes have more stiffness than initial shape ones.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.7
• /
• pp.179-189
• /
• 1994

A two-phase neural network finds exact feasible solutions for a constrained optimization programming problem. The time-varying programming neural network is a modified steepest-gradient algorithm which solves time-varying optimization problems. In this paper, we propose a time-varying two-phase optimization neural network which incorporates the merits of the two-phase neural network and the time-varying neural network. The proposed algorithm is applied to system identification and function approximation using a multi-layer perceptron. Particularly training of a multi-layer perceptrion is regarded as a time-varying optimization problem. Our algorithm can also be applied to the case where the weights are constrained. Simulation results prove the proposed algorithm is efficient for solving various optimization problems.

• Proceedings of the Korean Society For Composite Materials Conference
• /
• 2000.04a
• /
• pp.143-148
• /
• 2000

In this article, we presents multi-objective design optimization of laminated composite beam using Fuzzy programming method. At first, the two design objectives are minimizing the structural weight and maximizing the buckling load respectively. Fuzzy multi-optimization problem can be formulated based on results of single optimizations. Due to different relative importance of design objectives, membership functions are constructed by adding exponential parameters for different objective's weights. Finite element analysis of composite beam for buckling behavior are carried by Natural mode method proposed by J.Argyris and computational time of analysis can be reduced. With this scheme, a designer can conveniently obtain a compromise optimal solution of a multi-objective optimization problem only by providing some exponential parameters corresponding to the importance of the objective functions.

• Journal of the Korea Institute of Building Construction
• /
• v.12 no.6
• /
• pp.664-673
• /
• 2012

Determining the layout of temporary facilities that support construction activities at a site is an important planning activity, as layout can significantly affect cost, quality of work, safety, and other aspects of the project. The construction site layout problem involves difficult combinatorial optimization. Recently, various artificial intelligence(AI)-based algorithms have been applied to solving many complex optimization problems, including neural networks(NN), genetic algorithms(GA), and swarm intelligence(SI) which relates to the collective behavior of social systems such as honey bees and birds. This study proposes a site facility layout optimization algorithm based on self-organizing maps(SOM). Computational experiments are carried out to justify the efficiency of the proposed method and compare it with particle swarm optimization(PSO). The results show that the proposed algorithm can be efficiently employed to solve the problem of site layout.

• Structural Engineering and Mechanics
• /
• v.67 no.3
• /
• pp.245-254
• /
• 2018

In this paper, a Cloud Model based Fruit Fly Optimization Algorithm (CMFOA) is presented for structural damage identification, which is a global optimization algorithm inspired by the foraging behavior of fruit fly swarm. It is assumed that damage only leads to the decrease in elementary stiffness. The differences on time-domain structural acceleration data are used to construct the objective function, which transforms the damaged identification problem of a structure into an optimization problem. The effectiveness, efficiency and accuracy of the CMFOA are demonstrated by two different numerical simulation structures, including a simply supported beam and a cantilevered plate. Numerical results show that the CMFOA has a better capacity for structural damage identification than the basic Fruit Fly Optimization Algorithm (FOA) and the CMFOA is not sensitive to measurement noise.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.05a
• /
• pp.330-334
• /
• 2004

Java bytecode is stack-base code. Stack-base code makes analysis and optimization hardly because use stack access imperative. Therefore, fragment of code that is problem that occur in stack-base code optimization, loss of type information, unnecessary Load and Store can appear. Optimization and analysis of bytecode design bytecode framework by solution way of problem that is difficult. This paper indicates optimization of bytecode and hangup of analysis, and describe research contents about existent byte code optimization technology. This propose byte code framework by the alternative to simplify analysis and optimization of byte code.

• Journal of the Korean Society for Precision Engineering
• /
• v.18 no.11
• /
• pp.155-160
• /
• 2001

To achieve high precision cutting as well as production capability in the machine tool, it is needed to develop excellent rigidity statically, dynamically and thermally as well. In order to predict the qualitative behavior of a machine tool, simultaneous analysis of mechanics and heat transfer is required. Generally, machine tool designers have solved designing problems based on partial estimation of the specified rigidity. This study clears the inter-relationship between therm, and propose multi-phase optimization of machine tool structure using a genetic algorithm. The multi-phase solution method is consists of a series of mechanical design problem. At this first phase of static design problem, multi-objective optimization for the purpose of minimization of the total weight and static compliance minimization is solved using the Pareto Genetic Algorithm.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1999.10a
• /
• pp.359-369
• /
• 1999

The paper describes the study of concurrent subspace optimization(CSSO) for coupled multidisciplinary design optimization (MDO) techniques in mechanical systems. This method is a solution to large scale coupled multidisciplinary system, wherein the original problem is decomposed into a set of smaller, more tractable subproblems. Key elements in CSSO are consisted of global sensitivity equation(GSE), subspace optimization (SSO), optimum sensitivity analysis(OSA), and coordination optimization problem(COP) so as to inquiry valanced design solutions finally, Automatic differentiation has an ability to provide a robust sensitivity solution, and have shown the numerical numerical effectiveness over finite difference schemes wherein the perturbed step size in design variable is required. The present paper will develop the automatic differentiation based concurrent subspace optimization(AD-CSSO) in MDO. An automatic differentiation tool in FORTRAN(ADIFOR) will be employed to evaluate sensitivities. The use of exact function derivatives in GSE, OSA and COP makes Possible to enhance the numerical accuracy during the iterative design process. The paper discusses how much influence on final optimal design compared with traditional all-in-one approach, finite difference based CSSO and AD-CSSO applying coupled design variables.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.68 no.1
• /
• pp.159-166
• /
• 2019

Due to the various engagement situations, it is very difficult to generate the optimal trajectory with several constraints. This paper investigates the sequential convex programming for the impact angle control with the additional constraint of altitude limit. Recently, the SOCP(Second-Order Cone Programming), which is one area of the convex optimization, is widely used to solve variable optimal problems because it is robust to initial values, and resolves problems quickly and reliably. The trajectory optimization problem is reconstructed as convex optimization problem using appropriate linearization and discretization. Finally, simulation results are compared with analytic result and nonlinear optimization result for verification.