A dynamic routing method for automated guided vehicles that run on a bi-directional guide path network is suggested. This is an extension of previous dispatching methods that are called “semi-dynamic routing.” In the previous methods, although current traffic status is considered for finding the conflict-free fastest route, it is assumed that active schedules of previously planned vehicles cannot be altered when a schedule for a new vehicle is introduced. In the full-dynamic routing method of this study, it is assumed that the schedules of previously planned vehicles can be altered by introducing the schedule of a new vehicle. In order to evaluate the performance of the proposed algorithm, computational experiments are performed. The results showed that the proposed algorithm reduces the average travel time of vehicles and improves the throughput of a manufacturing system. (Author/publisher)
Abstract