Traffic assignment plays a key role for the simulation of traffic flows in road networks. Most assignment algorithms are based on actual traffic data. For the prediction of traffic flows by means of traffic simulation, however, assignment patterns which are valid over the prediction horizon are required. The algorithm presented in this paper assigns traffic flows to possible routes on the basis of dynamic travel times that are determined over the prediction horizon. It does not need any information but the network topology, traffic data, and OD-patterns. For this the algorithm uses features of a macroscopic traffic flow model for motorways. Once an initial set of turning ratios for the nodes of the network is determined, these ratios can be adopted during simulation according to the development of traffic dynamics in the simulated network. By the extension of the basic concept to sub-nets, a simulation system can be created that allows an even more precise modeling of the dynamic behavior of vehicles in road networks. For the covering abstract see ITRD E114174.
Samenvatting