Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Non-convergence in dynamic assignment networks?
In the steady-state assignment model where each link has a non-decreasing cost flow curve we have monotonicity not just at the link level but also at the route level. In our dynamical system we assume that the users swap to cheaper routes. Monotonicity of the route cost function is enough to guarantee that the given function V is in fact a Lyapunov function and hence that the system converges to equilibrium. In the dynamic assignment model, the route cost function is not a monotone function of route flow, as was shown previously by the author (2001). Therefore, convergence does not immediately follow, as it does in the steady-state case. This paper essentially shows that the dynamic counterpart of the steady-state Lyapunov function is in fact not a Lyapunov function. This does not at all imply non-convergence of the dynamical system simulating a swap to cheaper routes, but it does raise the question of convergence. Obviously, if another function could be found that satisfies the criteria of being a Lyapunov function this would be sufficient for convergence.
Non-convergence in dynamic assignment networks?
In the steady-state assignment model where each link has a non-decreasing cost flow curve we have monotonicity not just at the link level but also at the route level. In our dynamical system we assume that the users swap to cheaper routes. Monotonicity of the route cost function is enough to guarantee that the given function V is in fact a Lyapunov function and hence that the system converges to equilibrium. In the dynamic assignment model, the route cost function is not a monotone function of route flow, as was shown previously by the author (2001). Therefore, convergence does not immediately follow, as it does in the steady-state case. This paper essentially shows that the dynamic counterpart of the steady-state Lyapunov function is in fact not a Lyapunov function. This does not at all imply non-convergence of the dynamical system simulating a swap to cheaper routes, but it does raise the question of convergence. Obviously, if another function could be found that satisfies the criteria of being a Lyapunov function this would be sufficient for convergence.
Non-convergence in dynamic assignment networks?
Mounce, R. (Autor:in)
01.01.2001
250279 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Non-Convergence in Dynamic Assignment Networks?
| British Library Conference Proceedings | 2001
Changing Assignment Algorithms: Price of Better Convergence
| British Library Online Contents | 2010
Dynamic User Equilibrium Assignment on Oversaturated Road Networks
| British Library Online Contents | 1994
Dynamic Trip Assignment-Simulation Model for Intermodal Transportation Networks
| British Library Online Contents | 2001
Dynamic Assignment-Simulation Methodology for Multimodal Urban Transit Networks
| British Library Online Contents | 2015