A multi-attribute selection of automated guided vehicle using the AHP/M-GRA technique

The objective of this research is to develop and implement a new methodology for multi-attribute selection of automated guided vehicle (AGV) for the material handling. The present paper proposes a modified grey relational analysis (M-GRA) method combined with analytical hierarchy approach (AHP). AHP method is used to assign the relative importance between AGV selection attributes and M-GRA method is applied to determine AGV selection utility index. A proposed AHP/M-GRA technique is more suitable for the decision-making in the presence of vagueness. The methodology is illustrated by means of an example. The study was followed by the validation and the sensitivity analysis of the AHP/M-GRA technique. The results of the study build confidence in suitability of AHP/M-GRA technique for selection of AGV alternatives.     

Flow path design for automated guided vehicle systems

An important factor in the design of automated guided vehicle systems (AGVS) is the flow path design. This paper presents an approach to determining the optimal flow path. The objective is to find the flow path which will minimize total travel of loaded vehicles. The problem is formulated as a zero-one integer program. Examples are presented to demonstrate the approach.     

Flexible guidepath design for automated guided vehicle systems

We address the problem of unidirectional guidepath layout design for automated guided vehicle systems- A two-step layout design method to consider both loaded and empty vehicle movements is developed to guarantee a complete layout design. First, the flow path selection (FPS) problem is formulated to design guidepath layout with the objective of minimizing loaded vehicle movements. Both a mathematical model and a heuristic algorithm for FPS are presented. Since AGV guidepath layouts are used by both loaded and empty vehicles, the FPS does not guarantee a closed or complete layout design. For the case when an incomplete or unclosed layout is produced from the first step, a complementary layout design (CLD) approach to convert the incomplete layout into complete one with the consideration of empty vehicle movements is considered in the second step. A heuristic for the CLD problem is developed. An example problem is used to illustrate the whole design approach.     

Virtual flow paths for free-ranging automated guided vehicle systems

Recent technological development in vehicle design allow vehicles to operate without physical guide paths, i.e. free-ranging automated guided vehicles. This paper addresses the problem of defining flow paths for these vehicles. A model is presented whereby the number of allowable flow paths and the flow directions between nodes (representing pickup/delivery stations and aisle intersections) of the layout network are determined. Examples are presented to demonstrate the approach.     

Potentials for bi-directional guide-path for automated guided vehicle based systems

Most current applications of automated guided vehicle systems (AGVS) in manufacturing shop environments employ uni-directional guide-paths for vehicle routing despite the fact that bi-directional vehicles exist. In this paper comparisons and issues regarding unidirectional and bi-directional flows are presented. Also presented is a model of a bi-directional traffic flow guide-path. The effect of the traffic flow pattern on the shop throughput is demonstrated and compared to that of a uni-directional flow system of an equivalent facility. The model is implemented using computer simulation.     

A construction algorithm for designing guide paths of automated guided vehicle systems

A construction algorithm is suggested to design guide path networks for automated guided vehicle systems (AGVSs). This study uses the total travel time, including waiting and interference time, of vehicles as the decision criteria for determining the direction of path segments on unidirectional guide path layouts. The Q-learning technique is applied to estimate the travel times of vehicles on path segments. Computational experiments were performed to evaluate the performance of the proposed algorithm. The simulation results showed that the proposed algorithm is superior to Kim & Tanchoco's (1993) algorithm in terms of the average travel time, the interference time and the number of deliveries.     

A model for the design of zone control automated guided vehicle systems

An analytical modelling strategy is proposed as a screening device for use prior to the simulation phase in the design of zone control automated guided vehicle systems (AGVS). The proposed model predicts the effects of the major AGVS design variables on system-performance measures including maximum throughput capacity and risk factors associated with shop locking. This is done through a process which specifically evaluates the system operating dynamics associated with vehicle fleet size, guidepath layout, workstation storage capacity, routeing, and, to a less precise extent, vehicle dispatching. Operating dynamics are defined to include vehicle blocking resulting from guidepath contention and variation of in-process storage levels. The objective of the analytical model is to reduce the extent of simulation modelling necessary to design a zone-control AGVS for a given materials-handling workload. The model is illustrated for a sample AGVS with variation in the fleet size, workstation storage capacity and dispatching rule demonstrated.     

Heuristic unidirectional flowpath design approaches for automated guided vehicle systems

