Tandem Configurations for Automated Guided Vehicle Systems and the Analysis of Single Vehicle Loops

Automated Guided Vehicle (AGV) systems continue to play a significant role in many low to medium flow manufacturing operations, including Flexible Manufacturing Systems (FMS) and other applications. The relatively inexpensive guidepath, coupled with the high degree of flexibility and control offered in vehicle routing, has made AGV systems a proven and viable handling technology for the 90's.

Traditionally, AGV systems have been implemented and analyzed assuming that every vehicle is allowed to visit any pick up/deposit point in the system. We introduce a conceptually simple and intuitive approach where the system is decomposed into non-overlapping, single-vehicle loops operating in tandem. In this paper, we also develop an analytical model to study the throughput performance of a single vehicle loop. The resulting expressions are the first closed form analytical expressions that have been obtained to determine the throughput capacity of a single vehicle operating under a specific dispatching rule in a non-deterministic environment.     

Performance evaluation of tandem and conventional AGV systems using generalized stochastic Petri nets

This paper investigates the different policies and concepts followed in the traffic management of automated guided vehicle (AGV) systems, and develops the controls for automatically eliminating potential vehicle conflicts in an AGV system. The planning of the AGV system is performed in such a way that there are no conflicts or deadlocks for the vehicles using stochastic Petri nets (SPNs). The major effort is devoted to determining the benefits of the tandem AGV control in comparison with the conventional AGV control method. SPNs have been used to model the different designs of flexible manufacturing systems (FMSs) and with different policies for the movement of material, vehicle path control, inventory planning and tool control. The SPN model is solved and the performance of the system can be evaluated. In this study, the effort is directed to model an FMS with two different types of AGV traffic management methods, namely the conventional and tandem AGV control. A SPN program is used which takes the FMS Petri net model as the input and evaluates the different properties of the Petri net. Finally the performance measures are obtained, which helps in evaluating and comparing the two different AGV traffic management methods.     

Design of an automated guided vehicle-based material handling system for a flexible manufacturing system

Automated guided vehicle (AGV)-based material handling systems (MHSs), which are widely used in several flexible manufacturing system (FMS) installations, require a number of decisions to be made. These include the number of vehicles required, the track layout, traffic pattern along the AGV tracks, and solving traffic control problems. This paper addresses the key issues involved in the design and operation of AGV-based material handling systems for an FMS. The problems arising from multi-vehicle systems are analysed, and strategies for resolving them are examined using analytical and simulation models.     

Conflict resolution in AGV systems

Currently, conflict-free routing in AGV systems is established by means of one of the following three approaches: (i) the problem elimination through the adoption of a segmented path flow or tandem queue configuration; (ii) the identification of imminent collisions through forward sensing and their aversion through vehicle backtracking and/or rerouting; or (iii) the imposition of zone control and extensive route pre-planning, typically based on deterministic timing of the vehicle traveling and docking stages. Among these three approaches, the segmented path flow-based approach presents the highest robustness to the system stochas-ticities/randomness, but at the cost of restricted vehicle routings and the need for complicated handling operations. This paper proposes an alternative conflict resolution strategy that will ensure robust AGV conflict resolution, while maintaining the operational flexibility provided by free vehicle travel on arbitrarily structured guidepath networks. Specifically, the approach advocated in this paper also employs zone control, but it determines vehicle routes incrementally, one zone at a time. Routing decisions are the result of a sequence of safety and performance considerations, with the former being primarily based on structural/logical rather than timing aspects of the system behavior. The resulting control problem is characterized as the AGV structural control. After defining the notion of AGV structural control, the paper proceeds to the formal characterization and analysis of the problem, and to the development of a structural control policy appropriate for the class of AGV resource allocation systems. The paper concludes with some discussion on the accommodation of emerging AGV operational features in the proposed modeling and analysis framework, and the integration of AGV structural control with the broader control of material-flow among the shop-floor workstations.     

Effect of manufacturing system constructs on pick-up and drop-off strategies of multiple-load AGVs

This research investigates the interaction between manufacturing system constructs and the operation strategies in a multiple-load Automated Guided Vehicle System (AGVS) when AGVs in a system can carry two or more loads. The load pick-up problem arises when an AGV stops at a pick-up queue and has to decide which part(s) in the queue should be picked up. Since an AGV can carry multiple loads, a drop-off rule is then needed to determine the next stop for the AGV to deliver one or more loads. Several real-time composite heuristic rules for selecting load and determining the next stop are proposed and evaluated in two manufacturing system constructs: the jobshop and the flexible manufacturing system (FMS). A number of simulation models are developed to obtain statistics on various performance measures of the two system constructs under different experimental conditions. The simulation results reveal that the pick-up rules affect the system more than the drop-off rules. In general, rules to avoid starving and blocking in workstations perform better than the rules for shortest distance in throughput. However, the rules perform differently in jobshop and FMS based on other performance measures, indicating an interaction between system constructs and load selection strategies. The difference in rule performance within the same construct is also affected by several AGVS design parameters. Overall our study suggests that no load pick-up rule is always a champion, and the design of an efficient multiple-load AGVS must consider all issues in a global fashion.     

