An efficient and exact event-based algorithm for solving simplified first order dynamic network loading problems in continuous time

- Simplified first order macroscopic dynamic network loading model.
- Event-based, grid free approach, yielding exact solutions to the LWR model.
- Computationally efficient on large scale generalised networks.
- Approximate solutions via optional and configurable flow rate change acceptance threshold.

In this paper a novel solution algorithm is proposed for exactly solving simplified first order dynamic network loading (DNL) problems for any generalised network. This DNL solution algorithm, termed eLTM (event-based Link Transmission Model), is based on the seminal Lighthill-Witham-Richards (LWR) model, adopts a triangular fundamental diagram and includes a generalised first order node model formulation. Unlike virtually all DNL solution algorithms, eLTM does not rely on time discretisation, but instead adopts an event based approach. The main advantage of this approach is the possibility of yielding exact results. Furthermore, an approximate version of the same algorithm is introduced. The user can configure an a-priori threshold that dictates the approximation error (measurable a-posteriori). Using this approximation the computational effort required decreases significantly, making it especially suitable for large scale applications. The computational complexity is investigated and results are demonstrated via theoretical and real world case studies. Fixed periods of stationary demands are included adopting a matrix demand profile to mimic basic departure time demand fluctuations. Finally, the information loss of the approximate solution is assessed under different configurations.