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

금형가공에 있어서 밀링머신의 가공에서는 절삭가공의 잔유물인 버(Burr)가 생성되고, 이러한 버는 가공의 정밀도를 감소시킬 뿐만 아니라 후처리과정(Deburring)을 야기시킴으로 인해서 작업효율의 감소 및 생산성의 비효율적 낭비를 가져오게 된다. 따라서, 정밀도와 작업효율을 극대화하긴 위해서는 버의 생성원리를 파악하고, Exit Burr의 생성부분을 미리 예측하여 버의 생성을 최소화 할 수 잇는 작업 가공계획을 설계하여야 한다. (1)기존의 Burr Exit System에서는 피삭재의 단면형상인 Line과 Are처럼 단순한 형상뿐만 아니라, Line과 Are가 연결되어있는 복잡란 형상에 대해서도 버를 판별한다. 그리고, 가공 후 버가 생성되는 부분을 예측하고, 이때의 Exit Angle을 계산하여 이에 해당하는 기 실험결과 DataBase와 연동하여 생설될 버의 형상과 크기 등의 결과를 제공하여 준다. 더불어, 피삭재의 단면형상이 여러 가지 복합적인 형상으로 이루어져 있는 경우와 다양한 공구 경로까지 고려하여 실제가공과 거의 유사란 상황을 적용할 수 잇는 알고리즘으로 개발하였다. 본 논문에서는 이제까지 개발된 다양한 형상에 대한 Exit Burr 판별 알고리즘을 이용하여 임의형상을 가진 피삭재의 다중가공경로 상에서 발생 가능한 버를 예측하고, 버의 길이나 가공시간 들을 정?화 하여 최적화하는데 필요란 요소를 추출해 보고자 한다. 또한, 이를 인용하여 Face Windows에서의 버의 발생을 최소화 할 수 있는 최적 절삭가공 공구경로를 제시하여, 작업 효율성을 극대화하는 알고리즘을 Windows 응용 프로그램으로 구현하고자 한다.생성하기보다는 기존에 발생된 구매 지시의 우선적 사용과 기존 구매 지시의 납기 일자를 고객 납기에 가장 잘 맞출 수 있도록 변경하는 방안을 제시한다. 이렇게 함으로써 최대한 고객 납기를 만족하도록 계획을 수립할 수 있게 된다. 본 논문에서 제시하는 계획 모델을 사용함으로써 고객 주문에 대한 대응력을 높일 수 있고, 계획의 투명성으로 인한 전체 공급망의Bullwhip effect를 감소시킬 수 있는 장점이 있다. 동시에 이것은 향후 e-Business 시스템 구축을 위한 기본 인프라 역할을 수행할 수 있게 된다. 많았고 년도에 따른 변화는 보이지 않았다. 스키손상의 발생빈도는 초기에 비하여 점차 감소하는 경향을 보였으며, 손상의 특성도 부위별, 연령별로 다양한 변화를 나타내었다.해가능성을 가진 균이 상당수 검출되므로 원료의 수송, 김치의 제조 및 유통과정에서 병원균에 대한 오염방지에 유의하여야 할 것이다. 확인할 수 있었다. 이상의 결과에 의하면 고농도의 유기물이 함유된 음식물쓰레기는 Hybrid Anaerobic Reactor (HAR)를 이용하여 HRT 30일 정도에서 충분히 직접 혐기성처리가 가능하며, 이때 발생된 $CH_{4}$를 회수하여 이용하면 대체에너지원으로 활용 가치가 높은 것으로 판단된다./207), $99.2\%$(238/240), $98.5\%$(133/135) 및 $100\%$ (313)였다. 각각 두 개의 요골동맥과 우내흉동맥에서 부분협착이나 경쟁혈류가 관찰되었다. 결론: 동맥 도관만을 이용한 Off pump CABG를 시행하여 감염의 위험성을

• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.3
• /
• pp.20-33
• /
• 2006

Because of rapid expansion of third party logistics, fierce competition in the transportation industry, and the diversification and globalization of transportation channels, an effective transportation planning by means of multimodal transport is badly needed. Accordingly, this study aims to suggest an optimal transport algorithm for the multimodal transport in the international logistics. As a solution for this problem, first of all, we have applied a pruning algorithm to simplify it, suggesting a heuristic algorithm for constrained shortest path problem to find out a feasible area with an effective time range, which has been applied to the Label Setting Algorithm, consequently leading to multiple Pareto optimal solutions. Also, in order to test the efficiency of the algorithm for constrained shortest path problem, this paper has applied it to the actual transportation path from Busan port of Korea to Rotterdam port of Netherlands.

