• 제목/요약/키워드: Optimal line

검색결과 1,469건 처리시간 0.035초

목표윤곽선이 3 차원 곡선인 형상의 최적블랭크 설계를 위한 형상오차 측정법 (Method of Shape Error Measurement for the Optimal Blank Design of Shapes with 3D Contour Lines)

  • 심현보
    • 소성∙가공
    • /
    • 제24권1호
    • /
    • pp.28-36
    • /
    • 2015
  • After a short review of the iterative optimal blank method, a new method of measuring the shape error for stamped parts with 3D contour lines, which is an essential component of the optimal blank design, is proposed. When the contour line of the target shape does not exist in a plane, but exists in 3D space, especially when the shape of the target contour line is very complicated as in the real automotive parts, then the measurement of the shape error is critical. In the current study, a method of shape error measurement based on the minimum distance is suggested as an evolution of the radius vector method. With the proposed method, the optimal blank shapes of real automotive parts were found and compared to the results of the radius vector method. From the current investigation the new method is found to resolve the issues with the radius vector method.

리얼옵션을 활용한 AMOLED산업 라인 증설의 옵션가치 (REAL OPTIONS VALUATION MODEL OF LINE EXPANSION PROBLEM IN THE AMOLED INDUSTRY LINE EXPANSION)

  • 이수정;김도훈
    • 한국경영정보학회:학술대회논문집
    • /
    • 한국경영정보학회 2008년도 춘계학술대회
    • /
    • pp.957-962
    • /
    • 2008
  • We propose a model for the line expansion problem in the AMOLED (Active Matrix Organic Light Emitting Diodes) industry, which now faces market uncertainty: for example, changing customer needs, technological development path, etc. We focus on the optimal investment time and size of the AMOLED production lines. In particular, employed here is the ROV (Real Options Valuation) model to show how to capture the value of line expansion and to determine the optimal investment time. The ROV framework provides a systematic procedure to quantify an expected outcome of a flexible decision which is not possible in the frame of the traditional NPV (Net Present Value) approach. Furthermore, we also use Monte Carlo simulation to measure the uncertainty associated with the line expansion decision; Monte Carlo simulation estimates the volatility of a decision alternative. Lastly, we present a scenario planning to be conducted for what-if analysis of the ROV model.

  • PDF

CVT 변속속도 개선에 의한 엔진최적운전 (Optimal Engine Operation by Shift Speed Improvement for a CVT)

  • 이희라;김현수
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2001년도 춘계학술대회논문집B
    • /
    • pp.546-551
    • /
    • 2001
  • In this paper, an algorithm to improve the optimal engine operation is suggested by increasing the CVT shift speed. By rearranging the CVT shift dynamic equation, it is found that the CVT shift speed depends on the line pressure as well as the primary pressure. Based on the shift dynamics, an algorithm to accomplish a faster shift speed is presented by increasing the line pressure. In order to apply the algorithm, dynamic models of the line pressure control valve and the ratio control valve are obtained by considering the CVT shift dynamics and model based controllers are designed. It is found from the simulation results that fuel economy can be improved by 2% in spite of the increased hydraulic loss due to the increased line pressure.

  • PDF

엔진 블록 가공라인의 물류분석 (Performance Analysis of the Block Production Line in an Engine Production Plant)

  • 김상훈
    • 한국시뮬레이션학회:학술대회논문집
    • /
    • 한국시뮬레이션학회 1999년도 춘계학술대회 논문집
    • /
    • pp.105-109
    • /
    • 1999
  • Tool shop of the D Heavy Industries Co.(DHI) fabricates engines for a bus, truck, small ship. In order to increase the production capacity of engines, DHI will be established the new tool shop that consists of a block line, head line, assembly line, test line and AS/RS in 1999. In order to assure the production capacity designed of the new tool shop for producing engines and improve the production process of it, it is needed to find a bottleneck process and an optimal way of allocating workloads among machines and workers to maximize the production. In a way to solve this, we model the engine fabrication process of the tool shop and analyze its performance by computer simulation. In this study, we at first identify the bottleneck processes of the engine fabrication process under the designed operation policy. Then, we derive some alternative operating policies applicable to the new tool shop of an engine, and analyze the optimal operation policy by comparing the performance of the tool shop following each alternative policy.

  • PDF

직립 기동 영구자석 동기전동기의 기동토크 최적화 설계 (Optimal Design for Starting -Torque of Line-Start Permanent Magnet Synchronous Motors)

  • 김병국;문지우;김미정;이병준;조윤현
    • 전기학회논문지
    • /
    • 제56권8호
    • /
    • pp.1390-1396
    • /
    • 2007
  • The line-start permanent magnet synchronous motor has a high efficiency and an advantage in constant speed operation regardless of the effect of load variation. However, it is difficult to predict the performance of characteristics accurately, because of the unbalanced starting torque with the initial starting position of the rotor and the generation of a break torque. In this paper the dynamic characteristics of the line-start permanent magnet synchronous motor are described and compared with those of the squirrel-cage induction motor through the simulation to find the characteristics of the permanent magnets and the rotor bars in the line-start permanent magnet synchronous motor. Finally this paper gives the comparison between the simulation results and the experimental results.

