Traffic plans.

Marc Bernot; Vicent Caselles; Jean-Michel Morel

Publicacions Matemàtiques (2005)

  • Volume: 49, Issue: 2, page 417-451
  • ISSN: 0214-1493

Abstract

top
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.

How to cite

top

Bernot, Marc, Caselles, Vicent, and Morel, Jean-Michel. "Traffic plans.." Publicacions Matemàtiques 49.2 (2005): 417-451. <http://eudml.org/doc/41575>.

@article{Bernot2005,
abstract = {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.},
author = {Bernot, Marc, Caselles, Vicent, Morel, Jean-Michel},
journal = {Publicacions Matemàtiques},
keywords = {Investigación operativa; Red de transporte; Optimización; optimal transportation; traffic network; Monge-Kantorovich problem; Gilbert-Steiner problem; irrigation},
language = {eng},
number = {2},
pages = {417-451},
title = {Traffic plans.},
url = {http://eudml.org/doc/41575},
volume = {49},
year = {2005},
}

TY - JOUR
AU - Bernot, Marc
AU - Caselles, Vicent
AU - Morel, Jean-Michel
TI - Traffic plans.
JO - Publicacions Matemàtiques
PY - 2005
VL - 49
IS - 2
SP - 417
EP - 451
AB - 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.
LA - eng
KW - Investigación operativa; Red de transporte; Optimización; optimal transportation; traffic network; Monge-Kantorovich problem; Gilbert-Steiner problem; irrigation
UR - http://eudml.org/doc/41575
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.