A polynomial dynamic programming algorithm was suggested to construct orders delivery schedule for one locomotive in a 3 station circuit. An approach to exact solution was proposed and the steps were represented to gather a freight train and build destination routing in order to minimize the total completion time. A point-to-point and a triangle shapes of railways are considered. Computational results are reported to conrfim the strength of our approach. The complexity of this algorithm is O(n8) operations.