Authors 
: 

Document type 
: 
Article de périodique (Journal article) – Article de recherche

Abstract 
: 
In this paper we introduce the notions of characteristic and potential functions of directed graphs and study their properties. The main motivation for our research is the stochastic equilibrium traffic assignment problem, in which the drivers choose their routes with some probabilities. Since the number of the strategies in this game is very big, we need to find an efficient way of computation of the expected arc flows in the network. We show that the characteristic functions of the graphs are very useful in this respect. Using this technique we can form and solve numerically the equilibrium traffic assignment problem in a reasonable computational time. As a byproduct of our results we show that the spectral radius of a matrix with nonnegative elements admits a convex parametrization as a function of its entries. 
Publication date 
: 
2007 
Language 
: 
Anglais 
Journal information 
: 
"Optimization and Engineering"  Vol. 8, no. 2, p. 193214 (Juin 2007) 
Peer reviewed 
: 
yes 
Publisher 
: 
Springer New York LLC (New York, USA)

issn 
: 
13894420 
eissn 
: 
15732924 
Publication status 
: 
Publié 
Affiliations 
: 
UCL
 EUEN/CORE  Center for operations research and econometrics UCL
 FSA/INMA  Département d'ingénierie mathématique

Keywords 
: 
Stochastic transportation models ; User equilibrium ; Traffic assignment ; Convex optimization

Links 
: 
