论文信息 - Deterministic model for dynamic assignment of time-varying traffic demand

Deterministic model for dynamic assignment of time-varying traffic demand

Abstract Two algorithms are presented for assigning time-varying traffic demand to a road network during peak period. The algorithms are heuristics based on the principle of deterministic equilibrium, and they are iterative. Discrete time approach is adopted for computational simplicity. The model presented is suitable for simulating traffic flow in a road network during peak period in urban areas for strategic planning of transport systems.

Attahiru Sule Alfa | A. Alfa

[1] Gordon F. Newell,et al. Applications of queueing theory , 1971 .

[2] P C Baguley,et al. CONTRAM: A TRAFFIC ASSIGNMENT MODEL FOR PREDICTING FLOWS AND QUEUES DURING PEAK PERIODS , 1978 .

[3] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[4] Richard Bellman,et al. ON A ROUTING PROBLEM , 1958 .

[5] Deepak K. Merchant,et al. A Model and an Algorithm for the Dynamic Traffic Assignment Problems , 1978 .

[6] Samuel Yagar. Dynamic traffic assignment by individual path minimization and queuing , 1971 .

[7] L G Willumsen,et al. ESTIMATING TIME-DEPENDENT TRIP MATRICES FROM TRAFFIC COUNTS , 1984 .

[8] K. Cooke,et al. The shortest route through a network with time-dependent internodal transit times , 1966 .

[9] J. G. Wardrop,et al. Some Theoretical Aspects of Road Traffic Research , 1952 .

[10] Adolf D. May,et al. A deterministic queueing model , 1967 .