{"paper":{"title":"A fast semi-analytic algorithm for computing solutions associated with multiple moving or fixed bottlenecks: Application to joint scheduling and signal timing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AP","authors_text":"Christian G. Claudel, Michele D. Simoni","submitted_at":"2017-01-04T14:37:33Z","abstract_excerpt":"Moving and fixed bottlenecks are moving or fixed capacity restrictions that affect the propagation of traffic flow. They are a very important modeling approach to describe the effects of slow vehicles and traffic signals in transportation networks. However, the computation of solutions associated with the presence of fixed and moving bottlenecks is complex, since they both influence and are influenced by traffic. In this study, we propose a fast numerical scheme that can efficiently compute the solutions to an arbitrary number of fixed and moving bottlenecks, for a stretch of road modeled by t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01026","kind":"arxiv","version":1},"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"}