{"paper":{"title":"A Fast Lax-Hopf formula to solve the Lighthill-Whitham-Richards traffic flow model on networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AP","authors_text":"Christian Claudel, Michele Simoni","submitted_at":"2018-02-15T02:52:50Z","abstract_excerpt":"Efficient and exact algorithms are important for performing fast and accurate traffic network simulations with macroscopic traffic models. In this paper, we extend the semi-analytical Lax-Hopf algorithm in order to compute link inflows and outflows with the LWR model. Our proposed Fax Lax-Hopf algorithm has a very low computational complexity. We demonstrate that some of the original algorithm's operations (associated with the initial conditions) can be discarded, leading to a faster computation of boundary demand/supplies in network simulation problems, for general concave fundamental diagram"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05391","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}