LAUSR

This paper deals with a path planning problem of multiple heterogeneous Automated Guided Vehicles (AGVs). AGVs are heterogeneous as having different structures (average velocity) and functions (payload). By focusing on dispatching and routing of AGVs, we solve the problem by transform it into a multiple heterogeneous Hamiltonian path problem. We propose a heuristic based on primal-dual technique to solve the multiple heterogeneous Hamiltonian path problem. We implemented the heuristic and compared with the existing methods. The implementation results show that our proposed heuristic produces reasonable quality solutions within a short computation time.