• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.1
• /
• pp.97-108
• /
• 2001

Design and evaluation of AGV-based material handling systems are very complicated due to the randomness and the large number of variables involved Vehicle travel time is a key parameter for designing and evaluating AGV systems. Although loaded travel time is relatively easy to estimate, determination of empty vehicle travel time is difficult due to the inherent randomness of material handling systems. Most previous studies assume that the empty vehicle travel time is the same as the loaded travel time or assume very specific environments. This paper presents new vehicle travel time models for AGV-based material transport systems. The research effort is focused on the estimation of empty vehicle travel time under various vehicle dispatching policies. Simulation experiments are used to verify the proposed travel time models.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.5-8
• /
• 2000

Vehicle travel time (empty travel time pius loaded travel time) is a key parameter for designing AGV-based material handling systems. Especially, the determination of empty vehicle travel time is difficult because of the stochastic nature of the empty vehicle locations. This paper presents a method to estimate vehicle travel times for AGV-based material transport systems. The model considers probabilistic aspects for the travel time and vehicle location under random vehicle selection rule and nearest vehicle selection rule. The estimation of empty travel time is of major effort. Simulation experiments are used to verify the proposed travel time model, and the simulation results show that the presented model provides reasonable travel time estimations.

• Korean Management Science Review
• /
• v.17 no.2
• /
• pp.87-95
• /
• 2000

This paper presents two analytical approaches to determine the vehicle fleet size for container shuttle service. The shuttle service can be defined as the repetitive travel between the designated places during working period. In the first approach, the transportation model is adopted in order to determine the number of vehicles required. Its advantages and disadvantages in practical application are also discussed. In the second approach, a logical network which is oriented on job is transformed from a physical network which is focused on demand site. Nodes on the logical network represent jobs which include loaded travel, loading and unloading and arcs represent empty travel for the next jobs which include loaded travel, loading and unloading and arcs represent empty travel for the next job. Then a mathematical formulation is constructed similar to the multiple traveling salesman problem (TSP). A solution procedure is carried out based on the well-known insertion heuristic with the real world data.

• Journal of the Korea Society for Simulation
• /
• v.7 no.1
• /
• pp.39-51
• /
• 1998

In this paper, MVED (Minimum Vehicle's Empty Distance), a new dispatching rule for a Single Loop-Single Vehicle AGV system, is developed. Single Loop-Single Vehicle AGV system consists of segmented bi-directional single loops, in which only one AGV is assigned. The MVED rule is focused on minimizing vehicles empty travel distance. Using simulation, the performance of the MVED is compared with that of existing dispatching rules such as STT/D and MEVTT. The results show MVED rule's better performance than others. ARENA is used as a simulation language.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.1
• /
• pp.107-117
• /
• 2002

The ever-glowing demands for more responsiveness and more flexibility in manufacturing generate greater expectation for the AGV system. So far. a significant amount of research has been carried out to fulfill those requirements. However, the dynamic characteristics of manufacturing systems make it hard to solve the problem analytically. In this paper, the AGV system is analyzed in the production environments which adopt a cycle time to produce materials. The use of the cycle time could eliminate much of uncertainty Inherent In the manufacturing process so that it is possible to build the deterministic model for the AGV systems, which eventually Produce better results on the important issues such as AGV dispatching, determination of the number of AGVs, and empty vehicle travel time.

• Journal of Korean Society of Transportation
• /
• v.13 no.1
• /
• pp.83-94
• /
• 1995

Many taxis called "Mobum" in Seoul are empty and waiting along the curb during the day time. However, it is almost impossible for elderly and handicapped people, and women carrying babies to use them .It is because they can not serve passengers who request services by phone. If taxis, expecially "Mobum" taxis which offer high quality services, can be dispatched based on requests by phone, not only elderly and handicapped people but also auto commuters will easily call and use them. This paper shows a taxi dispatching system. The system minimizes the total empty vehicle hours under given number of empty vehicles and passengers and their locations. As a result, the system maximizes number of services and revenue under given number of taxis. The system adopts a well -known linear programming model and the model can fast and easily be solved by PC level linear programming packages. Also, practical solutions of the system's constraints such as size and travel time forecast are discussed.ecast are discussed.

• Journal of the Korea Society for Simulation
• /
• v.6 no.1
• /
• pp.41-52
• /
• 1997

It is essential to construct an efficient material flow system for the successful introduction of automated manufacturing systems. Automated Guided Vehicle System (AGVS) plays a significant role more and more in modern manufacturing environments, because of the flexibility and the precision they offer. However, as the size and the complexity of systems increase, the problems of dispatching, routing and scheduling of AGVs become complicated due to their independent and asynchronous demands. In this paper, we review relevant papers, and provide a new and more efficient method for dispatching AGV, named MEVTT (Minimum Empty Vehicle Travel Time) and demonstrate its performance and efficiency using simulation.

• IE interfaces
• /
• v.15 no.3
• /
• pp.316-324
• /
• 2002

Automated Guided Vehicles are widely used as an essential material handling system for FMS to provide flexibility and efficiency. We suggest a new dispatching rule based on priority function which considers urgency and empty vehicle travel time under finite buffer capacity. We evaluate the performance of the proposed rule by comparing the performance of Shortest Travel Time/Distance(STT/D) rule in terms of machine utilization, throughput and WIP level using simulation. The simulation results show that the suggested dispatching rule is robust and provides better machine utilization, throughput with comparable WIP level compared to STT/D rule.

• Journal of the Korea Convergence Society
• /
• v.8 no.10
• /
• pp.19-28
• /
• 2017

Recently the cargo transportation is increasing according to lager containerships in the container terminal. Thus, the various ways(such as efficient vehicle scheduling and minimizing delay time) are applied to increase productivity to handle the increasing cargo transportation in the container terminal. In this paper, the optimized model(Solvers) is applied to improve the existing heuristic method as a way of increasing productivity. The experimental design is that the result of two objective functions(minimizing travel and delay time of the empty vehicle) is compared to the result of the existing heuristic method by six sample problems. As a result of the two objective function experiments, the optimized model draws 5.3% more improved performance than the heuristic method in four of six problem samples.

• Journal of the Korea Society for Simulation
• /
• v.23 no.4
• /
• pp.97-109
• /
• 2014

Personal rapid transit (PRT) is a new transportation system, which is energy efficient and brings high quality of customer service. Customers arrive dynamically at stations and request transportation service. In this paper, we propose a new online PRT dispatching algorithm for pickup and delivery of customers. We adopt the nearest neighbor dispatching rule, which is known as performing well in general. We extend the rule with bipartite matching in order to deal with multiple vehicles and customers at the same time. We suggest a systematic way for selecting vehicles that will be considered to be dispatched, since the scope with which vehicles are selected may affect the system performance. We regard the empty travel distance of vehicles and the customer waiting time as the performance measures. By using simulation experiments, it has been examined that the scope of dispatching affects the system performance. The proposed algorithm has been validated by comparing with other dispatching rules for transportation services. We have shown that our algorithm is more suitable for PRT operating environment than other dispatching rules.