Then it optimized the rescue supplies using form operation method based on the result of the shortest path,and selected the optimal transportation scheme.

The traditional method is a table method for solving production planning problem with transportation problems characteristics.

To avoid the disadvantage of computation complexity and observation in the process of finding the shortest-paths problem without minus loop by the Ford method,the idea of table-manipulation method is introduced and a new algorithm is presented,which is obtained by improving the efficiency of Ford method and enhancing observation for calculation.

The paper improves the traditional table-manipulation method used to solve the transportation problem with price discount,which is favorable to optimize the transportation plan based on the different transport quantity and with transport price discount.

Aiming at the transportation problem with time constrainted, a kind of optimized arithmetic based on table-working method is presented in this paper.

Two methods of the minimum expenses and maximum flux and the table dispatching method to the rotating-transporting problem with a transport amounts upper bound were given.