An introduction to the segmented flow approach for discrete material flow systems

Due to increases in versatility and the complexity of demands in modern manufacturing systems a growing need has evolved t0 simplify the control of these systems while maintaining a high degree of efficiency and flexibility in operation. The segmented flow approach (SFT) suggested in this paper is a possible solution to these needs. This structure simplifies the control task by reducing the need for dispatching and by eliminating the need for routeing material handling devices and scheduling traffic at intersections. Each task involves only one material handling device and one possible route. This structure maintains a high degree of efficiency by operating material handling devices in a bidirectional mode and eliminates congestion and blocking by operating them on mutually exclusive tracks. This paper introduces a design procedure for an SFT implemented system using a minimum cost objective, and compares the throughput and time in system performance of this system to a conventional system and a tandem type system by means of simulation.     

A machine-to-loop assignment and layout design methodology for tandem AGV systems with single-load vehicles

In this paper, we propose a method for design of tandem automated guided vehicle (AGV) systems with single-load vehicles. We consider the concurrent design of machines layout and AGV guide paths for a tandem system. Our goal is to devise a method that can achieve the following objectives: (1) maximise the workload balance between loops; (2) minimise the inter-loop flow; and (3) minimise the total flow distance. Our method solves the problem in four stages, considering the machines layout and the tandem paths at the same time. It assigns machines to loops, determines the layout of each loop, arranges loops on the floor, and finally designs a transportation centre to link the loops. We compare the performance of our method with a sequential design method that first determines the layout and then assigns the machines to loops. We solve a number of randomly generated problems for both methods. Results indicate that the proposed algorithm performs faster and achieves lower values of inter-loop flows and inter-loop flow distances.     

Deadlock avoidance in an automated guidance vehicle system using a coloured Petri net model

This paper addresses the problem of deadlock control in automated guided vehicle (AGV) systems for automated manufacturing systems with unidirectinal guided paths. First, a Petri net (PN) model was developed for the problem. Then, by using the PN model developed, the condition for deadlock-free operation in AGV system and a control law are presented. To avoid deadlocks in AGV systems by this law, one needs only to observe the state of the system and check the number of free spaces available in some of the circuits. It is estimated that the proposed control law is simple enough to be used in the real-time control of contemporary system configuration. Three examples are used to show the application and efficiency of the proposed control law.     

A beam search-based algorithm and evaluation of scheduling approaches for flexible manufacturing systems

This paper presents a new algorithm for the flexible manufacturing system (FMS) scheduling problem. The proposed algorithm is a heuristic based on filtered beam search. It considers finite buffer capacity, routing and sequence flexibilities and generates machine and automated guided vehicle (AGV) schedules for a given scheduling period. A new deadlock resolution mechanism is also developed as an integral part of the proposed algorithm. The performance of the algorithm is compared with several machine and AGV dispatching rules using mean flow time, mean tardiness and makespan criteria. It is also used to examine the effects of scheduling factors (i.e., machine and AGV load levels, routing and sequence flexibilities, etc.) on the system performance. The results indicate that the proposed scheduling algorithm yields considerable improvements in system performance over dispatching rules under a wide variety of experimental conditions.     

Design of material transportation system for tandem automated guided vehicle systems

A new design concept of materialtransportation system is proposed on the basis of tandem automated guided vehicle (AGV) systems. The first design stage is to find the one and only one optimal transfer point for each traffic zone. All in-process parts to be moved into and out of a zone must go through the specified transfer point and parts can be moved directly to their destinations. The second design stage is to link all transfer points as a 'transportation centre' by several bidirectional tracks. This design concept can simplify material transportation system and provides accurate estimation of traffic load in a zone.     

PRODUCTION PLANNING DECISIONS IN FLEXIBLE MANUFACTURING SYSTEMS WITH RANDOM MATERIAL FLOWS

In this paper, we consider the FMS planning problem of determining optimal machine workload assignments in order to rninimize mean part flow time. We decompose this problem into the subproblems of first forming machine groups and next assigning operations to these groups. Three types of grouping configurations—no grouping, partial grouping and total grouping—are considered. In both no grouping and partial grouping, each machine is tooled differently. While each operation is assigned to only one machine in no grouping, partial grouping permits multiple operation assignments. On the other hand, total grouping partitions the machines into groups of identically-tooled machines; each machine within a group is capable of performing the same set of operations. Within this grouping framework, we consider three machine loading objectives—minimizing the total deviation from the optimal group utilization levels, minimizing part travel and maximizing routing flexibility, for generating a variety of system configurations.

