| dc.description.abstract | The dynamic signal timings control (DSTC) model is an application
of bilevel programming model, including the upper level, dynamic signal
timings optimal model, and the lower level, dynamic user equilibrium
route choice model. The DSTC model may be described as a Stackelberg
game, among the upper level tries to minimum the total travel cost by
allocating the green times and determining link capacities. The lower
level, based on the fixed link capacities , searches the shortest travel time
route for use, which can be mathematically represented by the dynamic
user-optimal conditions.
In this research, we consider several heuristic algorithms for the
DSTC model which is constructed by Chou (1999). In the iterative
processes of algorithms, the minimum distance approach is used to obtain
the sensitivity analysis information for the dynamic user equilibrium
route choice model. Besides we verify the difference between the
minimum distance and generalized inverse approach for the equilibrium
network flow. Through the derivative information, we analyze four
heuristics sensitivity analysis based algorithms, including : SDAP, SDAA,
GEDO, and LAA. Numerical examples are implemented. According to
the result, the SDAA is better than other methods. | en_US |