Combinatorial Approach for Multiple-Destination User Optimal Dynamic Traffic Assignment
- 1 January 2004
- journal article
- research article
- Published by SAGE Publications in Transportation Research Record: Journal of the Transportation Research Board
- Vol. 1882 (1), 70-78
- https://doi.org/10.3141/1882-09
Abstract
An algorithm that can be used to solve the user optimal dynamic traffic assignment problem for multiple destinations is proposed. The algorithm uses the cell transmission model, which can account for traffic realities, such as dynamic queuing and spillover. The approach selects a destination for equilibration, fixes the paths of the vehicles assigned to the other destinations, and finds an optimal dynamic traffic assignment for the destination of interest via an extension to a previously introduced combinatorial algorithm. The spatial path set obtained for this destination is then fixed, and another destination is relaxed. The process is repeated iteratively among the destinations. The approach is guaranteed to find the user optimal solution for a single destination given any number of other fixed-path vehicles, but the approach is a heuristic for finding the multiple-destination user optimal path set. The algorithm is implemented and computationally tested for an example network, and solution properties are explored.Keywords
This publication has 11 references indexed in Scilit:
- An Internet-based geographic information system that integrates data, models and users for transportation applicationsTransportation Research Part C: Emerging Technologies, 2000
- A Discrete Time, Nested Cost Operator Approach to the Dynamic Network User Equilibrium ProblemTransportation Science, 1995
- The cell transmission model: A dynamic representation of highway traffic consistent with the hydrodynamic theoryTransportation Research Part B: Methodological, 1994
- A new dynamic traffic model and the existence and calculation of dynamic user equilibria on congested capacity-constrained road networksTransportation Research Part B: Methodological, 1993
- A Variational Inequality Formulation of the Dynamic Network User Equilibrium ProblemOperations Research, 1993
- Nonconvexity of the dynamic traffic assignment problemTransportation Research Part B: Methodological, 1992
- Dynamic traffic assignment for urban road networksTransportation Research Part B: Methodological, 1991
- Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control ProblemOperations Research, 1989
- Optimal Time-Varying Flows on Congested NetworksOperations Research, 1987
- A Model and an Algorithm for the Dynamic Traffic Assignment ProblemsTransportation Science, 1978