Link-Based System Optimum Dynamic Traffic Assignment Problems in General Networks

Abstract

Most current system optimum dynamic traffic assignment (SO-DTA) models do not contain first-in-first-out (FIFO) constraints and are limited to single-destination network applications. In “Link-based System Optimum Dynamic Traffic Assignment Problems in General Networks,” J. Long and W. Y. Szeto develop SO-DTA models either with or without FIFO constraints for general network applications using the concept of the link transmission model (LTM). The proposed SO-DTA problems without FIFO constraints are formulated as linear programs, and can address the vehicle holding problem by adding a penalty term to the objective function. The SO-DTA problems with FIFO constraints are formulated as nonconvex mixed-integer programs, and are solved by branch-and-bound algorithms. Two methods are developed to identify FIFO violations in feasible flow patterns and design a branching scheme for the proposed branch and bound algorithms. The authors show that the proposed LTM-based SO-DTA models are more computationally efficient than the CTM-based counterparts and maintain the same level of accuracy in terms of guaranteeing the same total system travel time in general networks.