• The Journal of the Korea Contents Association
• /
• v.6 no.1
• /
• pp.114-125
• /
• 2006

Since wireless Internet services and small mobile communication devices come into wide use as well as the use of GPS is rapidly growing, researches on moving object, whose location information shifts sequently in accordance with time interval, are being carried out actively. Especially, the researches on vehicle moving object are applied to Advanced traveler information system, vehicle tracking system, and distribution transport system. These systems are very useful in searching previous positions, predicted future positions, the optimum course, and the shortest course of a vehicle by managing historical data of the vehicle movement. In addition, vehicle historical data are used for distribution transport plan and vehicle allocation. Vehicle historical data are stored at regular intervals, which can have a pattern. For example, a vehicle going repeatedly around a specific section follows a route very similar to another. If historical data of the vehicle with a repeated route course are stored at regular intervals, many redundant data occur, which result in much waste of storage. Therefore this thesis suggest a vehicle historical data store scheme for vehicles with a repeated route course using similar trajectory which efficiently store vehicle historical data.

• Proceedings of the KSR Conference
• /
• 2007.11a
• /
• pp.1731-1737
• /
• 2007

This paper considers subway routing problem. Given a schedule of train to be routed by a railway stock, the routing problem determines a sequence of trains while satisfying turnaround time and maintenance restrictions. Generally, the solution of routing problem is generated from set partition formulation solved by column generation method, a typical integer programming approach for train-set. However, we find the characteristics of metropolitan subway which has a simple rail network, a few end stations and 13 departure-arrival patterns. We reflect a turn-around constraint due to spatial limitations has no existence in conventional railroad. Our objective is to minimize the number of daily train-sets. In this paper, we develop two basic techniques that solve the subway routing problem in a reasonable time. In first stage, we formulate the routing problem as a Min-cost-flow problem. Then, in the second stage, we attempt to normalize the distance covered to each routes and reduce the travel distance using our heuristic approach. Applied to the current daily timetable, we could find the subway routings, which is an approximately 14% improvement on the number of train-sets reducing 15% of maximum traveling distance and 8% of the standard deviation.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.33 no.3
• /
• pp.1225-1234
• /
• 2013

According to the importance of greenhouse gas emissions, it grows day by day, the goverment is promoting to prepare the specific policy implementation to enhance building energy-saving design standars as the development agenda. In this study, the statistical analysis was performed by Descriptive statistics, Regression analysis, and Hypothesis testing to collect to generate and storage energy usage data in real time to settle parameter setting to affect energy consumption under energy-guzzling apartment not single building. This study is expected to be utilized as the basis for the optimum energy-saving design of the future of the building or facility energy costs rise and the demand for energy-efficient and stable management.

• Journal of Korean Society of Transportation
• /
• v.22 no.7 s.78
• /
• pp.107-117
• /
• 2004

The growing demand for customer-response, made-to-order manufacturing and satisfactory delivery are stimulating the importance of commercial fleet management problem. Moreover, the rapid transformation to the customer-oriented multi-frequency, relatively small fleet, such as home delivery and Perishable goods, requiring prompt delivery and advanced real-time operation of vehicle fleets. In this paper we consider the vehicle routing problem(VRP) to minimize delivery completion time which is equal to the time that last customer wait for the vehicle in fleet operation. The mathematical formulation is different from those for the classical VRP which is minimizing cost/distance/time by running vehicles in manager's point of view. The key aspect of this model is not considering the return time from the last customer to depot in every vehicle path. Thereby, the vehicle dispatcher can afford to dynamically respond to customer demand and vehicle availability. The customer's position concerned with minimizing waiting time that may be applied for the delivery of product required freshness or delivery time. Extensive experiments are carried out to compare the performance of minimizing delivery completion time by using the ILOG Solver which has the advantage of solving quickly an interim solution very near an optimal solution. The experimental results show that the suggested model can easily find near optimal solution in a reasonable computational time under the various combination of customers and vehicles.

• Journal of the Korea Society for Simulation
• /
• v.33 no.2
• /
• pp.37-44
• /
• 2024

