# Transportation theory (mathematics)

In mathematics and economics, **transportation theory** is a name given to the study of optimal transportation and allocation of resources.

The problem was formalized by the French mathematician Gaspard Monge in 1781.^{[1]}

In the 1920s A.N. Tolstoi was one of the first to study the transportation problem mathematically. In 1930, in the collection *Transportation Planning Volume I* for the National Commissariat of Transportation of the Soviet Union, he published a paper "Methods of Finding the Minimal Kilometrage in Cargo-transportation in space".^{[2]}^{[3]}

Major advances were made in the field during World War II by the Soviet/Russian mathematician and economist Leonid Kantorovich.^{[4]} Consequently, the problem as it is stated is sometimes known as the **Monge–Kantorovich transportation problem**.^{[5]} The linear programming formulation of the transportation problem is also known as the **Hitchcock–Koopmans transportation problem**.^{[6]}

## Motivation

### Mines and factories

Suppose that we have a collection of *n* mines mining iron ore, and a collection of *n* factories which consume the iron ore that the mines produce. Suppose for the sake of argument that these mines and factories form two disjoint subsets *M* and *F* of the Euclidean plane **R**^{2}. Suppose also that we have a *cost function* *c* : **R**^{2} × **R**^{2} → [0, ∞), so that *c*(*x*, *y*) is the cost of transporting one shipment of iron from *x* to *y*. For simplicity, we ignore the time taken to do the transporting. We also assume that each mine can supply only one factory (no splitting of shipments) and that each factory requires precisely one shipment to be in operation (factories cannot work at half- or double-capacity). Having made the above assumptions, a *transport plan* is a bijection *T* : *M* → *F*.
In other words, each mine *m* ∈ *M* supplies precisely one factory *T*(*m*) ∈ *F* and each factory is supplied by precisely one mine.
We wish to find the *optimal transport plan*, the plan *T* whose *total cost*

is the least of all possible transport plans from *M* to *F*. This motivating special case of the transportation problem is an instance of the assignment problem.
More specifically, it is equivalent to finding a minimum weight matching in a bipartite graph.

### Moving books: the importance of the cost function

The following simple example illustrates the importance of the cost function in determining the optimal transport plan. Suppose that we have *n* books of equal width on a shelf (the real line), arranged in a single contiguous block. We wish to rearrange them into another contiguous block, but shifted one book-width to the right. Two obvious candidates for the optimal transport plan present themselves:

- move all
*n*books one book-width to the right; ("many small moves") - move the left-most book
*n*book-widths to the right and leave all other books fixed. ("one big move")

If the cost function is proportional to Euclidean distance (*c*(*x*, *y*) = α|*x* − *y*|) then these two candidates are *both* optimal. If, on the other hand, we choose the strictly convex cost function proportional to the square of Euclidean distance (*c*(*x*, *y*) = α|*x* − *y*|^{2}), then the "many small moves" option becomes the unique minimizer.

Interestingly, while mathematicians prefer to work with convex cost functions, economists prefer concave ones. The intuitive justification for this is that once goods have been loaded onto, say, a freight train, transporting the goods 200 kilometers costs much less than what it would cost to transport them on a journey with 2 legs of 100 kilometers, when the extra costs of switching tracks, locomotives, and engineers are included. Concave cost functions represent this economy of scale.

## Abstract formulation of the problem

### Monge and Kantorovich formulations

The transportation problem as it is stated in modern or more technical literature looks somewhat different because of the development of Riemannian geometry and measure theory. The mines-factories example, simple as it is, is a useful reference point when thinking of the abstract case. In this setting, we allow the possibility that we may not wish to keep all mines and factories open for business, and allow mines to supply more than one factory, and factories to accept iron from more than one mine.

Let *X* and *Y* be two separable metric spaces such that any probability measure on *X* (or *Y*) is a Radon measure (i.e. they are Radon spaces). Let *c* : *X* × *Y* → [0, ∞] be a Borel-measurable function. Given probability measures μ on *X* and ν on *Y*, Monge's formulation of the optimal transportation problem is to find a transport map *T* : *X* → *Y* that realizes the infimum

where *T*(μ) denotes the push forward of μ by *T*. A map *T* that attains this infimum (*i.e.* makes it a minimum instead of an infimum) is called an "optimal transport map".

Monge's formulation of the optimal transportation problem can be ill-posed, because sometimes there is no *T* satisfying *T*_{∗}(μ) = ν: this happens, for example, when μ is a Dirac measure but ν is not).

