• 한국정밀공학회지
• /
• 제14권3호
• /
• pp.89-97
• /
• 1997

A genetic algorithm (GA) is a stochastic direct search strategy that mimics the process of genetic evolution. The GA applied herein works on a population of structural designs at any one time, and uses a structured information exchange based on the principles of natural selection and wurvival of the fittest to recombine the most desirable features of the designs over a sequence of generations until the process converges to a "maximum fitness" design. Principles of genetics are adapted into a search procedure for structural optimization. The methods consist of three genetics operations mainly named selection, cross- over and mutation. In this study, a method of finding the optimum topology of truss/beam structure is pro- posed by using the GA. In order to use GA in the optimum topology problem, chromosomes to FEM elements are assigned, and a penalty function is used to include constraints into fitness function. The results show that the GA has the potential to be an effective tool for the optimal design of structures accounting for sizing, geometrical and topological variables.variables.

• 한국소음진동공학회논문집
• /
• 제16권2호
• /
• pp.115-123
• /
• 2006

A feasibility of using the topology optimization method for structural damage identification is investigated for the first time. The frequency response functions (FRFs) are assumed to be constructed by the finite element models of damaged and undamaged structures. In addition to commonly used resonances, antiresonances are employed as the damage identifying modal parameters. For the topology optimization formulation, the modal parameters of the undamaged structure are made to approach those of the damaged structure by means of the constraint equations, while the objective function is an explicit penalty function requiring clear black-and-white images. The developed formulation is especially suitable for damage identification problems dealing with many modal parameters. Although relatively simple numerical problems were considered in this investigation, the possibility of using the topology optimization method for structural damage identification is suggested through this research.

• Management Science and Financial Engineering
• /
• 제22권1호
• /
• pp.5-12
• /
• 2016

We consider a time-cost tradeoff problem with multiple milestones under a chain precedence graph. In the problem, some penalty occurs unless a milestone is completed before its appointed date. This can be avoided through compressing the processing time of the jobs with additional costs. We describe the compression cost as the convex or the concave function. The objective is to minimize the sum of the total penalty cost and the total compression cost. It has been known that the problems with the concave and the convex cost functions for the compression are NP-hard and polynomially solvable, respectively. Thus, we consider the special cases such that the cost functions or maximal compression amounts of each job are identical. When the cost functions are convex, we show that the problem with the identical costs functions can be solved in strongly polynomial time. When the cost functions are concave, we show that the problem remains NP-hard even if the cost functions are identical, and develop the strongly polynomial approach for the case with the identical maximal compression amounts.

• 한국컴퓨터정보학회논문지
• /
• 제23권3호
• /
• pp.85-92
• /
• 2018

We consider a project scheduling problem in which the jobs can be compressed by using additional resource to meet the corresponding due dates, referred to as a time-cost tradeoff problem. The project consists of two independent subprojects of which precedence graph is a chain. The due dates of jobs constituting the project can be interpreted as the multiple assessments in the life of project. The penalty cost occurs from the tardiness of the job, while it may be avoided through the compression of some jobs which requires an additional cost. The objective is to find the amount of compression that minimizes the total tardy penalty and compression costs. Firstly, we show that the problem can be decomposed into several subproblems whose number is bounded by the polynomial function in n, where n is the total number of jobs. Then, we prove that the problem can be solved in polynomial time by developing the efficient approach to obtain an optimal schedule for each subproblem.

• 대한산업공학회지
• /
• 제20권3호
• /
• pp.105-116
• /
• 1994

This paper presents an inventory model with partial backorders for the situation in which demand is deterministic, lead time follows normal distribution and back order ratio during the stockout period varies in proportion to the length of backorder period In this situations, an objective function is formulated to minimize a time-proportional backorder cast and a fixed penalty cost per unit lost. And then the procedure of iterative solution method for the model is developed to find optimal reorder paint and order quantity and a numerical example to illustrate the proposed method is presented.

• Journal of Information Processing Systems
• /
• 제15권6호
• /
• pp.1503-1516
• /
• 2019

