• 전기학회논문지
• /
• 제56권3호
• /
• pp.451-456
• /
• 2007

This paper presents a problem that reconfigure distribution power system using branch exchange method. Optimal reconfiguration problem calculates line loss, voltage condition about system states of all situations that become different according to line On/off status, and search for optimum composition of these. However, result is difficult to be calculated fast. Because radiated operation condition of system is satisfied using many connection and sectionalize switches in the distribution power system. Therefore, in this paper, optimization method for reducing system total loss and satisfying operating condition of radial and constraints condition of voltage is proposed using the fastest branch exchange. And optimal solution at branch exchange algorithm can be wrong estimated to local optimal solution according to initial operating state. Considering this particular, an initial operating point algorithm is added and this paper showed that optimal solution arrives at global optimal solution.

• 대한전기학회논문지:전력기술부문A
• /
• 제51권3호
• /
• pp.118-126
• /
• 2002

AVR parameter tuning for voltage control of generators has generally been done with the off-line open-circuit model of the synchronous generator. When the generator is connected on-line and operating with load the AVR operates in an entirely different environment from the open-circuit conditions. This paper describes a new method for AVR parameter tuning for on line conditions using SQP(Sequential Quadratic Programming) meshed with frequency response characteristics of linearized on-line system model. As the proposed method uses the un - line system model the tuned parameter sets show more optimal behavior in the on-line operating conditions. furthermore, as this method considers the performance indices that are needed for stable operation as constraints, AVR parameter sets that are tuned by this method could guarantee the stable performance, too.

• 한국경영과학회지
• /
• 제18권1호
• /
• pp.97-117
• /
• 1993

This paper considers inspection station location problem for a flexible assembly line that consists of multiple stages. By considering the trade-off between locating an station at an "early" stage and at a "late" stage, we have developed some dominance relations on a graph. Based on the dominance relations, we then present an algorithm that finds an optimal inspection plan and a heuristic approach that finds a near-optimal inspection plan. The effectiveness of these two algorithms is demonstrated by two numerical examples. numerical examples.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.27.4-27
• /
• 2001

A stabilizing control method for linear systems with model uncertainties and hard input constraints is developed, which does not require on-line optimizations. This work is motivated by the constrained robust MPC(CRMPC) approach [3] which adopts the dual mode prediction strategy (i.e. free control moves and invariant set) and minimizes a worst case performance criterion. Based on the observation that, a feasible control sequence for a particular state can be found as a linear combination of feasible sequences for other states, we suggest a stabilizing control algorithm providing sub-optimal and feasible control sequences using pre-computed optimal sequences for some canonical states. The on-line computation of the proposed method reduces to simple matrix multiplication.

• Journal of Biosystems Engineering
• /
• 제36권6호
• /
• pp.461-466
• /
• 2011

The purpose of this study is basically for the use of simulations to enhance productivity. In this paper, the optimal number of allocation in a small and medium industry which produces eleutherococcus senticosus sap, is performed using simulations. The simulation model was developed under considerations of production layout, process & operation, process time, total work time, work in process (WIP), utilization, failure rate, and operation efficient as inputs, and was validated with careful comparisons between real behaviors and outputs of the production line. Therefore, we can evaluate effects and changes in productivity when some strategies and/or crucial factors are changed. Although too many workers and machines could decrease productivity, the eleutherococcus senticosus sap production line in this paper has been maintained many machines. To solve this problem, we determined the optimal number of workers and machines that could not cause any interrupt in productions using simulations. This simulation model considers diverse input variables which could influence productivity, and it is very useful not only for the production line of Eleutherococcus Senticosus Sap, but also for other production lines with various purposes, especially, in the small and medium industries.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.295-298
• /
• 1996

In this paper, a self-tuning optimal control algorithm is proposed to retain the optimal performance of an active suspension system, when the vehicle has some time varying parameters and parameter uncertainties. We consider a 2 DOF time-varying quarter car model which has the parameter variation of sprung mass, suspension spring constant and suspension damping constant. Instead of solving algebraic riccati equation on line, we propose a neural network approach as an alternative. The optimal feedback gains obtained from the off line computation, according to parameter variations, are used as the neural network training data. When the active suspension system is on, the parameters are identified by the recursive least square method and the trained neural network controller designer finds the proper optimal feedback gains. The simulation results are represented and discussed.

