• 한국경영과학회지
• /
• 제23권4호
• /
• pp.87-96
• /
• 1998

Using the concept of cellular manufacturing systems(CMS) in job shop manufacturing system is one of the most innovative approaches to improving plant productivity. However. several constraints in machine duplication cost, machining capability, cell space capacity, intercell moves and exceptional elements(EEs) are main problems that prevent achieving the goal of maintaining an ideal CMS environment. Minimizing intercell part traffics and EEs are the main objective of the cell formation problem because it is a critical point that improving production efficiency. Because the intercell moves could be changed according to the sequence of operation, it should be considered in assigning parts and machines to machine ceil. This paper presents a method that eliminates EEs under the constraints of machine duplication cost and ceil space capacity attaining two goals of minimizing machine duplications and minimizing intercell moves simultaneously. Developing an algorithm that calculates the machine duplications by cell-machine incidence matrix and part-machine Incidence matrix, and calculates the exact intercell moves considering the sequence of operation. Based on the number of machine duplications and exact intercell moves, the goal programming model which satisfying minimum machine duplications and minimum intercell moves is developed. A linear programming model is suggested that could calculates more effectively without damaging optimal solution. A numerical example is provided to illustrate these methods.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1998년도 추계학술대회 논문집
• /
• pp.263-266
• /
• 1998

Several constraints in machine duplication cost, machining capability, cell space capacity, intercell moves and exceptional elements(EEs) are main problems that prevent achieving the goal of ideal Cellular Manufacturin System (CMS) environment. Minimizing intercell part traffics and EEs are the main objective of the cell formation problem as it's a critical point that improving production efficiency. Because the intercell moves could be changed according to the sequence of operation, it should be considered in assigning parts and machines to machine cells. This paper presents a method that eliminates EEs under the constraints of machine duplication cost and cell space capacity attaining two goals of minimizing machine duplications and minimizing intercell moves simultaneously. Developing an algorithm that calculates the machine duplications by cell-machine incidence matrix and part-machine incidence matrix, and calculates the exact intercell moves considering the sequence of operation. Based on the number of machine duplications and exact intercell moves, the goal programming model which satisfying minimum machine duplications and minimum intercell moves is developed. A linear programming model is suggested that could calculates more effectively without damaging optimal solution. A numerical example is provided to illustrate these methods.

• 경영과학
• /
• 제24권1호
• /
• pp.91-111
• /
• 2007

In this paper an effective two-phase approach adopting modified p-median mathematical model is proposed for grouping machines and parts in cellular manufacturing(CM). Unlike the conventional methods allowing machines and parts to be improperly assigned to cells and families, the proposed approach seeks to find the proper block diagonal solution where all the machines and parts are properly assigned to their most associated cells and families in term of the actual machine processing and part moves. Phase 1 uses the modified p-median formulation adopting new inter-machine similarity coefficient based on the non-binary production data-based part-machine incidence matrix(PMIM) that reflects both the operation sequences and production volumes for the parts to find machine cells. Phase 2 apollos iterative reassignment procedure to minimize inter-cell part moves and maximize within-cell machine utilization by reassigning improperly assigned machines and parts to their most associated cells and families. Computational experience with the data sets available on literature shows the proposed approach yields good-quality proper block diagonal solution.

• 한국해양공학회지
• /
• 제6권1호
• /
• pp.113-121
• /
• 1992

In this study, the variation of fatigue strength in CF/PEEK and CF/EPOXY, the matrix and interfacial strength of which differ from each other, has been studied from the viewpoint of microfracture behavior. The results obtained are as follows; According as the fatigue strength moves from the lower cycle range to the higher cycle range, that of CF/PEEK shows higher curve than that of CF/EPOXY does. In the early stage of fatigue life, the characteristic of fatigue crack in CF/PEEK is mainly the fracture of longitudinal fiber, while that in CF/EPOXY is the fracture of transverse fiber. The difference of fatigue strength in these materials can be explained by the fracture criteria of transverse fiber and longitudinal fiber.

• 한국산학기술학회논문지
• /
• 제21권6호
• /
• pp.634-639
• /
• 2020

