ANALYSIS OF DYNAMIC SYSTEM OPTIMAL ASSIGNMENT WITH DEPARTURE TIME CHOICE

Most analyses on dynamic system optimal (DSO) assignment are done by using the control theory with an outflow traffic model. On the one hand, this control theoretical formulation provides some attractive mathematical properties for analysis. On the other hand, however, this kind of formulation often ignores the importance of ensuring proper flow propagation. Moreover, the outflow models have also been extensively criticized for their implausible traffic behaviour. This paper aims to provide another framework for analysing a DSO assignment problem based upon sound traffic models. The assignment problem we considered aims to minimize the total system cost in a network by seeking an optimal inflow profile within a fixed planning horizon. This paper first summarizes the requirements on a plausible traffic model and reviews three common traffic models. The necessary conditions for the optimization problem are then derived using a calculus of variations technique. Finally, a simple working example and some concluding remarks are given.