• Journal of the Earthquake Engineering Society of Korea
• /
• v.12 no.2
• /
• pp.9-22
• /
• 2008

This paper presents an integrated optimal design technique of a hybrid structure-damper system for improving the seismic performance of the structure. The proposed technique corresponds to the optimal distribution of the stiffness and dampers. The multi-objective optimization technique is introduced to deal with the optimal design problem of the hybrid system, which is reformulated into the multi-objective optimization problem with a constraint of target reliability in an efficient manner. An illustrative example shows that the proposed technique can provide a set of Pareto optimal solutions embracing the solutions obtained by the conventional sequential design method and single-objective optimization method based on weighted summation scheme. Based on the stiffness and damping capacities, three representative designs are selected among the Pareto optimal solutions and their seismic performances are investigated through the parametric studies on the dynamic characteristics of the seismic events. The comparative results demonstrate that the proposed approach can be efficiently applied to the optimal design problem for improving the seismic performance of the structure.

• Korean Management Science Review
• /
• v.27 no.1
• /
• pp.75-90
• /
• 2010

In this paper, we proposed new solution procedure of the air defense missile allocation problem. In order to find the optimal location of missile, we formulated a simple mathematical model maximizing the kill probability of enemy air threat including aircraft and missile. To find the Kill probability, we developed a new procedure using actual experimental data in the mathematical model. Actual experimental data mean real characteristic factor, which was acquired when the missile had been developed through missile fire experiment. The result of this study can offer practical solution for missile allocation and the methodology in this study can be used to the decision making for the optimal military facility allocation.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.34 no.5
• /
• pp.173-178
• /
• 1985

The control of a linear system with random coefficients is discussed here. The cost function is of a quadratic form and the random coefficients are assumed to be completely observable by the controller. Stochastic Process involved in the problem by the controller. Stochastic Process involved in the problem formulation is presented to be the unique strong solution to the corresponding stochastic differential equations. Condition for the optimal control is represented through the existence of solution to a Cauchy problem for the given nonlinear partial differential equation. The optimal control is shown to be a linear function of the states and a nonlinear function of random parameters.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.41
• /
• pp.123-134
• /
• 1997

In this paper we consider the CSP requirements determination problem of new equipment system. The CSP we deal with in the paper are restricted to the demand-based spare parts. For the newly procured equipment systems, mathematical analyses are made for the system which is constructed with the repairable items to derive the associated CSP requirement determination model in mathematical expression, respectively. Based on these analyses, a mathematical model is derived for making an optimal CSP requirement determination subject to the constraint of satisfying any given funds limitation. We assume that the failure of a part follows a Poisson process. Firstly, the operational availability concept in CSP is defined and the relation between the general system availability and the operational availability is established. Secondly, the problem is formulated as the operational availability maximization problem that should satisfy the funds limitation, and then, using the generalized Lagrange multipliers method, the optimal solution procedure is derived.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.2
• /
• pp.153-159
• /
• 2004

A control-structure combined optimal design problem is discussed taking a 3-D truss structure as a design object. We use descriptor forms for a controlled object and a generalized plant because the structural parameters appear naturally in these forms. We consider not only minimum weight design problem for structure system, but also suppression problem of the effect of disturbances for control system as the purpose of the design. By minimizing the linear sum of the normalized structural objective function and control objective function, it is possible to make optimal design by which the balance of the structural weight and the control performance is taken.

• IE interfaces
• /
• v.17 no.spc
• /
• pp.28-36
• /
• 2004

