There is a transportation problem as one of typical problems of combinatorial optimization problems. We aim to obtain the semi-optimal solution which was extended to the actual transportation problem with low cost and short time using a genetic algorithm (GA). In this paper, we compared three methods. At first, transportation costs and time respectively solve single objective transportation problem for optimal solutions. Next, the transportation time changes to the transportation costs, that is, multi-objective transportation problem requested the solution as a single objective transportation problem. In the last, the Pareto solution method is used, and combined with the other two results.