Computational study of state-of-the-art path-based traffic assignment algorithms
From MaRDI portal
Recommendations
- Numerical stability of path-based algorithms for traffic assignment
- A convergent and fast path equilibration algorithm for the traffic assignment problem
- Origin-Based Algorithm for the Traffic Assignment Problem
- A path-based gradient projection algorithm for the cost-based system optimum problem in networks with continuously distributed value of time
- A computational study of path-based methods for optimal traffic assignment with both inelastic and elastic demand
Cites work
Cited in
(20)- Alternative formulations of a combined trip generation, trip distribution, modal split, and trip assignment model
- Proof of global convergence of an efficient algorithm for predicting trip generation, trip distribution, modal split and traffic assignment simultaneously on large-scale networks
- Solving the combined modal split and traffic assignment problem with two types of transit impedance function
- A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
- An \(N\)-path user equilibrium for transportation networks
- A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models
- Modeling mode and route similarities in network equilibrium problem with go-green modes
- Issues in the implementation of the DSD algorithm for the traffic assignment problem
- A path-based double projection method for solving the asymmetric traffic network equilibrium problem
- A bi-objective turning restriction design problem in urban road networks
- Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size
- Numerical stability of path-based algorithms for traffic assignment
- A modified gradient projection algorithm for solving the elastic demand traffic assignment problem
- A framework for and empirical study of algorithms for traffic assignment
- Sequential path-equilibration algorithm for highly accurate traffic flow assignment in an urban road network
- Day-to-day signal retiming scheme for single-destination traffic networks based on a flow splitting approach
- A semismooth Newton method for traffic equilibrium problem with a general nonadditive route cost
- An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem
- Heterogeneous graph neural networks for real-time flow assignment prediction
- A turning restriction design problem in urban road networks
This page was built for publication: Computational study of state-of-the-art path-based traffic assignment algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1614046)
