• 설비공학논문집
• /
• 제23권4호
• /
• pp.281-286
• /
• 2011

The objective of this study is to optimize the four-bed six-step pressure swing adsorption(PSA) process for high purity $CH_4$ recovery from the biogas. The effects of P/F(purge to feed) ratio and cycle time on the process performance were evaluated. The cyclic steady-states of PSA process were reached after 12 cycles. The purity and recovery rate of product gas, pressure and temperature changes were constant as the cycle repeated. It was shown that the P/F ratio gave significant effect on the product recovery rate by increasing the amount of purge gas in purge and regeneration step. The optimal P/F ratio was found to be 0.08. As the cycle time increased, the product purity decreased by increasing the feed gas flow rate. It was found that the optimal operating conditions were P/F ratio of 0.08 and total cycle time of 1,440 seconds with the purity of 97%.

• 산업경영시스템학회지
• /
• 제23권59호
• /
• pp.1-10
• /
• 2000

The traveling salesman problem is a representative NP-Complete problem. It needs lots of time to get a solution as the number of city increase. So, we need an efficient heuristic algorithm that gets good solution in a short time. Almost edges that participate in optimal path have somewhat low value cost. This paper discusses the property of nearest neighbor and 3-opt. This paper uses nearest neighbor's property to select candidate edge. Candidate edge is a set of edge that has high probability to improve cycle path. We insert edge that is one of candidate edge into intial cycle path. As two cities are connected. It does not satisfy hamiltonian cycle's rule that every city must be visited and departed only one time. This paper uses 3-opt's method to sustain hamiltonian cycle while inserting edge into cycle path. This paper presents a highly efficient heuristic algorithm verified by numerous experiments.

• 품질경영학회지
• /
• 제47권1호
• /
• pp.87-96
• /
• 2019

Purpose: The purpose of this paper is to determine an optimal production time for economic production quantity model with preventive maintenance and random defective rate as the function of a machinery deteriorates. Methods: If a machinery shifts from "in-control" state to "out-of-control" state, a proportion of defective items being produced increases. It is assumed that time to state shift is a random variable and follows an arbitrary distribution. The elapsed time until process shift decreases stochastically as a production cycle repeats and quasi-renewal process is used to implement for production facilities to deteriorate. Results: When the exponential parameter for exponential distribution increases, the optimal production time increases. When Weibull distribution is considered, the optimal production time is closely affected by the shape parameter of Weibull distribution. Conclusion: A mathematical model is suggested to find optimal production time and optimal number of production cycles and numerical examples are implemented to validate the patterns for changes of optimal times under different parameters assumptions. The real application is implemented using the proposed approach.

• International Journal of Reliability and Applications
• /
• 제12권2호
• /
• pp.117-122
• /
• 2011

In this paper, we suggest the optimal replacement policy following the expiration of repair warranty when the cost of minimal repair depends on the age of system. To do so, we first explain the replacement model under repair warranty. And then the optimal replacement policy following the expiration of repair warranty is discussed from the user's point of view. The criterion used to determine the optimality of the replacement model is the expected cost rate per unit time, which is obtained from the expected cycle length and the expected total cost for our replacement model. The numerical examples are given for illustrative purpose.

• 한국생산제조학회지
• /
• 제22권1호
• /
• pp.173-177
• /
• 2013

The purpose of this paper is to investigate the influences on mechanical properties of two-stroke cycle motor pistons manufactured by casting, conventional forging and powder forging, through the comparison of characteristics, merits and disadvantages of each forming technology. For each forming technology, the optimal process parameters were determined through the experiments for several conditions, and microstructure, hardness, tensile strength and elongation of pistons are compared and analyzed. In conventional forging process, material temperature was $460^{\circ}C$ and the die temperature was $210^{\circ}C$ for the Al 4032. The optimal condition was found as solution treatment under $520^{\circ}C$ for 5 hours, quenching with $23^{\circ}C$ water, and aging under $190^{\circ}C$ for 5 hours. In powder forging process, the proper composition of material was determined and optimal sintering conditions were examined. From the experiment, 1.5% of Si contents on the total weight, $580^{\circ}C$ of sintering temperature, and 25 minutes of sintering time were determined as the optimal process condition. For the optimal condition, the pistons had 76.4~78.3 [HRB] of hardness, and 500 [MPa] of tensile strength after T6 heat treatment.

• Biotechnology and Bioprocess Engineering:BBE
• /
• 제8권6호
• /
• pp.349-353
• /
• 2003

