In the paper a subgradient-optimization-method for solving a class of three -stage transportation problems with change of the sets to be transported in each stage is given. The algorithm can simply be generalized for solvingn-stage problems. Advantages of the algorithm are: a low expense per interaction, a good numerical behaviour and a fast obtaining of a suboptimal solution. The assertions are illustrated by numerical examples.