The Korean Helicopter Development Program has successfully introduced the Surion helicopter, a versatile multi-domain operational aircraft that replaces the aging UH-1 and 500MD helicopters. Specifically designed for maneuverability, the Surion plays a crucial role in low-altitude tactical maneuvers for personnel transportation and specific missions, emphasizing the helicopter's survivability. Despite the significance of its low-altitude tactical maneuver capability, there is a notable gap in research focusing on multi-mission tactical maneuvers that consider the risk factors associated with deploying the Surion in the presence of enemy air defenses. This study addresses this gap by exploring a method to enhance the Surion's low-altitude maneuvering paths, incorporating information about enemy air defenses. Leveraging the Proximal Policy Optimization (PPO) algorithm, a reinforcement learning-based approach, the research aims to optimize the helicopter's path planning. Visualized experiments were conducted using a Surion model implemented in the Unity environment and ML-Agents library. The proposed method resulted in a rapid and stable policy convergence for generating optimal maneuvering paths for the Surion. The experiments, based on two key criteria, "operation time" and "minimum damage," revealed distinct optimal paths. This divergence suggests the potential for effective tactical maneuvers in low-altitude situations, considering the risk factors associated with enemy air defenses. Importantly, the Surion's capability for remote control in all directions enhances its adaptability in complex operational environments.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2006.05a
• /
• pp.95-108
• /
• 2006

Because of rapid expansion of third party logistics, fierce competition in the transportation industry, and the diversification and globalization of transportation channels, an effective transportation planning by means of multimodal transport is badly needed. Accordingly, this study aims to suggest an optimal transport algorithm for the multimodal transport in the international logistics. Cargoes and stopovers can be changed numerously according to the change of transportation modes, thus being a NP-hard problem. As a solution for this problem, first of all, we have applied a pruning algorithm to simplify it, suggesting a heuristic algorithm for constrained shortest path problem to find out a feasible area with an effective time range and effective cost range, which has been applied to the Label Setting Algorithm, consequently leading to multiple Pareto optimal solutions. Also, in order to test the efficiency of the algorithm for constrained shortest path problem, this paper has applied it to the actual transportation path from Busan port of Korea to Rotterdam port of Netherlands.

• Fire Science and Engineering
• /
• v.32 no.6
• /
• pp.46-54
• /
• 2018

A total of 19 elevators for evacuation were installed in the Lotte World Tower and it is planned to operate the shuttle using the manual key from five refuge floors to the 1st floor in an emergency. In the event of a fire or other disaster, it is necessary to conduct intensive analysis to determine how much RSET reduction could be achieved using the evacuation elevator compared to the existing evacuation plans. When the optimal transportation sharing ratio by the evacuation elevators was 40% at the Lotte World Tower, the RSET of the evacuation scenario in parallel with the elevators in the entire building was calculated to be 1 hour and 2 minutes. The RSET of a conventional evacuation scenario (Walking along the stairs without using the elevators) was calculated to be 1 hour 29 minutes, therefore, the former evacuation scenario were found to have a shortening effect of approximately 27 minutes compared to the latter. On the other hand, to maintain this effect, each part of the evacuation route using the elevator must have the capability to protect the evacuee from any hazards caused by fires, such as smoke, flame, and radiant heat during the evacuation. Moreover, the evacuation route should be continuous from the residence position of the elevator user to the final evacuation site, and be recognized easily.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.30 no.5D
• /
• pp.477-483
• /
• 2010

The existing mass transport system, with its limited capacity and the saturated road networks, has given cause for a new means of transport to be developed, and strong demands for such new means of transport are observed more than ever. However, the traffic authority is seeking a new transport system that focuses more on LRT(Light Rail Transit), a downsized version of the existing urban railroad, rather than one that is appropriate to solve the traffic problems. Moreover, local governments are experiencing difficulties in planning their own mass transportation(bus or urban railroad) as they have no specified criteria for selecting a mass transport system. Accordingly, there has been an increasingly loud voice that calls for criteria to determine which mass transport system befits each transportation corridor. This paper develops a mass-transport demand forecasting model based on the GIS Buffering analysis of each transportation corridor in the city, sets up the capacity for each mass transport system and presents the criteria for selecting an optimal mass transport system for each transportation corridor. It also presents a methodology that identifies necessary and sufficient conditions for selection and evaluation, since it is most important to select the optimal mass-transport system that can meet the demand by each mass-transportation corridor.