Most likely traffic equilibrium route flows analysis and computation (Q2771632)

When analyzing equilibrium traffic flows it is usually the link flows and link travel demands that are of interest, but in some cases analysis requires the knowledge of route flows. It is well known that the route flows are non-unique in the static and deterministic cases of traffic equilibrium. Furthermore, different assignment methods can generate different route flow output. It is shown how this non-uniqueness can affect the results in applications such as in the O-D estimation/adjustment problem, in the construction of induced O-D matrices, exhaust fume emission analyses and in link toll usage analyses. The authors state a model for finding, uniquely, the most likely route flows given the equilibrium link flows, and propose a solution algorithm for the problem based on partial dualization. They present computational results for the proposed algorithm and results from an application to exhaust fume emissions.NEWLINENEWLINEFor the entire collection see [Zbl 0992.49001].