This paper establishes the mathematical model of a goal transportation problem, and introduces some definitions and theories, such as function g(c(0), x), implementable solution, optimal solution, and the deviation of the optimal solution for the given time. A new transportation problem is posed in which all the goods are required to be transported from sources to every destination before a given time as far as possible. The problem is a goal programming problem in which one objective constraint is discrete, and is said to be goal transportation problem.