A queueing network model of an FMS is used to determine the optimal configurations and machine workload assignments for the no grouping and total grouping cases. It is shown that under total grouping, the configuration of M machines into G groups that minimizes flow time is one in which the sizes of the machine groups are maximally unbalanced and the workload per machine in the larger groups is higher. This extends previous results on the optimality of unbalancing both machine group sizes and machine workload to the mean flow time criterion.

A simulation experiment is next conducted to evaluate the alternative machine configurations to understand how their relative performance depends upon the underlying system characteristics, such as system utilization level and variation among operation processing times. We also investigate the robustness of these configurations against disruptions, such as machine unreliability and variation in processing batch sizes. While different configurations minimize mean flow time under different parameter values, partial grouping with state-dependent part routing performs well across a wide range of these values. Experimental results also show that the impact of disruptions can be reduced by several means, such as aggregating operations of a part to be performed at the same machine, in addition to providing routing flexibility.     

Dynamic relative positioning of AGVs in a loop layout to minimize mean system response time

One of the control decisions in the operation of an automated guided vehicle (AGV) system is to determine the home locations of idle vehicles. In this paper, the problems of selecting home location of a vehicle when idle in a single loop AGV network is presented. As the number of unit loads to be picked up at each workstation dynamically changes over time, the optimum home location of vehicles may also change. Based on the objective of minimizing the expected response time of a vehicle, models are constructed. Example problems are given to illustrate the use of the solution algorithms. The results of the system response times obtained using the dynamic dwell point models are compared with those of other dwell point rules.     

AGV controlled FMS

One of the key factors that prevent the implementation of Flexible Manufacturing Systems (FMS) is the elaborate cost associated with the control software. In a FMS there is often a wide range of equipment, such as personal computers, Programmable Logical Controllers (PLCs), CNC Machines or robots, each of these having their own 'intelligence' and library of data. Providing a means of communication between these individual controllers has traditionally been achieved using a Local Area Network (LAN). This proves more expensive when traditional manual operated machines have to be integrated into the system. The model described in this paper provides an alternative to the conventional use of a LAN in a FMS environment. In the design solution, an Automatically Guided Vehicle (AGV) is used as both the materials handling unit and the communications line linking each station to the host controller. Communications between the AGV and peripheral equipment is achieved using a standard infrared data link, eliminating hard-wiring and network protocols. A simulation model has been developed to demonstrate the feasibility of such a system, using industrial data. The software package Witness is used to develop the simulation model. The objective from developing this simulation model is to test whether an AGV is capable of meeting the demands of such a scenario. The research undertaken aims to test this by modelling an existing factory layout. Using this layout and captured machining times and part routes, from the factory database, the feasibility of such AGV controlled production system is established. The model shows that such a system is plausible in a scenario where machine times are high and the distance between machines is large.     

A study of scheduling rules of flexible manufacturing systems: A simulation approach

This study examines the effects of scheduling rules on the performance of flexible manufacturing systems (FMSs). Several machine and AGV scheduling rules are tested against the mean flowtime criterion. In general, scheduling rules are widely used in practice ranging from direct applications as a stand-alone scheduling scheme to indirect application as a part of complicated scheduling systems. In this paper, we compare the rules under various experimental conditions by using an FMS simulation model. Our objective is to measure sensitivity of the rules to changes in processing time distributions, various levels of breakdown rates, and types of AGV priority schemes. A comprehensive bibliography is also presented in the paper.     

Determination of optimal AGV fleet size for an FMS

The required number of AGVs necessary to perform a given level of material handling task in an FMS environment is determined using analytical and simulation modelling. The analytical method involves consideration of load handling time, empty travel time, and waiting and blocking time. Load handling time is computed from given system parameters. Determination of empty vehicle travel is difficult due to the inherent randomness of an FMS. Several research studies for this purpose are discussed and a new model is proposed. It entails formulation of a mixed integer programme with an objective of minimizing empty trips. The constraints are in the form of upper and lower bounds placed on the total number of empty trips starting from or ending at a load transfer station. The phenomena of vehicle waiting and blocking are also discussed. The cumulative impact of these three time estimates are then translated into an initial estimate of AGV fleet size as predicted by individual models. The method is applied to an illustrative example. Finally, simulation methodology is used to validate the initial estimates of fleet size. The results indicate that the different models either under-estimate or over-estimate the actual number of vehicles required in the system. The proposed model, though under-estimates the minimum AGV requirement, yet provides results which are close to the simulation results. Hence, it can be used as an analytical tool prior to the simulation phase of AGVS design.     

