A mathematical programming module for merge control in system optimal dynamic traffic assignment

This paper attempts to enhance the existing linear programming (LP) formulation of the system optimal dynamic traffic assignment SO-DTA problem by treating the priority ratio of a merge junction with a linear programming module equivalent to the non-linear merge component in the cell transmission model. The proposed formulation preserves the proper merge priority rule and can be readily embedded into an LP formulation of the SO-DTA problem for a single destination. It is capable of distinguishing control governed by the roadway geometry and control imposed by the system provider. The other contribution of the paper is that the model proposed also provides an alternative graphical interpretation of the merge rule described in the cell transmission model. I. BACKGROUND