This paper presents an effecient algorithm for solving the dynamic user equilibrium (DUE) traffic assignment with a one-to-many origin-destination (OD) pattern. To achieve the efficiency of the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback