• 산업기술연구
• /
• 제10권
• /
• pp.21-32
• /
• 1990

Car body resonance often generates severe vibrational and noise problems in vehicle compartment. In this study, vibrational characteristics of 2-D vehicle compartment model is investigated and structural modification is carried out by numerical simulation to shift natural frequencies and to reduce stresses in resonance. To this end, ring models of the compartment are manufactured and analysed by FEA. The results are verified to be in good agreement with those of experimental modal testing. And the results of this study offer efficient strucural modification technique for vibration reduction of real cars.

• 대한산업공학회지
• /
• 제16권2호
• /
• pp.23-36
• /
• 1990

A unit-load automated guided vehicle system is considered in which a single vehicle is operated on a unidirectional path in a closed loop. The vehicle serves a manufacturing cell moving pallets from one station to another based on the "First-Encountered-First-Serve" dispatching rule. An approximation method is developed to compute the mean waiting time of an arbitrary pallet at each station. Extensive numerical experiments, performed for various problems, yield fairly good results in most of the cases compared with those obtained by simulation method.

• 산업경영시스템학회지
• /
• 제19권37호
• /
• pp.263-269
• /
• 1996

The cost and customer service level of a logistics system depend primarily on the system design of the physical supply system and physical distribution system. The study presents the mathematical model and a huristic solution method of a combined location - vehicle routing problem(LVRP). In LVRP the objective is to determine the number and location of the distribution centers, the allocation of customers to distribution centers, and the vehicle delivery routes, so as to minimize the logistics total cost and satisfy the customer.

• 산업경영시스템학회지
• /
• 제16권28호
• /
• pp.195-202
• /
• 1993

This paper considers the vehicle routing problem taking account of not only delivery but pick-up at the same time. A mathematical formulation is presented for finding the route which satisfies all the demands of customers and enables picking up most containers without exceeding the capacity of the vehicle. A table comparing traveling distance and the pick-up amount is provided by using heuristic method, which will be of help to the decision makers.

• 대한산업공학회지
• /
• 제33권3호
• /
• pp.303-311
• /
• 2007

This study deals with a type of vehicle routing problem faced by manager of some department stores during peak sales periods. The problem is to find a set of traveling paths of vehicles that leave a department store and arrive at a destination specified for each vehicle after visiting customers without violating time and capacity constraints. The mathematical model is formulated with the objective of maximizing the sum of the rewards collected by each vehicle. Since the problem is known to be NP-hard, a heuristic algorithm is developed to find the solution. The performance of the algorithm is compared with the optimum solutions obtained from CPLEX for small size problems and a priority-based Genetic Algorithm for large size problems.

• 한국디자인학회:학술대회논문집
• /
• 한국디자인학회 2004년도 춘계 학술발표대회 논문집
• /
• pp.310-311
• /
• 2004

• 한국산학기술학회논문지
• /
• 제10권1호
• /
• pp.67-74
• /
• 2009

본 연구에서는 임베디드 시스템과 지그비(Zigbee) 무선통신을 기반으로 지능형 자동차를 위한 모니터링 및 제어가 가능한 임베디드 웹서버를 구축하였다. 자동차의 모든 정보를 담고있는 ECU(Electronic Control Unit)에 주제어기와 임베디드 시스템을 인터페이스 시켜 자동차의 운행정보를 모니터링하고, 자동차의 내, 외부에 추가된 센서신호는 지그비 통신을 이용해 임베디드 시스템에 전달하도록 하였다. 임베디드 시스템을 이용해 웹서버를 구축했기 때문에 개인용 컴퓨터 및 모바일 기기를 이용하여 차량에 접속할 수 있으며, 자동차의 상태를 실시간 감지하고 제어할 수 있다.

• 대한산업공학회지
• /
• 제32권3호
• /
• pp.226-235
• /
• 2006

Telematics is expected to be one of the fastest growing businesses in information technology area. It may create a new emerging market in industry related to automotive, telecommunications, and information services. Especially vehicle navigation service is considered as a killer application among telematics service applications. The current vehicle navigation service typically recommends a single path that is based on the traveling time or distance from the origin to the destination. The system provides two options for users to choose either via highway or via any road. Since the traffics and road conditions of big cities are very complicated and dynamic, the demand of multi-path guidance system is increasing in telematics market. The multi-path guidance system should allow drivers to choose a path based on their individual preferences such as traveling time, distance, or route familiarity. Using the Lawler's algorithm, it is possible to find multiple paths; however, due to the lengthy computational time, it is not suitable for the real-time services. This study suggests a computationally feasible and efficient heuristic multiple paths finding algorithm that is reliable for the real-time vehicle navigation services.

• 산업경영시스템학회지
• /
• 제42권4호
• /
• pp.116-125
• /
• 2019

The Dynamic Vehicle Routing Problem (DVRP) involves a combinatorial optimization problem where new customer demands become known over time, and old routes must be reconfigured to generate new routes while executing the current solution. We consider the high level of dynamism problem. An application of highly dynamic DVRP is the ambulance service where a patient contacts the service center, followed by an evaluation of case severity, and a visit by a practitioner/ ambulance is scheduled accordingly. This paper considers a variant of the DVRP and proposes a decentralized algorithm in which collaborators (Depot and Vehicle), both have only partial information about the entire system. The DVRP is modeled as a periodic re optimization of VRP using the proposed decentralized algorithm where collaborators exchange local information to achieve the best global objective for the current state of the system. We assume the existence of a dispatcher e.g., headquarter of the company who can communicate to vehicles in order to gather information and assigns the new visits to them. The effectiveness of the proposed decentralized coordination algorithm is further evaluated using benchmark data given in literature. The results show that the proposed method performed better than the compared algorithms which utilize the centralized coordination in 12 out of 21 benchmark problems.

• Structural Engineering and Mechanics
• /
• 제43권1호
• /
• pp.1-13
• /
• 2012

A fast precise integration method (FPIM) is proposed for solving structural dynamics problems. It is based on the original precise integration method (PIM) that utilizes the sparse nature of the system matrices and especially the physical features found in structural dynamics problems. A physical interpretation of the matrix exponential is given, which leads to an efficient algorithm for both its evaluation and subsequently the solution of large-scale structural dynamics problems. The proposed algorithm is accurate, efficient and requires less computer storage than previous techniques.