Developing Conflict-Free Routes for Automated Guided Vehicles

摘要: Automated guided vehicles AGVs are a highly sophisticated and increasingly popular type of material handling device in flexible manufacturing systems. This paper details solution methodologies for the static routing problem which demand assignment known; focus is to obtain an implementable within reasonable amount computer time. The objective minimize makespan, while on bidirectional network conflict-free manner. solved via column generation. master this generation procedure has makespan vehicle interference constraints. Columns routes iteratively generated each AGV. subproblem constrained shortest path with time-dependent costs edges. An improvement developed better obtained at end master-subproblem interactions. Several methods iterating between experimented in-depth computational experiments. Our empirical results indicate that as whole usually generates solutions few percent proposed bound,