No open-access location is known for this record yet.
No open-access location is known for this record yet.
Non-recurrent congestion is a major problem in traffic networks that causes unexpected delays during travels. In such a scenario, it is preferable to use adaptive paths or policies where next link decisions on reaching junctions are continuously adapted based on the information gained with time. In this paper, we study a traffic assignment problem in stochastic time-dependent networks. The problem is modeled as a fixed-point problem and existence of the equilibrium solution is discussed. We iteratively solve the problem using the method of successive averages (MSA). A novel network loading model inspired from Link transmission model is developed that accepts policies as inputs for solving the problem. This network loading model is different from the existing network loading models that take predefined paths for input flows. We demonstrate through numerical tests that solving traffic assignment problem with the proposed loading modeling scheme is more efficient as compared to solving the problem using path-based network loading models.
Loading…
Stored only when both papers are in the corpus — 4 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.