In this paper the algebraic transportation problem is introduced which covers besides the Hitchcock and the time transportation problem several other types of transportation problems of practical relevance. To solve this algebraic transportation problem admissible transformations are considered and characterized. Thereupon a transformation algorithm is described which is a generalization of the Hungarian method for the classical transportation problem as well as of a threshold method for time transportation problems.