The physiological characteristics of cultures of very high cell mass (e.g. 10g cell mass/L), termed“ultrahigh cell density cultures”is reviewed. A close relationship was found between the length of the optical path (OP) in flat-plate reactors and the optimal cell density of the culture as well as its areal (g m$\^$-2/ day$\^$-1/) productivity. Cell-growth inhibition (GI) unfolds as culture density surpasses a certain threshold. If it is constantly relieved, a 1.0cm OP reactor could produce ca. 50% more than reactors with longer OP, e.g. 5 or 10cm. This unique effect, discovered by Hu et al. [3], is explained in terms of the relationships between the frequency of the light-dark cycle (L-D cycle), cells undergo in their travel between the light and dark volumes in the reactor, and the turnover time of the photosynthetic center (PC). In long OP reactors (5cm and above) the L-D cycle time may be orders of magnitude longer than the PC turnover time, resulting in a light regime in which the cells are exposed along the L-D cycle, to long, wasteful dark periods. In contrast, in reactors with an OP of ca. 1.0 cm, the L-D cycle frequency approaches the PC turnover time resulting in a significant reduction of the wasteful dark exposure time, thereby inducing a surge in photosynthetic efficiency. Presently, the major difficulty in mass cultivation of ultrahigh-density culture (UHDC) concerns cell growth inhibition in the culture, the exact nature of which is awaiting detailed investigation.

• 대한교통학회지
• /
• 제14권1호
• /
• pp.117-133
• /
• 1996

본 논문에서는 모호한 상황에서도 적절하게 대처하는 인간의 판단능력과 유사한 퍼지논리를 이용, 교차로 교통신호등의 최적현시를 결정하는 제어기를 구현하여 기존의 차량감응식 제어기(Vehicle Actuated Controller)와 고정주기식 제어기(Fixed Cycle Time) 및 그외의 구현 가능성 있는 제어기와 비교하여 성능이 우수한 알고리즘을 제시한다. 각 현시단계의 주기시간을 결정함에 있어 기존의 방식인 웹스터(Webster)식을 이용하는 방법보다는 상황에 맞는 현시순서를 퍼지 논리 알고리즘을 통해 선정하고, 불확실한 교통량변화에 적절하게 대응하는 퍼지최적주기시간을 결정하여 구성한 퍼지 최적현시제어기가 비교제어기에 비해 교통소통에 우수함을 보여주었다.

• 디지털산업정보학회논문지
• /
• 제6권2호
• /
• pp.183-191
• /
• 2010

Decision problem called an optimal release policies, after testing a software system in development phase and transfer it to the user, is studied. The applied model of release time exploited infinite non-homogeneous Poisson process. This infinite non-homogeneous Poisson process is a model which reflects the possibility of introducing new faults when correcting or modifying the software. The failure life-cycle distribution used mixture which has various intensity, if the system is complicated. Thus, software release policies which minimize a total average software cost of development and maintenance under the constraint of satisfying a software reliability requirement becomes an optimal release policies. In a numerical example, after trend test applied and estimated the parameters using maximum likelihood estimation of inter-failure time data, estimated software optimal release time.

• 대한교통학회지
• /
• 제13권4호
• /
• pp.105-115
• /
• 1995

This paper deals with an operation concept of "time-transfer of buses", in which buses arrive a transfer center at the same time and allow passengers to transfer to other bus lines, so that passengerscan go anywhere all the timed-transfere buses operate with only one transfer. This timed-transfer bus system is known as an efficient operating technique which can be adopted in an area with sparsely distrubuted bus demand. A model of timed-transfer is estabilished in terms of vaious factors such as the expected(or average) arrival time, distribution of arrival time, timed-transfer cycle, shceduled departure time, etc. It is assumed that the objective of timed-transfer bus system is to minimize the total transfer waiting time. The optimal schedualed arrival time or buffer time(time required to arrive ealy in consideration of delay) is analyzed for a general case and various speicial cases. It was found that the optiaml buffer time is an inverse funcion of the timed-transfer cycl and increases with the cycle time, assumin g that there is a fixed scheduled departure time at the transfer cetner regardless of whether one or more buses fail to arrive before the scheduled departure time. If buses are to wait uhtil all the buses arrive at the transfer center, that is, the transfer departure time is vairable, the optimal scheduled arrival times can be obtained by a mathmatical programming.

• 대한산업공학회지
• /
• 제14권1호
• /
• pp.73-82
• /
• 1988

This research is concerned with production scheduling for FMS (Flexible Manufacturing System) which consists of machine centers served by cycle conveyor. The objective of the research is to develop and evaluate scheduling procedures to minimize the mean flow time. An optimal algorithm called SCTF (Shortest Circle Time First) is proposed when the conveyor runs at minimum possible speed (CS=1) and a heuristic algorithm called SCTJMF (Shortest Cycle Time and Job Matching Algorithm) is suggested when the conveyor runs at double speed (CS=2). The evaluation of the heuristic algorithm was implemented by comparison with the optimal algorithm for 112 experimentations for CS=1 and random schedule. The results showed that the proposed heuristic algorithm provides better solution that can be regarded noticeable when compared with SCTF algorithm and random scheduling.