• 대한기계학회논문집A
• /
• 제25권3호
• /
• pp.443-451
• /
• 2001

This paper addresses an on-line scheduling method for track systems in semiconductor fabrication. A track system is a clustered equipment performing photolithography process in semiconductor fabrication. Trends toward high automation and flexibility in the track systems accelerate the necessity of the intelligent controller that can guarantee reliability and optimize productivity of the track systems. This paper proposes an-efficient on-line scheduling method that can avoid deadlock inherent to track systems and optimize the productivity. We employ two procedures for the on-line scheduling. First, we define potential deadlock set to apply deadlock avoidance policy efficiently. After introducing the potential deadlock set, we propose a deadlock avoidance policy using an on-line Gantt chart, which can generate optimal near-optimal schedule without deadlock. The proposed on-line scheduling method is shown to be efficient in handling deadlock inherent to the track systems through simulation.

• Journal of information and communication convergence engineering
• /
• 제8권6호
• /
• pp.721-724
• /
• 2010

In a network router, packet loss may occur when it overflows due to sudden burst traffic. This paper studies how much large buffers are required to eliminate the packet losses. There are buffers on which packet arrive and one output port to which a packet is transmitted at a time. The buffer management algorithm should determine one of the buffers whose packet is transmitted to the output port at each time. The front packet belonging to the buffer determined by the algorithm is transmitted. The goal is to minimize the sum of the lengths of buffers to transmit all the packets. We provide an optimal off-line algorithm and also we show the lower bounds of on-line algorithms. The on-line algorithm has no prior information of the packets having arrived in the future. Its performance is compared to that of the optimal off-line algorithm.

• 한국컴퓨터정보학회논문지
• /
• 제24권11호
• /
• pp.119-126
• /
• 2019

부분역최적화는 역최적화의 흥미로운 변형으로, 주어진 최적화문제와 그 문제의 부분해가 주어지면 이 부분해가 최적해에 포함되도록 문제를 최소한으로 수정하는 문제이다. 이 논문은 라인위에서 정의되는 순환외판원문제(TSP)를 다루는데, 이는 배달시스템, 창고 선반에서 물건을 수집하는 것, 등의 많은 응용을 가진다. 라인 위에서 위치하는 n개의 일이 주어지고 이 중 연속적으로 처리해야하는 일 k개가 부분적으로 주어진다. 각각의 일은 라인 위의 특정 장소에 위치하고 라인을 움직이는 서버에 의해 처리되어야 한다. 우리의 임무는 k개의 일이 최적해에서 연속적으로 처리되도록 n개의 일의 위치를 라인 위에서 최소한으로 조정하는 것이다. 이 논문에서 이 문제와 이 문제의 다양한 변종을 다항시간 내에 푸는 알고리즘을 개발한다. 구체적으로, 서버가 특정한 Forward Trip이라는 특정한 내부 알고리즘을 사용하는 경우와 일반적인 최적 알고리즘을 사용하는 경우에 대한 부분역최적화를 다룬다.

• 대한조선학회논문집
• /
• 제41권4호
• /
• pp.68-76
• /
• 2004

Inherent strain method for analyzing deformation of line-heating is substituting experiments of high cost, because of its high accuracy and quickness. Nowadays, the progressing forms of line-heating are not straight moving motions used to traditional studies, but weaving motions which can diversely input heat source. In shipyard, reasons of weaving motions are induction of a special characteristic by water cooling, maximum temperature limitation for keeping plates from melting, and rhythm for workman's maintaining velocity. On this study, a method which can obtain optimal weaving heating condition was presented, some examples were introduced, and the results corresponded to works of shipyard. Lastly, what the specifications of plates on efficiency are is presented, through the quality standard of shipyard and FEM heat transfer simulation. The ultimate purpose of line heating is the automation, so in case of plates which need weaving heating, the optimal heating condition suggested by this study can be used well in designing coil specifications of induction heaters which are heat input sources of new generation.