|
Equilibrium network flow can be formulated as Varia- tional
Inequality Problem (VIP) without symmetric assumption.
Diagonalization method is one of the approaches to slove
the equilibrium problem of the VIP model. Although the
Diagonalization method is very easy to implement, the slow
convergence of it's subproblem affects the performance of
the method drastically. In the past, there are two
strategies have been reported to improve it's computional
efficiency on the origional approach : streamlined method
and Harker's method. In this thesis, it is found that the
performance of the streamlined method is very unstable and the
use of Harker's accelerated step can't outperform the
origional approach. As a result of these facts, we present
two accelerated strategies on the former two strategies. The
computional performance of all these strategies that
mentioned above explored by numerical experiment.It is shown
that the strategies we proposed can considerably reduce the
algorithm's computional requirements. We also use these
results to illustrate something that we should notice on
the comparison basis of the computional performance for
different algorithms.
|