Optimisation for urban congestion problems

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.