This study presents a distributed gradient-based approach to solve system optimal dynamic traffic assignment (SODTA) formulated based on the cell transmission model. The algorithm distributes SODTA into local sub-problems, who find optimal values for their decision variables within an intersection. Each sub-problem communicates with its immediate neighbors to reach a consensus on the values of common decision variables. A sub-problem receives proposed values for common decision variables from all adjacent sub-problems and incorporates them into its own offered values by weighted averaging and enforcing a gradient step to minimize its objective function. Then, the updated values are projected onto the feasible region of the sub-problems. The algorithm finds high quality solutions in all tested scenarios with a finite number of iterations. The algorithm is tested on a case study network under different demand levels and finds solutions with at most a 5% optimality gap.
A Distributed Gradient Approach for System Optimal Dynamic Traffic Assignment
IEEE Transactions on Intelligent Transportation Systems ; 23 , 10 ; 17410-17424
2022-10-01
5093169 byte
Article (Journal)
Electronic Resource
English
Dynamic system optimal traffic assignment – a state-dependent control theoretic approach
Taylor & Francis Verlag | 2009
|A System Optimal Traffic Assignment Model with Distributed Parameters
British Library Conference Proceedings | 1996
|Combinatorial Approach for Multiple-Destination User Optimal Dynamic Traffic Assignment
British Library Conference Proceedings | 2004
|Combinatorial Approach for Multiple-Destination User Optimal Dynamic Traffic Assignment
Transportation Research Record | 2004
|