• Structural Engineering and Mechanics
• /
• v.3 no.4
• /
• pp.359-372
• /
• 1995

This study presents an efficient method for optimum design of plate and shell structures, when the design variables are continuous or discrete. Both sizing and shape design variables are considered. First the structural responses such as element forces are approximated in terms of some intermediate variables. By substituting these approximate relations into the original design problem, an explicit nonlinear approximate design task with high quality approximation is achieved. This problem with continuous variables, can be solved by means of numerical optimization techniques very efficiently, the results of which are then used for discrete variable optimization. Now, the approximate problem is converted into a sequence of second level approximation problems of separable form and each of which is solved by a dual strategy with discrete design variables. The approach is efficient in terms of the number of required structural analyses, as well as the overall computational cost of optimization. Examples are offered and compared with other methods to demonstrate the features of the proposed method.

• Structural Engineering and Mechanics
• /
• v.62 no.5
• /
• pp.537-550
• /
• 2017

Structural sizing is a rewarding task due to its non-convex constrained nature in the design space. In order to provide both global exploration and proper search refinement, a hybrid method is developed here based on outstanding features of Evolutionary Computing and Teaching-Learning-Based Optimization. The new method introduces an observer phase for memory exploitation in addition to vector-sum movements in the original teacher and learner phases. Proper integer coding is suited and applied for structural size optimization together with a fly-to-boundary technique and an elitism strategy. Performance of the proposed method is further evaluated treating a number of truss examples compared with teaching-learning-based optimization. The results show enhanced capability of the method in efficient and stable convergence toward the optimum and effective capturing of high quality solutions in discrete structural sizing problems.

• Journal of the Korean Society of Systems Engineering
• /
• v.12 no.1
• /
• pp.41-58
• /
• 2016

Reliability Centered Maintenance (RCM) introduces a systematic method and decision logic tree for utilizing previous operating experience focused on reliability and optimization of maintenance activities. In this paper RCM methodology is applied on safety injection system for APR-1400. Functional Failure Mode Effects and Criticality Analysis (FME&CA) are applied to evaluate the failure modes and the effect on the component, system and plant. Logic Tree Analysis (LTA) is used to determine the optimum maintenance tasks. The results show that increasing the condition based maintenance will reduce component failure and improve reliability and availability of the system. Also the extension of the surveillance test interval of Safety Injection Pumps (SIPs) would lead to an improved pump's availability, eliminate the unnecessary maintenance tasks and this will optimize maintenance activities.

• Microbiology and Biotechnology Letters
• /
• v.17 no.6
• /
• pp.619-623
• /
• 1989

The effects of temperature on yeast growth and ethanol production were investigated in batch cultures. The maximum specific growth rate of yeast was obtained at 36$^{\circ}C$ and the maximum specific production rate of ethanol was obtained at 33$^{\circ}C$. A mathematical model was employed to describe the temperature effects in ethanol fermentation and the parameters in the model were expressed as a function of temperature. Optimum temperature control strategy, from the simulation result, consists of starting the fermentation at high temperature and lowering the temperature as the fermentation proceeds.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.35 no.1
• /
• pp.140-147
• /
• 2012

Vehicle routing problem is one of the traveling salesman problems with various conditions such as vehicle capacity limits, delivery time windows, as well as time dependent speeds in metropolitan area. In this research hourly vehicle moving speeds information in a typical metropolitan area are analyzed to use the results in the design procedure of VRP heuristic. Quality initial vehicle routing solutions can be obtained with adaption of the analysed results of the time periods with no vehicle speed changes. This strategy makes complicated time dependent vehicle speed simple to solve. Time dependent vehicle speeds are too important to ignore to obtain optimum vehicle routing search for real life logistics systems.

• Proceedings of the Korean Society of Agricultural Engineers Conference
• /
• 2003.10a
• /
• pp.359-362
• /
• 2003

This research deriving the lifetime distribution function of embank as one of main components in reservoir was carried out by mining the data of precise safety diagnosis in 1995 to 2001 as one of researches that were performed for determining the propriety for making item at design for planning and considering optimal maintenance strategy for service life through acquiring the system function of reservoir as main resource for irrigation and analyzing the life cycle cost of it.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.14 no.1
• /
• pp.44-50
• /
• 2015

This paper presents a heuristic process-optimization procedure for minimizing warpage in injection-molded parts based on the dynamic robust design methodology. The injection molding process is known to have intrinsic variations of its process conditions due to various factors, including incomplete process control facilities. The aim of the robust design methodology advocated by Taguchi is to determine the optimum design variables in a system which is robust to variations in uncontrollable factors. The proposed procedure can determine the optimal robust conditions of injection molding processes at a minimum cost through a trade-off strategy between the degree of warpage and the packing time.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.106.4-106
• /
• 2001

The current research field to find near-optimum solutions explores in a small population, which is coined as Micro-Genetic Algorithms (${\mu}$GAs), with some genetic operators. Just as in the Simple-Genetic Algorithms (SGAs), the ${\mu}$GAs work with encoding population and are implemented serially. The major difference between SGAs and ${\mu}$GAs is how to make reproductive plan for more better searching strategy due to the population choice. This paper is conducted to implement ${\mu}$GAs in order to achieve fast searching for more better evolution and associated cost evaluation in global solution space. To achieve this implementation, the Air-Borne Selection (ABS) for a new reproductive plan is developed as new strategic conception for ${\mu}$GAs. In this paper, it is shown that the ${\mu}$GAs implementation reaches a near-optimal region much earlier than the SGAs implementation. The superior ...

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.70.1-70
• /
• 2002

In the fuzzy applications and theories, it is very important to consider how to design the optimal fuzzy model from short training data, in order to construct the reasonable fuzzy model for identifying the practical process. There are several concerns to be confirmed for efficient fuzzy model design. One of concern is the optimization problem of the fuzzy model. In various applications, the genetic algorithm is widely applied to obtain optimal fuzzy model and other cases that adopt evolutionary mechanism of the nature. If we use natural selection and multiplication operation of the genetic algorithm, early convergence to local minimum can be occurred. In other word, we can find only optimum...

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.381-385
• /
• 2003

We consider the bandwidth parking problem arising from telecommunication networks The problem is to determine the set of calls to be routed and an assignment or them to the paths in arc capacitated network. The objective is to maximize profit. We formulate the problem as an integer programming and propose an algorithm to solve it. Column generation technique to solve the linear programming relxation is proposed with two types of columns in addition, to obtain an optimum integer solution, we consider a new branching strategy. Computational experiments show that the algorithm gives option at solutions within reasonably small time limits.