In recent research in the optimization of transportation networks, the problem was formalized as finding the optimal paths to transport a measure y+ onto a measure y- with the same mass. This approach is realistic for simple good distribution networks (water, electric power,. ..) but it is no more realistic when we want to specify who goes where, like in the mailing problem or the optimal urban traffic network problem. In this paper, we present a new framework generalizing the former approathes and permitting to solve the optimal transport problem under the who goes where constraint. This constraint is formalized as a transference plan from y+ to y- which we handle as a boundary condition for the optimal traffic problem.
@article{urn:eudml:doc:41575,
title = {Traffic plans.},
journal = {Publicacions Matem\`atiques},
volume = {49},
year = {2005},
pages = {417-451},
zbl = {1086.49029},
language = {en},
url = {http://dml.mathdoc.fr/item/urn:eudml:doc:41575}
}
Bernot, Marc; Caselles, Vicent; Morel, Jean-Michel. Traffic plans.. Publicacions Matemàtiques, Tome 49 (2005) pp. 417-451. http://gdmltest.u-ga.fr/item/urn:eudml:doc:41575/