By Topic

Optimisation for urban congestion problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Saidane, B. ; Lab. Systemes et Transports, Univ. de Technologie de Belfort-Montbeliard, Belfort, France ; Manier, H. ; El Moudni, A.

Many models are used to describe urban traffic : cellular automata, continuous Petri nets models, Tolba et al.(2001). In this paper we give a graph modelling of an urban network, and we propose a relationship between max flow obtained by Ford Fulkerson Algorithm (1956) for single network and the global max flow for the whole network. It allows to obtain a valuation of the latter for complex models.

Published in:

Systems, Man and Cybernetics, 2002 IEEE International Conference on  (Volume:3 )

Date of Conference:

6-9 Oct. 2002