Dynamic system optimal model for multi-OD traffic networks with an advanced spatial queuing model

• Embed the path-based cell transmission model as the dynamic network loading model.
• Consider both route choice and departure time choice for general traffic networks.
• Account for user heterogeneity based on different O–D.
• Propose a method to accurately compute path marginal cost.
• Use projection algorithm to efficiently solve medium-size networks.

This paper provides an approach to solve the system optimal dynamic traffic assignment problem for networks with multiple O–D pairs. The path-based cell transmission model is embedded as the underlying dynamic network loading procedure to propagate traffic. We propose a novel method to fully capture the effect of flow perturbation on total system cost and accurately compute path marginal cost for each path. This path marginal cost pattern is used in the projection algorithm to equilibrate the departure rate pattern and solve the system optimal dynamic traffic assignment. We observe that the results from projection algorithm are more reliable than those from method of successive average algorithm (MSA). Several numerical experiments are tested to illustrate the benefits of the proposed model.