Fuzzy PSO Congestion Management using Sensitivity-Based Optimal Active Power Rescheduling of Generators

  • Venkaiah, Ch;Vinod Kumar, D M
    • Journal of Electrical Engineering and Technology
    • /
    • 제6권1호
    • /
    • pp.32-41
    • /
    • 2011
  • This paper presents a new method of Fuzzy Particle Swarm Optimization (FPSO)-based Congestion Management (CM) by optimal rescheduling of active powers of generators. In the proposed method, generators are selected based on their sensitivity to the congested line for efficient utilization. The task of optimally rescheduling the active powers of the participating generators to reduce congestion in the transmission line is attempted by FPSO, Fitness Distance Ratio PSO (FDR-PSO), and conventional PSO. The FPSO and FDR-PSO algorithms are tested on the IEEE 30-bus and Practical Indian 75-bus systems, after which the results are compared with conventional PSO to determine the effectiveness of CM. Compared with FDR-PSO and PSO, FPSO can better perform the optimal rescheduling of generators to relieve congestion in the transmission line.

U라인 라인밸런싱을 위한 분지한계법 (A Branch-and-Bound Algorithm for U-line Line Balancing)

  • 김여근;김재윤;김동묵;송원섭
    • 한국경영과학회지
    • /
    • 제23권2호
    • /
    • pp.83-101
    • /
    • 1998
  • Assembly U-lines are increasingly accepted in industry, especially just-in-time production systems, for the efficient utilization of workforce. In this paper, we present an integer programming formulation and a branch-and-bound method for balancing the U-line with the objective of minimizing the number of workstations with a fixed cycle time. In the mathematical model, we provide the method that can reduce the number of variables and constraints. The proposed branch-and-bound method searches the optimal solution based on a depth-first-search. To efficiently search for the optimal solutions to the problems, an assignment rule is used in the method. Bounding strategies and dominance rules are also utilized. Some problems require a large amount of computation time to find the optimal solutions. For this reason. some heuristic fathoming rules are also proposed. Extensive experiments with test-bed problems in the literature are carried out to show the performance of the proposed method. The computational results show that our method is promising in solution quality.

  • PDF

VE/LCC 분석을 통한 노선 평가 및 최적노선 선정 (Selection of Optimal Railway Line by Analyzing of VE/LCC)

  • 이동욱;곽동구;이태식
    • 한국철도학회:학술대회논문집
    • /
    • 한국철도학회 2004년도 춘계학술대회 논문집
    • /
    • pp.1001-1006
    • /
    • 2004
  • Selection of optimal railway line is taken into consideration include of the purpose of railway, geographical features and facility of management. This study performed opinions of specialists, checking of industrial environment, analysis of bid guideline to select the optimal line and executed AHP method to make quality model and choose weight factors. Therefore, this study executed about six categories which are the efficiency of transportation, facility of planning and construction, economical efficiency, coincidency of planning, the civil appeal and environmental standards, connection with system, and indicated the differences of other method by analyze into specific factors of each categories.

  • PDF

유전자 알고리즘과 콤플렉스법에 의한 고성능 유압휴즈의 최적 설계 (Optimal Design of a Quick-Acting Hydraulic Fuse using Genetic Algorithm and Complex Method)

  • 이성래
    • 드라이브 ㆍ 컨트롤
    • /
    • 제11권4호
    • /
    • pp.32-38
    • /
    • 2014
  • The hydraulic fuse, which responds to the suddenly increased flow on rupture of a line and shuts off the fluid flow, would prevent large spillage of liquid. The quick-acting hydraulic fuse, which is mainly composed of a poppet, a seat, and a spring, must be designed to minimize the leaked flow and to prevent high collision speed between the poppet and seat during fuse operation on a line rupture. The optimal design parameters of a quick-acting hydraulic fuse were searched using the genetic algorithm and the complex method that are kinds of constrained direct search methods. The dynamic behavior of a quick-acting hydraulic fuse was researched using computer simulations that applied the obtained optimal design parameters.

비선형 연속계를 위한 다단계 시간최적 제어기 (Time-Optimal Multistage Controllers for Nonlinear Continuous Processes)

  • 윤중선
    • 한국정밀공학회지
    • /
    • 제12권6호
    • /
    • pp.128-136
    • /
    • 1995
  • The problem addressed in this paper is that of the on-line computational burden of time-optimal control laws for quick, strongly nonlinear systems like revolute robots. It will be demonstrated that a large amount of off-line computation can be substituted for most of the on-line burden in cases of time optimization with constrained inputs if differential point-to- point specifications can be relaxed to cell-to-cell transitions. These cells result from a coarse discretization of likely swaths of state space into a set of nonuniform, contiguous volumes of relatively simple shapes. The cell boundaries approximate stream surfaces of the phase fluid and surfaces of equal transit times. Once the cells have been designed, the bang- bang schedules for the inputs are determined for all likely starting cells and terminating cells. The scheduling process is completed by treating all cells into which the trajectories might unex- pectedly stray as additional starting cells. Then an efficient-to-compute control law can be based on the resulting table of optimal strategies.

  • PDF