| Popis: |
This contribution is concerned with Wardrop traffic equilibria. As is well known these equilibria can be formulated as variational inequalities over a convex constraint set. Here we consider uncertain data that can be modeled as probabilistic. We survey different solution approaches to this class of problems, namely the expected value formulation, the expected residual minimization formulation, and the approach via random variational inequalities. To compare these solution approaches we provide and discuss numerical results for a 12 node network as a test example. |