일반적으로 비선형 시스템은 1차와 2차 시스템의 곱으로 선형화할 수 있기 때문에 시스템은 2차 시스템의 중근, 복소근, 서로 다른 두 실근과 1차 시스템의 근을 극점으로 가진다. 이런 극점의 위치 변경으로 시스템의 안정성과 응답특성을 개선할 수 있어서 다양한 방법으로 극점을 이동시키는 제어기를 설계한다. 여러 방법 중에서 LQ 제어는 이득여유와 위상여유의 안정성을 보장한다. 그런데 시행착오 방법으로 가중행렬을 선택하여 원하는 응답특성을 얻기 때문에 극점의 위치를 임의로 지정하기 어렵다. 이 논문은 조단블록을 가진 다중 중근을 원하는 실근으로 이동시키는 LQ 제어의 가중행렬을 선택하는 방법에 관한 것이다. 대각행렬 형태의 제어가중행렬과 ρ_d와 ϕ_d의 2개 변수 상태가중행렬을 갖는 해밀토니안 시스템의 특성방정식에서 중근과 가중행렬의 관계식을 유도한다. 그리고 상태가중행렬이 양의 준정부호 행렬이 될 조건에서 실근으로 이동할 중근의 이동범위를 구하고, 좌표평면에 표현한다. 이 범위에서 극점을 선택하고, 관계식으로 가중행렬을 계산하는 방법을 제안한다. 그리고 예제를 통해 조단블록을 갖는 4개의 중근을 원하는 서로 다른 실근으로 이동시키는 가중행렬과 제어법칙의 계산과정을 통해 제안한 방법의 유용성을 확인하였다.

• 한국ITS학회 논문지
• /
• 제21권6호
• /
• pp.115-131
• /
• 2022

대한민국에서 수송으로 인해 발생하는 이산화탄소(CO₂) 배출량은 전체의 16.5%이며, 이중 도로교통 부문이 96.5%를 차지한다. 따라서 도로교통 부문에서 발생하는 CO₂ 배출량을 줄이기 위한 노력이 계속되고 있다. 최근 스마트 교차로의 확대에 따라 교차로를 통과하는 개별차량에 대한 모니터링 기회가 점차 늘어나고 있으며, 장래 자율주행차 보급 확산에 따라 개별차량주행 자료 수집 가능성 또한 커지고 있다. 이에 맞춰 강남구 소재 5개 교차로에 설치된 영상검지기를 통해 얻은 차량의 차종, 교통량, 속도, 가속도와 같은 실제 데이터를 활용해 신호교차로에 접근하는 차량에 대한 CO₂ 배출 현황 조사를 실시했다. 이렇게 수집된 데이터를 초당 데이터를 분석하도록 개량된 MOVES-Matrix 모형에 대입해 2개 대형교차로와 3개 소형교차로에서 하루 동안 발생하는 CO₂ 배출량은 평균 3.1톤임을 확인했다. 본 연구는 실제 개별차량 데이터와 개량된 모형을 활용한 CO₂ 배출량 분석의 새로운 가능성을 보여주는 한편, CO₂ 배출량을 보다 더 정확히 조사해야 하는 필요성을 제시한다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.1829-1832
• /
• 2004

Closed loop stability of Extended Dynamic Matrix Control (EDMC) is investigated for limited sampling time. Linear approximation of the sensitivity functions is employed in the derivation of the stability condition. It is shown that the closed loop system will be stable if the control moves suppression coefficient ${\lambda}$ is taken arbitrarily large. Special cases such as M=P=1 and M=1, P>1 are discussed in more details.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.444-447
• /
• 2004

A new approach to compute the control moves in Extended Dynamic Matrix Control (EDMC) is presented. In this approach, the number of variables, determined in the inner loop of the control algorithm using iterative methods, is reduced from P , the prediction horizon to M , the control horizon. Since M is usually much smaller than P , this modifies the control algorithm from computational point of view. To justify the modification, the computational requirements are compared to those of the existing EDMC algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 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.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• pp.729-731
• /
• 2004

This paper deals with the design of a low order $H_{\infty}$ controller by using an iterative linear matrix inequality (LMI) method. The low order $H_{\infty}$ controller is represented in terms of LMIs with a rank condition. To solve the non-convex rank-constrained LMI problem, a linear penalty function is incorporated into the objective function so that minimizing the penalized objective function subject to LMIs amounts to a convex optimization problem. With an increasing sequence of the penalty parameter, the solution of the penalized optimization problem moves towards the feasible region of the original non-convex problem. The proposed algorithm is, therefore, convergent. Numerical experiments show the effectiveness of the proposed algorithm.