• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1998.10a
• /
• pp.731-740
• /
• 1998

This paper discusses a brcriterion approachto sequencing with time/cost trade-offs. The first problem is to minimize the total flow time and the maximum tardiness. And second is to the maximum tardiness and resource allocation costs. This approach , which produces an efficient frontier of possible schedules, has the advantage that it does not require the sequencing criteria to be measurable in the same units as the resource allocation cost. The basic single machine model is used to treat a class of problems in which the sequencing objective is to minimize the maximum completion penalty. It is further assumed that resource allocation costs can be represented by linear time/cost function.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.13 no.1
• /
• pp.97-97
• /
• 1988

Genetic Algorithms have been successfully applied to various problems (for example, engineering design problems with a mix of continuous, integer and discrete design variables) that could not have been readily solved with traditional computational techniques. But, several problems for which conventional Genetic Algorithms are ill defined are premature convergence of solution and application of exterior penalty function. Therefore, we developed an Improved Genetic Algorithms (IGAs) to solve above two problems. As a case study, IGAs is applied to several nonlinear optimization problems and it is proved that this algorithm is very useful and efficient in comparison with traditional methods and conventional Genetic Algorithm.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.3
• /
• pp.81-91
• /
• 1994

This paper is to build an economic production quantity model for situations, in which, during the stockout period, a fraction .betha.(backorder ratio) of the demand is backordered and remaining fraction (1-.betha.) is lost. This paper develops an objective function representing the average annual cost of a production system by defining a time-weighted backorder cost and a lost sales penalty cost per unit lost under the assumptions of deterministic demand rate and deterministic production rate, and provides an algorithm for its optimal solution. At the extreme .betha.= 1, the presented model reduces to the Fabrycky's model with complete backorders.

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.2
• /
• pp.168-175
• /
• 2003

A new algorithm based on Genetic Algorithms is proposed f3r solving process optimization problems formulated in MINLP, GDP and hybrid MINLP/GDP. This work is focused especially on the design of the Genetic Algorithm suitable to handle disjunctive programming with the same level of MINLP handling capability. Hybridization with the Simulated Annealing is experimented and many heuristics are adopted. Real and binary coded Genetic Algorithm initiates the global search in the entire search space and at every stage Simulated Annealing makes the candidates to climb up the local hills. Multi-Niche Crowding method is adopted as the multimodal function optimization technique. and the adaptation of probabilistic parameters and dynamic penalty systems are also implemented. New strategies to take the logical variables and constraints into consideration are proposed, as well. Various test problems selected from many fields of process systems engineering are tried and satisfactory results are obtained.

• Journal of Korean Institute of Industrial Engineers
• /
• v.17 no.1
• /
• pp.51-58
• /
• 1991

This paper presents a single-echelon, single item, stochastic lead time and static demand 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. In this situations, an objective function representing the average annual cost of inventory system is obtained by defining a time-proportional backorder cost and a fixed penalty cost per unit lost. The optimal operating policy variables minimizing the average annual cost are calculated iteratively. At the extremet ${\beta}=1$, the model presented reduces to the usual backorder case. A numerical example is solved to illustrate the algorithm developed.

• Proceedings of the Korean Statistical Society Conference
• /
• 2004.11a
• /
• pp.123-128
• /
• 2004

A finite dam under $P_{\lambda,;,T}^M-policy$ is considered, where the input of water is formed by a Wiener process subject to random jumps arriving according to a Poisson process. Explicit expression is deduced for the stationary distribution of the level of water. And the long-run average cost per unit time is obtained after assigning costs to the changes of release rate, a reward to each unit of output, and a penalty which is a function of the level of water in the reservoir.

• Journal of Mechanical Science and Technology
• /
• v.14 no.3
• /
• pp.306-313
• /
• 2000

The homogenization method and the density function method are common approaches to evaluate the equivalent material properties for design cells composed of matter and void. In this research, using a new topology optimization method based on the homogenized material with a penalty factor and the chessboard prevention strategy, we obtain the optimal layout of a structure for the natural frequency of a designated mode. The volume fraction of nodes of each finite element is chosen as the design variable and a total material usage constraint is imposed. In this paper, the subspace method is used to evaluate the eigenvalue and its corresponding eigenvector of the structure for the designated mode and the recursive quadratic programming algorithm, PLBA algorithm, is used to solve the topology optimization problem.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.8 no.1
• /
• pp.67-73
• /
• 1999

This paper presents resizing design optimization method by utilizing genetic algorithm(GA), which consists of three basic operators : reproduction, crossover and mutation. The fitness and penalty function for resizing optimization problem are defined, and the flowchart of the developed computer program along with the descriptions of each modules is presented. Also, modelling for flexible-body dynamic analysis is presented. The model is composed of bodies, joints, and force elements such as translational spring-damper-actuator. The design objects si to determine the wall thickness for minimum weight under dynamic displacement constraint.

• Journal of Korean Society of Transportation
• /
• v.13 no.3
• /
• pp.19-33
• /
• 1995

Conventional traffic assignment techniques usually do not consider traveler's route choice behavior affected by hierachicla strucfture in urban highway system. This study realizes the route choice behavior such that travelers tend to choose more higher level of highway rather than lower level of highway for longer trops. Otherwise, for shorter trips, travelers tend to choose lower level of highway unless they can get sufficient travel time saving by using mojor arterial street or freeway (higher level of highway). Therefore, this study suggests a traffic assignment technique incorrporating route choice behavior related to hierachical highway structure by introducing some perception costs to generalized cost function such as perceptional preference measureemnt for higher level higheay and perceptional penalty when changing to different level of highway. Through simulation analysis, it is shown that the simulation results with the new traffic assignment echnique can be different a lot from the results with the convential method.

• Proceedings of the KIEE Conference
• /
• 2005.07d
• /
• pp.2564-2566
• /
• 2005

This paper presents an iterative linear matrix inequality (LMI) method for $H_2$ and $H_{\infty}$ optimal static output feedback (SOF) control, which is expressed in terms of LMIs subject to an additional rank condition. We propose a linear Penalty function to penalize the rank constraint so that static $H_2$ and $H_{\infty}$ synthesis results in solving a series of convex LMI optimization problems. Numerical experiments for various $H_2$ and $H_{\infty}$ SOF synthesis were performed to demonstrate the effectiveness of the proposed algorithm.