The main purpose of this study is to find out the optimal solution of the vehicle routing problem considering heterogeneous vehicle(s), double-trips, and multi depots. This study suggests a mathematical programming model with new numerical formula which considers the amount of delivery and sub-tour elimination and gives optimal solution by using OPL-STUDIO(ILOG). This study also suggests modified genetic algorithm which considers the improvement of the creation method for initial solution, application of demanding point, individual and last learning method in order to find excellent solution, survival probability of infeasible solution for allowance, and floating mutation rate for escaping from local solution. The suggested modified genetic algorithm is compared with optimal solution of the existing problems. We found the better solution rather than the existing genetic algorithm. The suggested modified genetic algorithm is tested by Eilon and Fisher data(Eilon 22, Eilon 23, Eilon 30, Eilon 33, and Fisher 10), respectively.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.34 no.3
• /
• pp.71-84
• /
• 2009

This paper considers a remanufacturing and purchasing planning problem, in which either used products(or wastes) are remanufactured or remanufactured products(or final products) are purchased to satisfy dynamic demands of remanufactured products over a discrete and finite time horizon. Also, as remanufactured products are purchased more than or equal to a special quantity Q, a discount price policy is applied. The problem assumes that the related cost(remanufacturing and inventory holding costs of used products, and the purchasing and inventory holding costs of remanufactured products) functions are concave and backlogging is not allowed. The objective of this paper is to determine the optimal remanufacturing and purchasing policy that minimizes the total cost to satisfy dynamic demands of remanufactured products. This paper characterizes the properties of the optimal policy and then, based on these properties, presents a dynamic programming algorithm to find the optimal policy. Also, a network-based procedure is proposed for the case of a large quantity of low cost used products. A numerical example is then presented to demonstrate the procedure of the proposed algorithm.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.1
• /
• pp.167-173
• /
• 2007

This paper describes a redundancy resolution based method for determining an optimal initial configuration of a humanoid robot for holding an object. There are three important aspects for a humanoid robot to be able to hold an object. Those three aspects are the reachability that guarantees the robot to reach the object, the stability that guarantees the robot to remain stable while moving or holding the object, and the manipulability that makes the robot manipulate the object dexterously. In this paper, a humanoid robot with 20 degrees of freedom is considered. The humanoid robot is kinematically redundant and has infinite number of solutions for the initial configuration problem. The complex three-dimensional redundancy resolution problem is divided into two simple two-dimensional redundancy resolution problems by incorporating the symmetry of the problem, robot's moving capability, and the geometrical characteristics of the given robot. An optimal solution with respect to the reachability, the stability, and the manipulability is obtained by solving these two redundancy resolution problems.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.4
• /
• pp.1386-1396
• /
• 2017

In this paper, a new approach is proposed to select the optimal sitting and sizing of distributed solar photovoltaic generation (SPVG) in a radial electrical distribution systems (EDS) considering load/generation uncertainties. Here, distributed generations (DGs) allocation problem is modeled as optimization problem with network loss based objective function under various equality and inequality constrains in an uncertain environment. A boundary power flow is utilized to address the uncertainties in load/generation forecasts. This approach facilitates the consideration of random uncertainties in forecast having no statistical history. Uncertain solar irradiance is modeled by beta distribution function (BDF). The resulted optimization problem is solved by a new Dynamic Harmony Search Algorithm (DHSA). Dynamic band width (DBW) based DHSA is proposed to enhance the search space and dynamically adjust the exploitation near the optimal solution. Proposed approach is demonstrated for two standard IEEE radial distribution systems under different scenarios.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.12 no.2
• /
• pp.42-50
• /
• 1987

This objective of this paper is to develop an efficient method with small memory requirement for a feed-mixing problem on a micro computer. First this method uses the decomposition principle to reduce the memory requirement. Next, the decomposition principle is modified to fit the problem. Further four different variations in solving subproblems are designed in order to improve efficiency of the principle. According to the test with respect to the processing time, the best variation is such that the dual simplex method is used, and the optimal basis of a previous subproblem is used as an initial basis, and the master problem is (M +1) dimensional. In general, the convergence of solution becomes slower near the optimal value. This paper introduces a termination criterion for a sufficiently good solution. According to the test, 5%-tolerence is acceptable with respect to the relation between the processing time and optimal value.