Routing and dispatching of multiple mobile agents in integratedenterprises

► We formulate the routing/dispatching problem for mobile agents on a graph. ► We suggest a general two-stage technique combining routing and dispatching. ► We provide a new pseudo-polynomial dynamic programming algorithm. ► We develop a fast fully polynomial-time approximation scheme for the problem. ► The new technique essentially improves on several earlier algorithms.