We can improve on this by adopting Kantorovich's formulation of the optimal transportation problem, which is to find a probability measure γ on *X* × *Y* that attains the infimum

where Γ(μ, ν) denotes the collection of all probability measures on *X* × *Y* with marginals μ on *X* and ν on *Y*. It can be shown^{[7]} that a minimizer for this problem always exists when the cost function *X* is lower semi-continuous and Γ(μ, ν) is a tight collection of measures (which is guaranteed for Radon spaces *X* and *Y*). (Compare this formulation with the definition of the Wasserstein metric *W*_{1} on the space of probability measures.) A gradient descent formulation for the solution of the Monge-Kantorovich problem was given by Sigurd Angenent, Steven Haker, and Allen Tannenbaum.^{[8]}

### Duality formula

The minimum of the Kantorovich problem is equal to

where the supremum runs over all pairs of bounded and continuous functions φ : *X* → **R** and ψ : *Y* → **R** such that

## Solution of the problem

### Optimal transportation on the real line

For 1 ≤ *p* < ∞, let denote the collection of probability measures on **R** that have finite *p*th moment. Let and let *c*(*x*, *y*) = *h*(*x*−*y*), where *h* : **R** → [0, ∞) is a convex function.

- If μ has no atom, i.e., if the cumulative distribution function
*F*_{μ}:**R**→ [0, 1] of μ is a continuous function, then is an optimal transport map. It is the unique optimal transport map if*h*is strictly convex. - We have

The proof of this solution appears in.^{[9]}

### Separable Hilbert spaces

Let *X* be a separable Hilbert space. Let denote the collection of probability measures on *X* such that have finite *p*th moment; let denote those elements that are **Gaussian regular**: if *g* is any strictly positive Gaussian measure on *X* and *g*(*N*) = 0, then μ(*N*) = 0 also.

Let , , for *p* ∈ (1, ∞), *p*^{−1} + *q*^{−1} = 1. Then the Kantorovich problem has a unique solution κ, and this solution is induced by an optimal transport map: i.e., there exists a Borel map *r* ∈*L ^{p}(*X

*, μ;*X

*) such that*

Moreover, if ν has bounded support, then

for μ-almost all *x* ∈ *X* for some locally Lipschitz, *c*-concave and maximal Kantorovich potential φ. (Here ∇φ denotes the Gâteaux derivative of φ.)

## See also

Wikimedia Commons has media related to .Transportation theory |

## References

- ↑ G. Monge.
*Mémoire sur la théorie des déblais et des remblais. Histoire de l’Académie Royale des Sciences de Paris, avec les Mémoires de Mathématique et de Physique pour la même année*, pages 666–704, 1781. - ↑ Schrijver, Alexander,
*Combinatorial Optimization*, Berlin ; New York : Springer, 2003. ISBN 3540443894. Cf. p.362 - ↑ Ivor Grattan-Guinness, Ivor,
*Companion encyclopedia of the history and philosophy of the mathematical sciences*, Volume 1, JHU Press, 2003. Cf. p.831 - ↑ L. Kantorovich.
*On the translocation of masses.*C.R. (Doklady) Acad. Sci. URSS (N.S.), 37:199–201, 1942. - ↑ Cédric Villani (2003).
*Topics in Optimal Transportation*. American Mathematical Soc. p. 66. ISBN 978-0-8218-3312-4. - ↑ Singiresu S. Rao (2009).
*Engineering Optimization: Theory and Practice*(4th ed.). John Wiley & Sons. p. 221. ISBN 978-0-470-18352-6. - ↑ L. Ambrosio, N. Gigli & G. Savaré.
*Gradient Flows in Metric Spaces and in the Space of Probability Measures.*Lectures in Mathematics ETH Zürich, Birkhäuser Verlag, Basel. (2005) - ↑ S. Angenent, S. Haker, and A. Tannenbaum.
*Minimizing flows for the Monge-Kantorovich problem.*SIAM J. Math. Analysis, volume 35, pp. 61-97 (2003). - ↑ Rachev, Svetlozar T., and Ludger Rüschendorf.
*Mass Transportation Problems: Volume I: Theory*. Vol. 1. Springer, 1998.

## Further reading

- Brualdi, Richard A. (2006).
*Combinatorial matrix classes*. Encyclopedia of Mathematics and Its Applications.**108**. Cambridge: Cambridge University Press. ISBN 0-521-86565-4. Zbl 1106.05001.