In this paper, to improve the accuracy of long sentence similarity calculation, we proposed a sentence similarity calculation method based on a system similarity function. The algorithm uses word2vector as the system elements to calculate the sentence similarity. The higher accuracy of our algorithm is derived from two characteristics: one is the negative effect of penalty item, and the other is that sentence similar function (SSF) based on word2vector similar elements doesn't satisfy the exchange rule. In later studies, we found the time complexity of our algorithm depends on the process of calculating similar elements, so we build an index of potentially similar elements when training the word vector process. Finally, the experimental results show that our algorithm has higher accuracy than the word mover's distance (WMD), and has the least query time of three calculation methods of SSF.

• 제어로봇시스템학회논문지
• /
• 제4권1호
• /
• pp.68-75
• /
• 1998

The Intelligent Cruise Control system, ICC, is a driver assisting system for controlling relative speed and distance between two vehicles in the same lane. The ICC may be considered as an extension of a traditional cruise control, not only keeping a fixed speed of the vehicle, but correcting the speed also to that of a slower one ahead. This paper presents a real-time self-tuning fuzzy control algorithm to develop ICC. The self-tuning fuzzy control law is adopted to reduce the effects of nonlinearities of the vehicle and various road environments. In the self-tuning algorithm an interior penalty method is applied to preserve the inherent order of membership functions and is modified as an on-line algorithm for real time application. Via simulations, the performance of the suggested control algorithm is compared with a PID and a fuzzy control without self-tuning. The suggested control algorithm is implemented on PRV III and the results of the test driving on a local road are given.

• 물과 미래
• /
• 제27권4호
• /
• pp.69-84
• /
• 1994

본 연구의 목적은 갈수기와 풍수기간동안 유입량의 변화에 맞추어 저수지를 최적으로 운영하도록 방류와 저류량을 조절하는 실시간 저수지 운영율을 결정하는 것이다. 최적방류와 저유의 결정은 많은 저수지 운영목적을 충족시켜 목표들을 달성해야 하는 복잡한 의사결정 문제이다. 저수지에서 저류와 방류의 목표는 저수지로 유입되는 유입량의 정도에 따라 달성이라는 충족과 초과 및 미달이라는 편차가 발생한다. 이 편차를 손실로 보아 이 손실에 상응하는 벌과점을 부여하여 벌과손실이 최소가 되도록 저수지의 최적운영을 시도하는 것이다. 본 논문은 대청댐 운영목표로부터 편차손실 곡선을 작성하였으며 곡선의 경사를 손실계수로 운영모형의 목적함수에 반영하여 선형계획기법으로 대청댐 운영에 적용하여 보았다. 그 결과 저수지 운영에서 편차곡선을 이용해서 저류와 방류의 상반성을 반영할 수 있었으며, 유입량의 조건에 따른 목표달성의 정도와 운영의 간편성을 분석함으로 실시간 저수지 운영에서 의사결정을 위한 최적 기준의 설정방향을 제시하였다.

• 한국정밀공학회지
• /
• 제16권7호
• /
• pp.178-187
• /
• 1999

In order to identify a transfer function model with noise, penalty function method has been widely used. In this method, estimation process for possible model parameters from low to higher order proceeds the model identification process. In this study, based on linear estimation method, a new approach unifying the estimation and the identification of ARMAX model is proposed. For the parameter estimation of a transfer function model with noise, linear estimation method by noise separation is suggested instead of nonlinear estimation method. The feasibility of the proposed model identification and estimation method is verified through simulations, namely by applying the method to time series model. In the case of time series model with noise, the proposed method successfully identifies the transfer function model with noise without going through model parameter identification process in advance. A new algorithm effectively achieving model identification and parameter estimation in unified frame has been proposed. This approach is different from the conventional method used for identification of ARMAX model which needs separate parameter estimation and model identification processes. The consistency and the accuracy of the proposed method has been verified through simulations.

• 한국국방경영분석학회지
• /
• 제9권1호
• /
• pp.69-74
• /
• 1983

This article presents a deterministic inventory model for situations in which, during the stockout period, a fraction ${\beta}$ of the demand is backordered and the remaining fraction $1-{\beta}$ is lost. By defining a time proportional backorder cost and a fixed penalty cost per unit lost, a convex objective function representing the average annual cost of operating the inventory system is obtained. The optimal operating policy variables are calculated directly. At the extremes ${\beta}\;=\;1$ and ${\beta}\;=\;0$ the model presented reduces to the usual backorders and lost sales case, respectively.