• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.16 no.3 s.108
• /
• pp.298-306
• /
• 2006

In our previous paper, we developed a robust saturation controller for the linear time-invariant (LTI) system involving both actuator's saturation and structured real parameter uncertainties. This controller can only guarantee the closed-loop robust stability of the system in the presence of actuator's saturation. But we cannot analytically make any comment on control performance of this controller. In this paper, we suggest a method to use linear matrix inequality (LMI) optimization problem which can analytically explain control performance of this robust saturation controller only in nominal system. The availability of design method using LMI optimization problem for this robust saturation controller is verified through a numerical example for the building with an active mass damper (AMD) system.

• Journal of Advanced Marine Engineering and Technology
• /
• v.38 no.10
• /
• pp.1340-1346
• /
• 2014

Previous studies of reliable server assignment considered only to assign the same cost of server, that is, homogeneous servers. In this paper, we generally deal with reliable server assignment with different server costs, i.e., heterogeneous servers. We formulate this problem as a nonlinear integer programming mathematically. Our problem is defined as determining a deployment of heterogeneous servers to maximize a measure of service availability. We propose two metaheuristic algorithms (tabu search and particle swarm optimization) for solving the problem of reliable server assignment. From the computational results, we notice that our tabu search outstandingly outperforms particle swarm optimization for all test problems. In terms of solution quality and computing time, the proposed method is recommended as a promising metaheuristic for a kind of reliability optimization problems including reliable sever assignment and e-Navigation system.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.10
• /
• pp.1597-1604
• /
• 2001

Alternative computational scheme is presented fur reliability based optimal design using a modified advanced first order second moment (AFOSH) method. Both design variables and design parameters are considered as random variables about their nominal values. Each probability constraint is transformed into a sub -optimization problem and then is resolved with the modified Hasofer- Lind-Rackwitz-Fiessler (HL-RF) method for computational efficiency and convergence. A method of design sensitivity analysis for probability constraint is presented and tested through simple examples. The suggested method is examined by solving several examples and the results are compared with those of other methods.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.278-278
• /
• 2000

In this paper, we introduce a new genetic reordering operator based on the concept of schema to solve optimization problems such as the Traveling Salesman Problem(TSP) and maximizing or minimizing functions. In particular, because TSP is a well-known combinational optimization problem andbelongs to a NP-complete problem, there is huge solution space to be searched. For robustness to local minima, the operator separates selected strings into two parts to reduce the destructive probability of good building blocks. And it applies inversion to the schema part to prevent the premature convergence. At the same time, it searches new spaces of solutions. Additionally, the non-schema part is applied to inversion for robustness to local minima. By doing so, we can preserve diversity of the distributions in population and make GA be adaptive to the dynamic environment.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.1
• /
• pp.1-6
• /
• 2002

Hopfield introduced the neural network for linear program with linear constraints. In this paper, Hopfield neural network has been generalized to solve the optimization problems including nonlinear constraints. Also, it has been discussed the methods hew to reconcile optimization problem with neural networks and how to implement the circuits.

• Smart Structures and Systems
• /
• v.21 no.2
• /
• pp.235-248
• /
• 2018

An efficient method utilizing the multi-stage improved differential evolution algorithm (MSIDEA) as an optimization solver is presented here to detect the multiple-damage of structural systems. Natural frequency changes of a structure are considered as a criterion for damage occurrence. The structural damage detection problem is first transmuted into a standard optimization problem dealing with continuous variables, and then the MSIDEA is utilized to solve the optimization problem for finding the site and severity of structural damage. In order to assess the performance of the proposed method for damage identification, an experimental study and two numerical examples with considering measurement noise are considered. All the results demonstrate the effectiveness of the proposed method for accurately determining the site and severity of multiple-damage. Also, the performance of the MSIDEA for damage detection compared to the standard differential evolution algorithm (DEA) is confirmed by test examples.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.1230-1233
• /
• 1993

Numerical solution of inverse problem of Takagi-Sugeno fuzzy model is proposed. The method is located on the application of numerical optimization to the fuzzy model. Steepest descent method is used for the numerical optimization. We use the linear approximation of fuzzy model, called pseudo first order approximation, by fixing the membership value on the neighborhood of the corresponding input. It is introduced in order to reduce the difficulty of optimization process. The efficiency of this method is shown by a numerical experiment.

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.51 no.2
• /
• pp.55-60
• /
• 2002

This paper presents an optimization procedure by using Response Surface Methodology(RSM) to determine design parameters for reducing cogging torque. RSM is achieved through using the experimental design method in combination with Finite Element Method and adapted to make analytical model for a complex problem considering a lot of interaction of these parameters. Sequential Quadratic Problem (SQP) method is used to solve the relsulting of constrained nonlinear optimization problem.

• Journal of Mechanical Science and Technology
• /
• v.20 no.10
• /
• pp.1541-1547
• /
• 2006

An efficient procedure to obtain the optimal stacking sequence and the minimum weight of stiffened laminated composite curved panels under several loading conditions and stiffener layouts has been developed based on the finite element method and the genetic algorithm that is powerful for the problem with integer variables. Often, designing composite laminates ends up with a stacking sequence optimization that may be formulated as an integer programming problem. This procedure is applied for a problem to find the stacking sequence having a maximum critical buckling load factor and the minimum weight. The object function in this case is the weight of a stiffened laminated composite shell. Three different types of stiffener layouts with different loading conditions are investigated to see how these parameters influence on the stacking sequence optimization of the panel and the stiffeners. It is noticed from the results that the optimal stacking sequence and lay-up angles vary depending on the types. of loading and stiffener spacing.

• Journal of the Korean Mathematical Society
• /
• v.44 no.4
• /
• pp.971-985
• /
• 2007

A sequential optimality condition characterizing the efficient solution without any constraint qualification for an abstract convex vector optimization problem is given in sequential forms using subdifferentials and ${\epsilon}$-subdifferentials. Another sequential condition involving only the subdifferentials, but at nearby points to the efficient solution for constraints, is also derived. Moreover, we present a proposition with a sufficient condition for an efficient solution to be properly efficient, which are a generalization of the well-known Isermann result for a linear vector optimization problem. An example is given to illustrate the significance of our main results. Also, we give an example showing that the proper efficiency may not imply certain closeness assumption.