Heavy traffic analysis of a single vehicle loop in an automated storage and retrieval system

We consider an automated storage/retrieval system in which cargo moves between the storage/retrieval machines and the system entrance/exit stations through a single automated vehicle loop. Past studies indicated that the cargo waiting time in the loop is affected by the dispatching rules, which govern the sequence of the cargo to be handled. In this paper, we show that the loop configuration, which has received little research attention, also has a big impact on the cargo waiting time. When the first-come-first-served dispatching rule is used, we derive the relationship between the number of stations and the ratio of the average cargo retrieval time to the average cargo storage time. When the first-encountered-first-served dispatching rule is used, we show that even the arrangement of the input channel and the output channel of a station can have significant impact on the cargo waiting time. Furthermore, we derive a formula for the vehicle visit rate for each station under heavy traffic conditions. This formula helps to explain the phenomenon that the waiting times at different stations can be very different even when the loop is symmetrically designed and the cargo arrival rates to the stations are similar. In addition to analytical models, we use simulations to evaluate the performance of different loop configurations. Our research suggests that a substantial improvement can be achieved by making proper adjustments to the loop configuration.     

Load selection of automated guided vehicles in flexible manufacturing systems

This paper examines the operation of multiple-load AGVs in a flexible manufacturing system where AGVs in the system are capable of carrying two or more loads. The load selection problem arises when an AGV stops at a pick-up queue and has to decide which part(s) should be picked up. Five heuristic rules that may be used to select the load to be carried were suggested and evaluated under a hypothetical flexible manufacturing system with the aid of computer simulation. The results revealed that the variable-route-part-priority (VP) rule and fixed-route-part-priority (FP) rule generated significantly higher throughput than their counterparts, while the ’pick-all-send-nearest’ (PN) rule outperformed the other rules in part flowtime and work-in-process level. The results also suggest that when the carrying capacity of the AGV increases, the performance differences among the rules also increase. This finding sustains the need to explore an efficient operation strategy of multiple-load AGVs in flexible manufacturing systems.     

Interaction between dispatching and next station selection rules in a dedicated flexible manufacturing system

The interaction between nine dispatching and four next station selection rules in a relatively large dedicated FMS is investigated. The FMS contains 16 workstations with local buffers, nine load/unload stations, and produces six different part types. A simulation model is used, and analysed as a steady-state model. Flowtime is taken as the main criterion. It is found that WINQ (select the station whose input buffer contains the smallest amount of work) dominates, performing significantly better than the other next station selection rules considered across all dispatching rules, with few significant differences between dispatching rules when combined with WINQ. SIO/TOT (select the job with the smallest ratio obtained by dividing the processing time of the imminent operation by the total processing time for the part) performs marginally better than the other dispatching rules, particularly SIO (select the job with the shortest imminent processing time). Reasons for when a next station selection rule is more important than a dispatching rule, and vice versa, are discussed.     

A simulated annealing algorithm based on a closed loop layout for facility layout design in flexible manufacturing systems

Facility layout design problems in flexible manufacturing systems (FMS) differ from traditional facility design problems and are more difficult to solve because there are more constraints that must be considered (i.e., cell shape, cell orientation, pick-up and drop-off point positions). The focus of this paper is on the closed loop type layout, which is based on a predetermined layout pattern. This layout pattern is commonly found in manufacturing settings since it requires a simplified material handling system configuration and since it facilitates a modular and expandable layout structure. The open-field type layout problem, where there is no predetermined layout pattern, may potentially have a more efficient configuration, since there are fewer restrictions. However, this problem is more difficult to solve and may result in configurations that are not desirable due to the lack of structure or modularity. The procedure developed in this paper improves the efficiency of the closed loop configuration by changing the rectangular shape of the loop to different sizes. In many cases, the resulting closed loop layout proves to be as efficient as the open field layout. A simulated annealing procedure (SA-CL) is used to search for the configuration that minimizes the total material handling costs. A comparison of the results with existing methods indicates that, based on solution quality and computational time, the SA-CL offers a favourable alternative for efficient layout design.     

Performance evaluation of a flexible machining/assembly system and routing comparisons

This paper discusses the performance evaluation of the flexible machining/assembly systems (FMS/FAS) of a central server type, and gives a comparative consideration of a fixed, dynamic versus an ordered-entry routing rule. First, the steady-state equations are given, and the system throughput is obtained. Next, the system configurations of FMS/FAS are numerically discussed on the basis of system throughput. Finally, the superiority of an ordered-entry routing rule is numerically discussed for development of routing theory.