A Heuristic for a Heterogeneous Automated Guided Vehicle Routing Problem

Abstract

The article addresses a Heterogeneous Automated Guided Vehicle (AGV) Routing Problem that distributes given jobs to one of the AGVs and finds a route for each AGV while minimizing the sum of tour costs. AGVs are heterogeneous as the cost of traveling between any two locations varies depending on the type of AGV. The problem is a generalization of multiple heterogeneous asymmetric Hamiltonian path problem and a primal-dual heuristic has been developed. Despite the complexity of the problem, the computational results show that the proposed algorithm produces good quality solutions within a relatively short computation time.