• Journal of the Korea Safety Management & Science
• /
• v.10 no.3
• /
• pp.217-225
• /
• 2008

The inventory routing problem (IRP) is an important area of Supply Chain Management. The objective function of IRP is the sum of transportation cost and inventory cost. We propose an Artificial Immune System(AIS) to solve the IRP. AIS is one of natural computing algorithm. An hyper mutation and an vaccine operator are introduced in our research. Computation results show that the hyper mutation is useful to improve the solution quality and the vaccine is useful to reduce the calculation time.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.8 no.1
• /
• pp.19-26
• /
• 1983

This paper deals with the problem of locating facilities with upper and lower capacity bounds in a single level physical distribution system at minimum total costs. Several known schemes for location problems with upper capacity bounds only are successfully extended to our case and then implemented into our branch ana bound solution procedure. Computational experiments with twelve test problems suggest the effectiveness of our approach by showing that only a small amount of additional computation is required for our problem as compared to that for the problems with upper capacity bounds.

• 한국전산유체공학회:학술대회논문집
• /
• 2006.05a
• /
• pp.248-251
• /
• 2006

Multi-physics problem is considered for the Pitot tube located in uniform freon gas flow with high Mach number and the 3D numerical results of temperature on Pitot tube is given. The model is created by using structural module of ANSYS, the grids are obtained by ICEM, and the problem is solved and the data post-processing is done by CFX.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.8
• /
• pp.1434-1439
• /
• 2008

Numerical methods for solving the state feedback control problem of linear time invariant system are presented in this paper. The methods are based on Haar wavelet approximation. The properties of Haar wavelet are first presented. The operational matrix of integration and its inverse matrix are then utilized to reduce the state feedback control problem to the solution of algebraic matrix equations. The proposed methods reduce the computation time remarkably. Finally a numerical example is illustrated to demonstrate the validity and applicability of the proposed methods.

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.4
• /
• pp.649-662
• /
• 2021

Recently the author studied a one-parameter family of divergences and considered the related median minimization problem of finite points over these divergences in general symmetric cones. In this article, to utilize the results practically, we deal with a special symmetric cone called second order cone, which is important in optimization fields. To be more specific, concrete computations of divergences with its gradients and the unique minimizer of the median minimization problem of two points are provided skillfully.

• IE interfaces
• /
• v.21 no.1
• /
• pp.8-17
• /
• 2008

A new search procedure, VLT(Vertex Line Tracing) heuristic, for two dimensional irregular shapes nesting problem was suggested in this study. The VLT heuristic was suggested to the nesting problem to overcome disadvantages of the existing NFP(No-Fit-Polygon) method. This VLT heuristic was compared with the results of the existing benchmark problems suggested by Albano, Hopper, and Burke. The results of the VLT heuristic give efficient solutions in the point of the scrap ratio and computation time. A computer program, NestLogic, using C++ for VLT heuristic was also developed for this nesting problem.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.1
• /
• pp.33-44
• /
• 2001

In this paper, we address a problem of traffic grooming and wavelength routing in all optical WDM ring networks. Given a traffic demand for each node pair, we should aggregate the traffic onto lightpaths between pairs of nodes to transport the demand, and set up the routing path for each lightpath with minimum number of wavelengths to be assigned to lightpaths. In this paper, we formulate our problem as a mixed Integer Programming model. Owing to the problem complexity, it is hard to find an optimal solution for our problem. hence, we develop a heuristic algorithm to solve our problem efficiently. From the computational experiments, we can find the proposed heuristic is very satisfactory in both the computation time and the solution quality generated.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.8 no.3
• /
• pp.66-75
• /
• 1999

This paper is concerned with a analysis of noise by inverse problem available for analyzing the two and three-dimensional acoustic field problems. The noise of analysis considered in this study can be reduced to an optimum problem to find the optimal set of parameters defining the vibrating state of noise source surfaces. The optimal set of parameters are searched by the standard optimization procedure minimizing the square sum of the residuals between the measured and computed quantities of sound pressure at some points in the acoustic field. Computation is carried out for typical examples in which the noise sources are located on the infinite plane. It is demonstrated that the noise of analysis can be effectively made by using the sensitive reference data.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.36 no.4
• /
• pp.231-239
• /
• 1987

Distribution system is one of large and complicated sytem, consisted of a great number of components. Therefore efficient operation based on precise analysis and computation methods is indispensable accommodating growing loads. This paper describes an optimal operation problem to relieve overload flow in radial distribution systems by using modified block model. The problem is formulated as a network problem of synthesizing the optimal spanning tree in a graph, branch and bound method is used for the optimization. Especially modified block model proposed in this paper is validated more practical than conventional model. These methods can be applied to two types of distribution system problems such as, 1) planning problem to check the capability of relieving overload at normal rating, 2) emergency operation problem to determine switching scheme for minimizing customer loads affected by a fault. Examples of application to these problems are discussed.

• IE interfaces
• /
• v.20 no.4
• /
• pp.504-514
• /
• 2007

The multicast routing problem lies in the composition of a multicast routing tree including a source node and multiple destinations. There is a trade-off relationship between cost and delay, and the multicast routing problem of optimizing these two conditions at the same time is a difficult problem to solve and it belongs to a multi-objective optimization problem (MOOP). A multi-objective genetic algorithm (MOGA) is efficient to solve MOOP. A micro-genetic algorithm(${\mu}GA$) is a genetic algorithm with a very small population and a reinitialization process, and it is faster than a simple genetic algorithm (SGA). We propose a multi-objective micro-genetic algorithm (MO${\mu}GA$) that combines a MOGA and a ${\mu}GA$ to find optimal solutions (Pareto optimal solutions) of multicast routing problems. Computational results of a MO${\mu}GA$ show fast convergence and give better solutions for the same amount of computation than a MOGA.