Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Ngoduy, D; Hoang, NH; Vu, HL; Watling, D (2016)
Publisher: Elsevier
Languages: English
Types: Article
The Dynamic System Optimum (DSO) traffic assignment problem aims to determine a time-dependent routing pattern of travellers in a network such that the given time-dependent origin-destination demands are satisfied and the total travel time is at a minimum, assuming some model for dynamic network loading. The network kinematic wave model is now widely accepted as such a model, given its realism in reproducing phenomena such as transient queues and spillback to upstream links. An attractive solution strategy for DSO based on such a model is to reformulate as a set of side constraints apply a standard solver, and to this end two methods have been previously proposed, one based on the discretisation scheme known as the Cell Transmission Model (CTM), and the other based on the Link Transmission Model (LTM) derived from variational theory. In the present paper we aim to combine the advantages of CTM (in tracking time-dependent congestion formation within a link) with those of LTM (avoiding cell discretisation, providing a more computationally attractive with much fewer constraints). The motivation for our work is the previously-reported possibility for DSO to have multiple solutions, which differ in where queues are formed and dissipated in the network. Our aim is to find DSO solutions that optimally distribute the congestion over links inside the network which essentially eliminate avoidable queue spillbacks. In order to do so, we require more information than the LTM can offer, but wish to avoid the computational burden of CTM for DSO. We thus adopt an extension of the LTM called the Two-regime Transmission Model (TTM), which is consistent with LTM at link entries and exits but which is additionally able to accurately track the spatial and temporal formation of the congestion boundary within a link (which we later show to be a critical element, relative to LTM). We set out the theoretical background necessary for the formulation of the network-level TTM as a set of linear side constraints. Numerical experiments are used to illustrate the application of the method to determine DSO solutions avoiding spillbacks, reduce/eliminate the congestion and to show the distinctive elements of adopting TTM over LTM. Furthermore, in comparison to a fine-level CTM-based DSO method, our formulation is seen to significantly reduce the number of linear constraints while maintaining a reasonable accuracy.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • Aubin, J. P., Bayen, A. M., Saint-Pierre, P., 2008. Dirichlet problems for some hamilton-jacobi equations with inequality constraints. SIAM Journal on Control and Optimization 47, 2348-2380.
    • Aubin, J. P., Bayen, A. M., Saint-Pierre, P., 2011. Viability theory: new directions. Springer.
    • Balijepalli, N., Ngoduy, D., Watling, D., 2014. The two-regime transmission model for network loading in dynamic traffic assignment problems. Transportmetrica A: Transport Science 10 (7), 563-584.
    • Ban, X., Pang, J. S., Liu, X., Ma, R., 2012. Modeling and solution of continuous-time instantaneous dynamic user equilibria: A differential complementarity systems approach. Transportation Research Part B 46, 389-408.
    • Bar-Gera, H., 2005. Continuous and discrete trajectory models for dynamic traffic assignment. Networks and Spatial Economics 5, 41-70.
    • Beard, C., Ziliaskopoulos, A., 2006. A system optimal signal optimization formulation. Transportation Research Record 1978, 102-112.
    • Carey, M., Ge, Y. E., 2012. Comparison of methods for path flow reassignment for dynamic user equilibrium. Networks and Spatial Economics 12, 337-376.
  • No related research data.
  • No similar publications.

Share - Bookmark

Funded by projects

Cite this article