Routing and Dispatching of Automated Guided Vehicles in a Flexible Manufacturing Systems Using Simulated Annealing Algorithm

Flexible Manufacturing Systems (FMS) that are equipped with several automated machine tools, automated material handling, and automated storage and automated retrieval systems are designed and implemented to gain the flexibility and efficiency of production. Effective sequencing and scheduling of the Material Handling Systems (MHS) can have a major impact on the productivity of the manufacturing system. Automated Guided Vehicles (AGVs) are widely used for material handling in such a manufacturing systems. AGVs are much more flexible than other automated material handling devices such as conveyor systems. When products change or production processes change, the reconfiguration of AGVs is much easier than that of a conveyor system. The objective of this paper is to minimize the total distance travel time of AGV in a network with bi-directional paths. In this context, different dispatching strategies such as First in first serve (FIFS), random call stations are simulated. The random call stations are simulated by using non-traditional optimization technique as Simulated Annealing Algorithm (SAA). The computer simulation algorithm is developed using C language. The outputs of the FIFS system and the random call stations using SAA are compared based on the shortest route and minimum total distance traveled and the results are presented.