|Title:||An efficient event‐based algorithm for solving first order dynamic network loading problems|
|Authors:||Raadsen, Mark P.H.|
Bliemer, Michiel C.J.
Bell, Michael G.H.
|Keywords:||Dynamic network loading, first order, generalised link transmission model, event-based, fast approximate solution|
|Abstract:||In this paper we will present a novel solution algorithm for the Generalised Link Transmission Model (G-LTM). It will utilise a truly event based approach supporting the generation of exact results, unlike its time discretised counterparts. Furthermore, it can also be configured to yield approximate results, when this approach is adopted its computational complexity decreases dramatically. It will be demonstrated on a theoretical as well as a real world network that when utilising fixed periods of stationary demands to mimic departure time demand fluctuations, this novel approach can be efficient while maintaining a high level of result accuracy. The link model is complemented by a generic node model formulation yielding a proper generic first order DNL solution algorithm.|
|Type of Work:||Working Paper|
|Appears in Collections:||ITLS Working Papers 2014|
|ITLS-WP-14-10.pdf||1.42 MB||Adobe PDF|
Items in Sydney eScholarship Repository are protected by copyright, with all rights reserved, unless otherwise indicated.