Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
This paper shows that a macroscopic fundamental diagram (MFD) relating average flow and average density must exist on any street with blocks of diverse widths and lengths, but no turns, even if all or some of the intersections are controlled by arbitrarily timed traffic signals. The timing patterns are assumed to be fixed in time. Exact analytical expressions in terms of a shortest path recipe are given, both, for the street's capacity and its MFD. Approximate formulas that require little data are also given. For networks, the paper derives an upper bound for average flow conditional on average density, and then suggests conditions under which the bound should be tight: i.e., under which the bound is an approximate MFD. The MFD's produced with this method for the central business districts of San Francisco (California) and Yokohama (Japan) are compared with those obtained experimentally in earlier publications.
Alexandre Massoud Alahi, Saeed Saadatnejad, Yang Gao, Kaouther Messaoud Ben Amor