A dynamic route assignment model for guided and unguided vehicles with a massively parallel computing architecture
- 1 August 1995
- journal article
- Published by Elsevier BV in Mathematical and Computer Modelling
- Vol. 22 (4), 377-395
- https://doi.org/10.1016/0895-7177(95)00145-r
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Dynamic travel choice models for urban transportation networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer ArchitecturesTransportation Science, 1994
- A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment ModelsOperations Research, 1993
- Nonconvexity of the dynamic traffic assignment problemTransportation Research Part B: Methodological, 1992
- Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control ProblemOperations Research, 1989
- Dynamic integrated freeway/traffic signal networks: A routing-based modelling approachTransportation Research Part A: General, 1988
- Optimal Time-Varying Flows on Congested NetworksOperations Research, 1987
- A Successive Linear Optimization Approach to the Dynamic Traffic Assignment ProblemTransportation Science, 1980
- A Model and an Algorithm for the Dynamic Traffic Assignment ProblemsTransportation Science, 1978