A computer-aided algorithm based on table-manipulation principle was proposed to solve transportation problem. In the algorithm, the minimum element method was used to get an initial feasible solution, the potential method was adopted to get the array of check numbers, the recursive process was applied to get the closed loop array, the adjusted quantum was got according to the closed loop array and feasible solution, a new feasible solution was got after the feasible solution was adjusted according to the closed loop array and adjusted quantum, the While loop was used to get the optimal solution until the minimum check number is not less than 0. After the While loop was exited, if there were one or more 0 check numbers in the array of check numbers, one 0 check number was selected randomly to get a random optimal solution through above process. Case study showed that the proposed computer algorithm not only could make the table-manipulation process automatically to increase computation efficiency and ensure computation accuracy, but also could get one or more optimal solutions.