Abstract: The transportation problem of the shortest time limit is put forward. We study the sufficient condition of its optimal solution, and give the concret steps of solving this problem, demonstrate its operationability by aid of an example. This algorithm is a good algorithm of solving this problem.

Key words: transportation problem, shortest time limit, closed path, optimal solution