Abstract
In this paper, we treat the traveling problem in the case where several articles which are dispersed at given palces are moved to specified desitinations respectively, and present an optimal route selection based upon the minimization of running distance or tardiness cost. We apply the idea of Cut Set in graph theory in order to find a feasible route, and estabish a first solution and the limit value associated with it. Then an algorithm to find an optimal route including two criteria is proposed, and its effectiveness is verified by some numerical examples.
