Traffic flow can be modelled at different levels, of which the vehicle level and the link level are mostly used. Recently, traffic relationships at a higher, network level are found, and a dynamic traffic flow model has been introduced. This paper tests such a model, the Network Transmission Model (NTM), for the city of The Hague. In this model, for each zone (i.e., parts of a network, neighbourhoods in this case) the number of vehicles in the network as well as the outflow is determined in each time step. The basic information from the city planners and the network is taken (OD, road lengths and capacities), and used as input to the NTM. Afterwards, the model parameters are adapted with input from practitioners of municipality. The parameters in the model had an understandable effect on the traffic congestion patters. After adaptation, the model predicted a traffic patterns in line with the expectations of experts of the The Hague municipality. Generally the model predicts the congestion in the right zones and the propagation is predicted correctly. Moreover, the parameters have an interpretation so tuning is done. Finally, the model is quick enough to serve as on-line support for traffic management decisions. As face validation two different cases (adapted OD matrix and a modelled incident) were assessed with the model without adapting model parameters. The predicted traffic patterns were assessed as reasonable. The test also revealed further improvements in including traffic waiting for parking spaces and the inabilities to include turning restrictions. @en

The Macroscopic Fundamental Diagram (MFD) describes the relation between accumulation and speed in a zone. While theoretically expected, empirical validations have been done with limited numbers of floating car (e.g., taxi) data, and loop detectors. This paper will verify existence, shape and crispness of the MFD using Floating Car Data (FCD) from Google. Due to the large amount of users (i.e., high penetration rate), this unique data-set contains traffic information with a high spatial resolution, a high spatial scope and high reliability. We use the data for 3 purposes. First, an MFD for the city of Amsterdam is constructed, revealing a strong relationship between the average density and the average flow. It also shows that the urban road network never reaches its capacity. Secondly, inhomogeneity is analysed. Traffic is well spread over the network, hence inhomogeneity is low. Moreover, if present, the inhomogeneity has only a minor effect on the flow. Also traffic in different directions is homogeneous. Thirdly, for the first time, an MFD is created for a whole country, which turned out to be very crisp as well. This suggests that small areas or a directional split are not needed to create crisp MFDs. That, in turn, implies that a crisp MFD is not a sufficient condition to apply control without considering internal dynamics. @en

In this paper, we investigate the day-to-day regularity of urban congestion patterns. We first partition link speed data every 10 min into 3D clusters that propose a parsimonious sketch of the congestion pulse. We then gather days with similar patterns and use consensus clustering methods to produce a unique global pattern that fits multiple days, uncovering the day-to-day regularity. We show that the network of Amsterdam over 35 days can be synthesized into only 4 consensual 3D speed maps with 9 clusters. This paves the way for a cutting-edge systematic method for travel time predictions in cities. By matching the current observation to historical consensual 3D speed maps, we design an efficient real-time method that successfully predicts 84% trips travel times with an error margin below 25%. The new concept of consensual 3D speed maps allows us to extract the essence out of large amounts of link speed observations and as a result reveals a global and previously mostly hidden picture of traffic dynamics at the whole city scale, which may be more regular and predictable than expected.@en

Today, the deployment of sensing technology permits the collection of massive amounts of spatiotemporal data in urban areas. These data can provide comprehensive traffic state conditions for an urban network and for a particular day. However, data are often too numerous and too detailed to be of direct use, particularly for applications such as delivery tour planning, trip advisors, and dynamic route guidance. A rough estimate of travel times and their variability may be sufficient if the information is available at the full city scale. The concept of the spatiotemporal speed cluster map is a promising avenue for these applications. However, the data preparation for creating these maps is challenging and rarely discussed. In this study, that challenge is addressed by introducing generic methodologies for mapping the data to a geographic information system network, coarsening the network to reduce the network complexity at the city scale, and estimating the speed from the travel time data, including missing data. This methodology is demonstrated on the large-scale urban network of Amsterdam, Netherlands, with real travel time data. The preprocessed data are used to build the spatiotemporal speed cluster by using three partitioning techniques: normalized cut, density-based spatial clustering of applications with noise, and growing neural gas (GNG). A new posttreatment methodology is introduced for density-based spatial clustering and GNG, which are based on data point clustering, to generate connected zones. A preliminary cross comparison of the clustering techniques shows that GNG performs best in generating zones with minimum internal variance, the normalized cut computes three-dimensional zones with the best intercluster dissimilarity, and GNG has the fastest computation time.@en