No open-access location is known for this record yet.
No open-access location is known for this record yet.
This research deals with the dynamic traffic assignment on an over saturated network for a one-to-many origin-destination pattern under the user equilibrium principle. The purpose of this study is to obtain time dependent cumulative arrival curves at each of the nodes explicitly taking into account the effects of queues given time dependent OD volumes; that is, the departure times of users are assumed to be known. We first show that the problem can be decomposed with respect to the starting time from an origin. It is then shown that the problem forms a loop structure, which is formulated as an extension of the static assignment using two kinds of unknowns, link flows and arrival times at nodes. The solution is proved to exist, provided that the link travel time is monotone increasing in the link flow. However, a unique solution is not generally guaranteed. An algorithm to obtain the solution is finally proposed and applied to a simple network.
Loading…
Stored only when both papers are in the corpus — 54 citations exist upstream.
Papers that cite the same references — the relational fallback while embeddings are still backfilling.
Imported from OpenAlex (CC0) — nothing here is generated.