In this paper, we address the flowpath design issue of automated guided vehicle systems (AGVSs). In particular we concentrate on the design of unidirectional flowpaths (i.e. vehicles are restricted to travel only in one direction along a given segment of the flowpath). We have developed five different heuristics for the design of unidirectional AGVSs. We have also developed simulated annealing algorithms for the above problem. Our extensive computational results indicate that a composite heuristic (i.e. one that combines the most successful of our five heuristics) yields solutions of comparable quality in a fraction of the time required by simulated annealing. For large-size flowpath design problems, we advocate the usage of composite heuristics over simulated annealing, and in particular for the cases in which inaccurate estimates for the input data in our design problem exist     

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.     

A due date-based dispatching rule for flexible manufacturing systems

In the paper a new dispatching rule is proposed, which extends the CEXSPT rule for dispatching jobs in a general cell's environment, i.e., a multiple-machine cell, where each machine type is assigned to a priority value. Each job is represented as a finite sequence of operations, ordered according to the type priorities of the cell's machines they are performed by. The algebraic background of the dispatching rule is described. The dispatching rule is implemented in the GOLDEN COMMON LISP programming language for IBM PC AT and compatible computers. A computer study of the performance of the proposed dispatching rule is conducted based on a four-machine cell, and the results are reported and analysed. The conclusions obtained are that the proposed dispatching rule produces cell's makespans, better than the CEXSPT dispatching rule, because it reduces idle time on cell's machines.     

Analysis of automated guided vehicle configurations in flexible manufacturing systems

Automated guided vehicle (AGV) systems complement the operation of flexible manufacturing systems (FMS) by providing integrated automated material handling that capitalizes on the system's flexibility. Previous research considering AGV systems for use in FMS installations has focused on complex control strategies to reduce the congestion problem often encountered in these systems. Recently, attention has been given to tandem system configurations that reduce congestion and simplify system control. The present study uses the simulation methodology to compare the performance of three AGV configurations under a variety of experimental conditions. The results indicate that system size, load/unload time, and machine failure rate factors have significant impacts on the operation of the systems considered. In general, with respect to due date performance, it is recommended to use the traditional configuration in small systems while using the tandem/loop configuration in larger systems. Furthermore, it is shown that the addition of the loop to the tandem configuration mitigates the sensitivity of the tandem configuration to the load/unload time factor as well as significantly improving its performance under high load/unload times. Thus, if tandem configuration is desired to reduce congestion and simplify system control, investments must be made to directly reduce the load/unload times or to construct a loop to avoid the load/unload time penalty.     

A dispatching method for automated guided vehicles by using a bidding concept

A dispatching method is suggested for automated guided vehicles by using an auction algorithm. The dispatching method in this study is different from traditional dispatching rules in that it looks into the future for an efficient assignment of delivery tasks to vehicles and also in that multiple tasks are matched with multiple vehicles. The dispatching method in this study is distributed in the sense that the dispatching decisions are made through communication among related vehicles and machines. The theoretical rationale behind the distributed dispatching method is also discussed. Through a simulation study, the performance of the method is compared with that of a popular dispatching rule. RID="*" ID="*" The research was financially supported by the Sasakawa Scientific Research Grant from The Japan Science Society. The original version of the simulation program is provided by Professor Jae Yeon Kim at Dong Yang University, Korea. Correspondence to: J. K. Lim     

Coloured timed Petri net model for real-time control of automated guided vehicle systems

Automated guided vehicle systems (AGVS) are material-handling devices representing an efficient and flexible option for products management in automated manufacturing systems. In AGVS, vehicles follow a guide-path while controlled by a computer that assigns the route, tasks, velocity, etc. Moreover, the design of AGVS has to take into account some management problems such as collisions and deadlocks. The paper presents a novel control strategy to avoid deadlock and collisions in zone-controlled AGVS. In particular, the control scheme manages the assignments of new paths to vehicles and their acquisition of the next zone. Moreover, the use of coloured Petri nets is proposed to model the dynamics of AGVS and implement the control strategy stemming from the knowledge of the system state. Additionally, extending the coloured Petri net model with a time concept allows investigation of system performance. Several simulations of an AGVS with varying fleet size while measuring appropriate performance indices show the effectiveness of the proposed control strategy compared with an alternative policy previously presented.     

Deadlock prediction and avoidance based on Petri nets for zone-control automated guided vehicle systems

Deadlock problems of zone-control uni-directional automated guided vehicle (AGV) systems are discussed in this paper. Deadlocks of two types in such AGV systems are first classified from the perspective of shared resources, i.e. guide-path zones and buffers. A special class of Petri nets, attributed Petri nets (APN), is defined and used to represent the current state and to generate future states of zone-control AGV systems. We propose an algorithmic procedure to predict in real time and to avoid deadlocks that are caused by sharing guide-path zones in zone-control AGV systems. The proposed algorithm utilizes the current system state and future predicted states to avoid deadlocks. These states are obtained and generated from the obtained APN. A modular approach is employed to facilitate the construction of APN models of zone-control AGV systems.     

Inventory-based dispatching of automated guided vehicles on container terminals

This paper deals with automated guided vehicles (AGVs) which transport containers between the quay and the stack on automated container terminals. The focus is on the assignment of transportation jobs to AGVs within a terminal control system operating in real time. First, we describe a rather common problem formulation based on due times for the jobs and solve this problem both with a greedy priority rule based heuristic and with an exact algorithm. Subsequently, we present an alternative formulation of the assignment problem, which does not include due times. This formulation is based on a rough analogy to inventory management and is solved using an exact algorithm. The idea behind this alternative formulation is to avoid estimates of driving times, completion times, due times, and tardiness because such estimates are often highly unreliable in practice and do not allow for accurate planning. By means of simulation, we then analyze the different approaches. We show that the inventory-based model leads to better productivity on the terminal than the due-time-based formulation.     

基于CTPN的自动化仓库系统调度策略研究

针对目前国内外大多数仓库系统调度研究只局限于某一局部问题(或某一子系统)而不能全面考虑整个系统运行状况的问题,在分析已有调度策略的基础上提出了各子系统的优化调度策略,并应用有色时间Petri网(CTPN)进行建模.基于对各子系统的调度特点及其对整个自动化仓库系统的影响的分析,给出了使各子系统能够协调运行的系统整体上的优化调度策略,并采用仿真工具CPN-Tools对调度策略进行了仿真,仿真结果表明,所提出的调度策略可以提高系统的运行效率,可作为研究自动化仓库系统的调度问题的参考手段.     

A framework for the selection of idle vehicle home locations in an automated guided vehicle system

In the study of automated guided vehicles systems (AGVS), one assumption often made in the management of vehicles is the existence of either home locations or a circulatory loop to buffer or hold idle vehicles. A review of AGVS literature reveals that different researchers pursue one idle vehicle management policy or the other. In some studies, idle vehicles are assumed to circulate in some loops in the system while others assume they are routed to some dwell point locations where they are held until they are reassigned. When the dwell point option is implemented, different strategies for implementation are also available. However, what is generally lacking in references to dwell point strategies are the techniques for selecting the optimal or best dwell points for a given facility. In this study, the problem of dwell point or home location specification is addressed. The problem was modelled mathematically to determine the optimal home locations. The emphasis in the paper is on a unidirectional AGVS guide path. The criterion of optimization employed is the minimization of the system response time to vehicle demand points when dispatched from home locations. Solution methodologies are presented and example problems solved to illustrate the applications of the models presented.     

Comparison of dynamic routeing techniques for automated guided vehicle system

An automated Guided Vehicle (AGV) System with a limited number of vehicles cannot perform all of the transportation requests on demand. When a capacitated AGV system is used, then it is possible for the material handling system to become the bottleneck. There are many factors that affect the efficiency of an AGV system including how vehicles are routed and schedules. This paper presents a new dynamic approach to AGV routing. Simulation is used to study the effectiveness of this approach.     

激光导引AGV的自动引导系统设计

 激光导引技术是目前AGV系统普遍采用的引导方法，柔性好和精确高是其突出特点．介绍了AGV的基本概念、导引方式、车体结构和运动控制方式，重点介绍了激光扫描车体方位计算原理并结合路径轨迹推算导向法，设计了激光导引AGV的自动引导系统的结构和软件功能。     

A neural algorithm for finding the shortest flow path for an automated guided vehicle system

The automated guided vehicle (AGV)system is emerging as the dominant technology to maximize the flexibility of material handling, while increasing the overall productivity of manufacturing operations. This paper presents a new way of finding the shortest flow path for an AGV system on a specific routing structure. An optimal solution of the system is determined by using an approach based on the Hopfield neural network with the simulated annealing (SA) procedure. In other words, the proposed approach reduces the total cost of an AGV delivery path from one workstation to another on the shop floor. By changing the temperature of the two-stage SA, a solution can be found that avoids potential collisions between AGVs. Both the flow path and the potential collision, which are major problems in AGV systems, may be solved simultaneously by the proposed neural network approach. Other advantages offered by the proposed method are its simplicity compared with operations research (OR)methods and a decreased number of needed AGVs. The performance of the approach is also investigated.