抄録
In this paper we consider the problem of routing multiple AGVs in a dynamic job-shop scheduling environment. In the literature, time window based routing methods have been proposed to search the shortest path with avoiding collisions in arbitrary designed bi-directional guide path systems. However, this approach is computationally inefficient for larger scale problems and ill suited to situations where vehicle interruptions are possible. The aim of this paper is to develop a hybrid routing strategy that combines a time window based routing method and an autonomous routing decision of each AGV. Numerical experiments show that the proposed hybrid routing method can achieve the high production performance with the efficient movement of AGVs and reasonable calculation time.
