Traffic Assignment and Gibbs-Maslov Semirings - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2003

Traffic Assignment and Gibbs-Maslov Semirings

Abstract

The Traffic Assignment problem consists in determining the routes used by sets of network users taking into account the link congestions. In deterministic modelling, Wardrop Equilibriums are computed. They can be reduced to huge non-linear multiflow problems in the simplest cases. In stochastic modelling, Logit Assignments are used. They are obtained, mainly, by substituting the minplus semiring by the «Gibbs-Maslov semirings»[ ], in the deterministic assignment computations.
Fichier principal
Vignette du fichier
RR-4809.pdf (383.96 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00071777 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00071777 , version 1

Cite

Pablo Lotito, Elina Mancinelli, Jean-Pierre Quadrat. Traffic Assignment and Gibbs-Maslov Semirings. [Research Report] RR-4809, INRIA. 2003. ⟨inria-00071777⟩
95 View
18458 Download

Share

Gmail Facebook Twitter LinkedIn More