• 산업경영시스템학회지
• /
• 제45권3호
• /
• pp.40-48
• /
• 2022

An automated material handling system (AMHS) has been emerging as an important factor in the semiconductor wafer manufacturing industry. In general, an automated guided vehicle (AGV) in the Fab's AMHS travels hundreds of miles on guided paths to transport a lot through hundreds of operations. The AMHS aims to transfer wafers while ensuring a short delivery time and high operational reliability. Many linear and analytic approaches have evaluated and improved the performance of the AMHS under a deterministic environment. However, the analytic approaches cannot consider a non-linear, non-convex, and black-box performance measurement of the AMHS owing to the AMHS's complexity and uncertainty. Unexpected vehicle congestion increases the delivery time and deteriorates the Fab's production efficiency. In this study, we propose a Q-Learning based dynamic routing algorithm considering vehicle congestion to reduce the delivery time. The proposed algorithm captures time-variant vehicle traffic and decreases vehicle congestion. Through simulation experiments, we confirm that the proposed algorithm finds an efficient path for the vehicles compared to benchmark algorithms with a reduced mean and decreased standard deviation of the delivery time in the Fab's AMHS.

• 대한산업공학회지
• /
• 제32권2호
• /
• pp.91-97
• /
• 2006

The vehicle routing problem with time windows (VRPTW) is an important problem in third party logistics and supply chain management. We extend the VRPTW to the VRPTW with overtime and outsourcing vehicles (VRPTWOV) which allows the overtime of drivers and the possibility of using outsourcing vehicles. This problem can be applied to third party logistics companies for managing central distributor-local distributors, local distributor-retailers (or customers), and a manufacturer. We develop a mixed integer programming model and a genetic algorithm. Computational results demonstrate the efficiency of the developed genetic algorithm. We also develop a decision support system based on this genetic algorithm.

• 한국자동차공학회논문집
• /
• 제17권1호
• /
• pp.1-11
• /
• 2009

This paper proposes an algorithm capable of detecting vehicles in front or in rear using a monocular camera installed in a vehicle. The vehicle detection has been regarded as an important part of intelligent vehicle technologies. The proposed algorithm is mainly composed of two parts: 1)hypothesis generation of vehicles, and 2)hypothesis verification. The hypotheses of vehicles are generated by the analysis of vertical and horizontal edges and the detection of symmetry axis. The hypothesis verification, which determines vehicles among hypotheses, is done by the AdaBoost algorithm. The proposed algorithm is proven to be effective through experiments performed on various images captured on the roads.

• 산업경영시스템학회지
• /
• 제23권58호
• /
• pp.71-79
• /
• 2000

In this study, through the roadside interview, drivers'feeling about fatigue has been evaluated synthetically and systematically when they drive a vehicle according to their sex, vehicle type, driving career, etc. Also, with the human sensibility evaluation technique, we grasped the human sensibility structure for the fatigue in a vehicle and as an objective evaluation index for comfort and fatigue in a vehicle, we developed a sensibility database. Through the survey and research, extracting and understanding the importance of factors which have influence on the fatigue in driving can be used as basic data that can suggest more comfort and pleasant driving environment to drivers. Also, human sensibility database regarding to the comfort and fatigue in a vehicle can be used as basic data in ergonomic vehicle design, evaluation for seat , comfort seat development, development of vibration reduction method and so on.

• 한국산학기술학회논문지
• /
• 제12권10호
• /
• pp.4283-4287
• /
• 2011

본 논문은 현재 출시되어 있는 소프트타입의 현대 아반테 하이브리드자동차와 하드타입 방식의 도요다 프리우스 자동차를 대상으로 차대 동력계상에서 CVS-75 모드를 주행하면서 발생하는 배출가스특성과 연비특성을 실험적으로 분석하였다. 가솔린 차량에 비해 하이브리드 차량의 연비 및 배출가스 특성이 탁월하였으며 특히, 하드타입의 하이브리드 차량이 소프트타입의 차량에 비해 연비개선효과가 우수하게 나타났다.

• 산업경영시스템학회지
• /
• 제14권23호
• /
• pp.37-46
• /
• 1991

