TL;DR
This paper introduces a novel end-to-end differentiable network traffic simulation model using automatic differentiation, enabling efficient gradient-based optimization for large-scale traffic management problems.
Contribution
The study presents a new differentiable traffic flow simulator based on AD, LTM, and DUO, capable of handling complex models without manual derivation of gradients.
Findings
Successfully optimized a congestion toll on a large-scale dataset
Derived high-quality solutions within 40 minutes using the proposed model
Released the simulator as open-source software in Python and JAX
Abstract
Optimization using network traffic models requires computing gradients of objective functions with respect to model parameters. However, derivation of such gradients has often been considered difficult or impractical due to their complexity and size. Conventional approaches rely on numerical differentiation or derivative-free methods that do not scale well with the parameter dimension, or on adjoint methods that require manual derivation for each specific model. This study proposes a novel end-to-end differentiable network traffic flow simulator based on automatic differentiation (AD), employing the Link Transmission Model (LTM) and a Dynamic User Optimum (DUO) route choice model. The LTM operates on continuous aggregate state variables through piecewise-linear min/max operations, which admit subgradients almost everywhere and thus require no smooth relaxation for AD. The DUO is also…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