This study deals with the designing of vehicle pedal considering simple reaction time of visual information. Because vehicle accidents may bring about fatal results, the vehicle design which is considered with safity is very important. Though the vehicle design considered with safity is important in the whole parts of vehicle, the designing of pedal which is directly connected the designing of pedal which can minimize reaction time to risk through simple experiments. In the experiments, the experience of driving, the location of brake pedal and the space between brake and accelerator pedal are considered. Using experiment equipment and IBM-PC, simple reaction time was measured. The data which was result from measurement was analyzed with SPSS/PC+. When brake pedal located right side and the space between brake and accelerator pedal was 35cm, reaction was minimized. Based on this results, the vehicle pedal should be designed.

• 산업경영시스템학회지
• /
• 제47권2호
• /
• pp.168-175
• /
• 2024

Due to the complexity of urban area, the city vehicle routing problem has been a difficult problem. The problem has involved factors such as parking availability, road conditions, and traffic congestion, all of which increase transportation costs and delivery times. To resolve this problem, one effective solution can be the use of parcel lockers located near customer sites, where products are stored for customers to pick up. When a vehicle delivers products to a designated parcel locker, customers in the vicinity must pick up their products from that locker. Recently, identifying optimal locations for these parcel lockers has become an important research issue. This paper addresses the parcel locker location problem within the context of urban traffic congestion. By considering dynamic environmental factors, we propose a Markov decision process model to tackle the city vehicle routing problem. To ensure more real situations, we have used optimal paths for distances between two nodes. Numerical results demonstrate the viability of our model and solution strategy.

• 한국군사과학기술학회지
• /
• 제23권1호
• /
• pp.18-27
• /
• 2020

In order to estimate the launch point of a high-speed vehicle, predicting the various characteristics of the vehicle's movement, such as drag and thrust, must be preceded by the estimation. To predict the various parameters regarding the vehicle's characteristics, we build the IMM filter specialized in predicting the parameters of the post-launch phase based on flight dynamics. Then we estimate the launch point of the high-speed vehicle using Inverse Dynamics. In addition, we assume the arbitrary error level of the radar for accuracy of the prediction. We organize multiple-dimensioned IMM structures, and figure out the optimal value of parameters by comparing the various IMM structures. After deriving the optimal value of parameters, we verify the launch point estimation error under certain error level.

• 대한산업공학회지
• /
• 제37권2호
• /
• pp.144-152
• /
• 2011

Most of the models for the vehicle routing problems studied in the literature assumed constant travel times. However, those approaches may give infeasible solutions when traffic congestion causes delays in travel time. To overcome such difficulty, there have been some researches considering the change of the travel time which is called the time dependent vehicle routing problem (TDVRP). TDVRP assumes that the travel time between two locations is not only affected by the distance traveled, but by many other factors including the time of the day. In this paper, we propose a branch-and-price algorithm to solve the TDVRP. The time dependent property of the travel time is dealt with an enumeration scheme with bounding procedures in the column generation procedure identifying a profitable route. The proposed algorithm guarantees the "Non-passing" property to be held in the solutions. The algorithm was tested on problems composed of the Solomon's benchmark instances for 25 and 50 nodes. Computational results are reported.

• 대한산업공학회지
• /
• 제35권1호
• /
• pp.1-14
• /
• 2009

The efficiency of transportation requests fulfillment can be increased through extending the problem of vehicle routing and scheduling by the possibility of subcontracting a part of the requests to external carriers. This problem extension transforms the usual vehicle routing and scheduling problems to the more general integrated operational transportation problems. In this contribution, we analyze the motivation, the chances, the realization, and the challenges of the integrated operational planning and report on experiments for extending the plain Vehicle Routing Problem to a corresponding problem combining vehicle routing and request forwarding by means of different sub-contraction types. The extended problem is formalized as a mixed integer linear programming model and solved by a commercial mathematical programming solver. The computational results show tremendous costs savings even for small problem instances by allowing subcontracting. Additionally, the performed experiments for the operational transportation planning are used for an analysis of the decision on the optimal fleet size for own vehicles and regularly hired vehicles.