# Multisource Data Framework for Road Traffic State Estimation

Authors: Josep Maria Salanova Grau; Evangelos Mitsakis; Panagiotis Tzenos; Iraklis Stamos; Luigi Selmi; Georgia Aifadopoulou
Journal: Journal of Advanced Transportation
 (2018)

---

## Abstract

This paper presents a framework for data collection, filtering, and fusion, together with a set of operational tools to validate, analyze, utilize, and highlight the added value of probe data. Data is collected by both conventional (loops, radars, and cameras) and innovative (Floating Car Data, detectors of Bluetooth devices) technologies and refers to travel times and traffic flows on road networks. The city of Thessaloniki, Greece, serves as a case study for the implementation of the proposed framework. The methodology includes the estimation of traffic flow based on measured travel time along predefined routes and short-term forecasting of traffic volumes and their spatial expansion in the road network. The proposed processes and the framework itself have the potential of being implemented in urban road networks.


---

## Body

## 1. Introduction

Emerging technological advances have lately revealed new transport and mobility data collection means, enabling cost-efficient ways of both pullulating the actual amount of collected data as well as enriching their quality (in terms of type, format, and content). The broader society’s new eye on privacy and sharing of personal information is also with doubt to be attributed with contributing to the latter, as people increasingly need to be “connected”. To this end, the travellers (as both drivers and passengers) have shifted from sole information receivers (for meeting their own needs) to active information transmitters, becoming thus key players of the data collection and sharing process. Similar to advances and developments in the way to deal with large quantities of data in other fields, new data sources in the transport domain necessitate the development of innovative methodologies and processes for their utilization.The challenge nowadays is not merely about the collection of this data itself; it is rather about processing and managing the potential that is inherent in big data. There is therefore a need for developing tools that can filter, fuse, and process data from various sources at real time, in order to provide reliable Advanced Traveller Information Services.The aim of this paper is to aid research in this direction, by explicitly laying out current practice regarding the collection, filtering, fusion, analysis, and utilization of big data, with the city of Thessaloniki serving as a case study. The remaining of the paper is structured as follows; in Section2 big data sources for the transportation and mobility sector are presented and discussed, while Section 3 illustrates the big data collection and processing framework for the city of Thessaloniki. The paper concludes with Section 4, where recommendations for future research directions are presented.


## 2. Review on Transport and Mobility Data Sources

### 2.1. Conventional Traffic Data

Conventional data sources mostly aim at collecting aggregated data through a large variety of intrusive (data recording sensors placed on or in the road) and nonintrusive sensors (remote observations), such as pneumatic tubes, infrared and acoustic devices, inductive loops, radars, or cameras, mainly measuring traffic flow, speed, and occupancy of the road infrastructure. Reference [1] presents the limitations of conventional traffic sensors, concluding that the main limitations are related to installation and calibration costs, low coverage, and low performance under adverse weather conditions, while [2] presents their lifetime duration and costs, concluding that intrusive sensors have an average lifetime of 5 years and low maintenance costs, while nonintrusive sensors have double lifetime and high purchase and installation costs.


### 2.2. Probe Data

Probe data refers to data being collected directly from individual travellers or vehicles, which are usually aggregated during the processing phase. This allows for increased capabilities of data processing but at the same time requires larger processing capabilities and computing resources. Probe data can be classified into stationary and floating.Stationary probe data is collected at fixed locations within a transport network by tracking unique characteristics of individuals or vehicles, such as MAC (Media Access Control) identities of Bluetooth devices, or through Automatic Plate Number Recognition (APNR) systems. These detectors are often associated with high costs, calibration needs, low performance under high traffic flow conditions, or adverse weather conditions and/or low market penetration rate.On the contrary, floating probe data is collected along the trajectories of moving objects (individual travellers or vehicles) equipped with a smart device able to track its own trajectory through GPS or A-GPS (assisted GPS). They are associated with accuracy considerations (related to the devices’ exact GPS location), which are often relaxed by map-matching the position to a representation of the road network and to the frequency of the data collection.A few examples of the use of mobile data for understanding activity chains and trajectories are presented in [3, 4] while Bluetooth and Floating Car Data are used for the same purpose in [5, 6], respectively.


### 2.3. Data from Social Media

Social media is a new data source with high potential, due to its relation with the daily lives of individuals, but at the same time it is the most difficult to process due to its unstructured format (free text) and its lack of geo-reference (tweets) or low granularity (Facebook check-in events). The major drawback associated with social media data collection is the biased sample used for processing, since the content generators are not representative of the whole population or activities, especially for dedicated services such as the check-in service of Facebook.


## 2.1. Conventional Traffic Data

Conventional data sources mostly aim at collecting aggregated data through a large variety of intrusive (data recording sensors placed on or in the road) and nonintrusive sensors (remote observations), such as pneumatic tubes, infrared and acoustic devices, inductive loops, radars, or cameras, mainly measuring traffic flow, speed, and occupancy of the road infrastructure. Reference [1] presents the limitations of conventional traffic sensors, concluding that the main limitations are related to installation and calibration costs, low coverage, and low performance under adverse weather conditions, while [2] presents their lifetime duration and costs, concluding that intrusive sensors have an average lifetime of 5 years and low maintenance costs, while nonintrusive sensors have double lifetime and high purchase and installation costs.


## 2.2. Probe Data

Probe data refers to data being collected directly from individual travellers or vehicles, which are usually aggregated during the processing phase. This allows for increased capabilities of data processing but at the same time requires larger processing capabilities and computing resources. Probe data can be classified into stationary and floating.Stationary probe data is collected at fixed locations within a transport network by tracking unique characteristics of individuals or vehicles, such as MAC (Media Access Control) identities of Bluetooth devices, or through Automatic Plate Number Recognition (APNR) systems. These detectors are often associated with high costs, calibration needs, low performance under high traffic flow conditions, or adverse weather conditions and/or low market penetration rate.On the contrary, floating probe data is collected along the trajectories of moving objects (individual travellers or vehicles) equipped with a smart device able to track its own trajectory through GPS or A-GPS (assisted GPS). They are associated with accuracy considerations (related to the devices’ exact GPS location), which are often relaxed by map-matching the position to a representation of the road network and to the frequency of the data collection.A few examples of the use of mobile data for understanding activity chains and trajectories are presented in [3, 4] while Bluetooth and Floating Car Data are used for the same purpose in [5, 6], respectively.


## 2.3. Data from Social Media

Social media is a new data source with high potential, due to its relation with the daily lives of individuals, but at the same time it is the most difficult to process due to its unstructured format (free text) and its lack of geo-reference (tweets) or low granularity (Facebook check-in events). The major drawback associated with social media data collection is the biased sample used for processing, since the content generators are not representative of the whole population or activities, especially for dedicated services such as the check-in service of Facebook.


## 3. Methodology

### 3.1. Thessaloniki’s Large-Scale Mobility Model

The urban mobility model for Thessaloniki includes 47807 intersections (with detailed information about the geometry and control type) and 137854 directed road segments (with length, number of lanes, free flow speed, capacity, direction, allowed transportation modes, existence of dedicated lanes, and parking regulation). Links are classified into 6 categories, depending on their capacity (which has been proportionaly reduced, based on the use of bus lanes and/or parking spaces) and free flow speed. Each road category has a unique Volume-Delay Function (VDF), based on the BPR (Bureau of Public Roads [7]).The network consists of 359 traffic analysis zones (306 describing the metropolitan area of Thessaloniki and the rest representing external zones) and 3508 connectors. The demand side consists of 24 hourly Origin-Destination matrices for private vehicle trips, estimated using household and road side surveys ([8, 9]).


### 3.2. Collection of Big Transport and Mobility Data

Thessaloniki is the largest city of Northern Greece and the second in the whole Greece, with a total of more than 1 million citizens in its greater area, which covers 1500 km2. It has an average density of 665 inhabitants per km2 and the total number of vehicles exceeds 777000, including private cars, heavy vehicles, and motorcycles [8]. Conventional sensors (loops, radars, and cameras), probe data (stationary and floating), and social networks derived content are utilized in the city for processing mobility-related indicators, as well as for providing Advanced Traveller Information Services (real-time travel time and vehicle speed estimation).


#### 3.2.1. Conventional Traffic Data Sources

There are three sets of conventional mobility data sensors in Thessaloniki (Figure1):(i)
The surveillance system of the Peripheral Ring Road consisting of 9 cameras (CAM in Figure1) monitoring 100000 vehicles per day (as of 2011) in both directions.(ii)
The Thessaloniki’s Urban Mobility Management System, consisting of 12 cameras and 7 radars (CAR in Figure1), installed at the city’s busiest arterial, monitoring 50000 vehicles per day (as of 2012) in one direction.(iii)
The traffic lights management system, consisting of 503 Inductive Loop Detectors (ILD in Figure1) installed at traffic light controlled intersections in the city, monitoring 250000 vehicles per day.Figure 1
Mobility sensors in the city of Thessaloniki.


#### 3.2.2. Stationary Probe Data

The Bluetooth (BT) detectors network is comprised of 43 roadside devices, installed at selected major intersections [10] throughout the road network of the city, as shown in Figure 2.Figure 2
BT detectors network in the city of Thessaloniki.More than 100000 BT-equipped devices are detected every day, generating on average a total of 300000 detections at the 43 locations.


#### 3.2.3. Floating Probe Data

The floating probe data are derived from a 1200 taxi vehicles’ fleet, circulating 14 hours on average per day and generating pulses every 6 seconds, which contain their location and instantaneous speed. The data collected and processed reaches on average 2500 pulses per minute, with daily totals at approximately 1.5 million.


### 3.3. Processing of Big Data

Figure3 depicts the framework for real-time data processes and services for the city of Thessaloniki. It is composed of the data collection from the real world as well as the offline and real-time processes, which culminates in the provision of real-time mobility services.Figure 3
Framework for real-time data processes and services in Thessaloniki.The data collected by the above-mentioned sensors and systems require filtering and processing, in order to accurately estimate mobility indicators and provide Advanced Traveller Information Services in real time. This requests a trade-off between the quality of the analyses (time consuming) and the real-time provision of the services. The main traffic and mobility indicators estimated for the city of Thessaloniki are travel times along the main routes of the city, traffic flows in the prioritized road network, and traffic congestion levels.The individual components that have been developed and are presented in this paper are the following:(i)
Traffic flow estimation based on stationary probe data(ii)
Travel time estimation based on stationary probe data(iii)
Traffic flow estimation based on travel time(iv)
Short-term traffic flow prediction(v)
Spatial expansion of traffic flow(vi)
Real-time traffic conditions estimation


#### 3.3.1. Traffic Flow Estimation from Stationary Probe Data

Figure4 depicts unfiltered traffic flow measurements (dashed line) and BT detections (straight line) in one of the busiest (in terms of traffic flow) intersections of the city for a 7-day period. It can be observed that the detections fit well with the traffic flow modifications, with a small deviation for large values of traffic flow, which may be improved by filtering properly the data. Details of this analysis can be found in [11].Figure 4
Detected BT devices and measured traffic flow versus time of day.Traffic flow is extrapolated directly from aggregated detections of devices equipped with BT. The reliability and accuracy of this methodology largely depend on the penetration of the Bluetooth technologies to travellers and vehicles. Statistical and comparative analyses conducted for the case of Thessaloniki reveal an R2 deviation between traffic flow measurements and BT detections equal to 0.91, reflecting the methodology’s potential.Figure5 presents the relation between detected BT devices and measured traffic flow at a single intersection. As observed, there is a strong correlation between the two with an R2 relation equal to 0.89 (prior to data filtering). In addition, 37% of the traffic flow is detected by BT detectors. It can be observed that the relation is different in low and in high values of traffic flow volume, which is also observed in Figure 4.Figure 5
Relation between detected BT devices and measured traffic flow without filtering the detections at a single intersection.After filtering the BT detections and removing double entries (related to nonmoving objects) during predefined time intervals, the corrected correlation between detected and measured vehicles is approximately 20%. Table1 summarizes the impact of using different time intervals for filtering the data (time duration during which detected objects are classified as nonmoving) for the same intersection used for obtaining Figures 4 and 5 during a single day. The best fit is obtained with the 15-minute filter.Table 1
Relation between detection and traffic flow for different filters.
Time interval used for data filtering Without filtering 5min filter 15min filter 60min filter Correlation coefficient 0.3682 0.2179 0.1972 0.0442  R2 0.8947 0.9193 0.9337 0.8594  Largest differences(absolute value and percentage ranges) -401 / 623 vehicles-26% / 75% -410 / 437 vehicles-23% / 61% -336 / 389 vehicles-22% / 57% -536 / 767 vehicles-35% / 79%


#### 3.3.2. Travel Time Estimation

Floating probe data is used in a similar way for estimating travel times [12] and traffic states ([13–21]). Two consecutive pulses from moving objects generate 100-meter long trajectories, which are matched with virtual locations within the network, in order to generate “detections” and match them for estimating travel times. Only a part of the filters applied to the stationary probe data is applied, since the sample is “controlled” (all the data is related to vehicles).Alternatively, individual travel times are estimated by matching the detected MAC address identities at various locations of the road network and comparing the timestamps, in order to obtain individual travel times, which are aggregated and filtered to obtain average travel times. The aggregation of the individual travel times allows filtering them, eliminating outliers and noise, such as en-route stops, trip ends between detectors, detours deviating from the predefined paths, or records from other transportation modes, such as pedestrians, bicycles, and users of the public transport system as well as atypical vehicles such as couriers or delivery vehicles. The methodological flowchart can be found in [22].


#### 3.3.3. Traffic Flow Estimation Based on Travel Time

The estimated travel times along various routes are converted to link travel times and to link traffic flows, according to the process depicted in Figure6.Figure 6
Traffic flow estimation procedure from path travel times.As observed, the measurements of route travel times (based on probe data) and individual link travel times (from conventional sensors/detectors) are used for the correction of the link travel times which belong to those routes. The link traffic flow measurements (based on both probe data and conventional sensors/detectors) are also used for the estimation of the link travel times. Finally, the link travel times are converted to link traffic flows (with the use of volume-delay functions) providing a unique relation between traffic volume and speed on a specific link for determining the spatial evolution of traffic flows and merged with the links having traffic flow measurements (stand-alone links).The conversion from route travel time to link travel time for the links which constitute the route is conducted using the following mathematical minimization problem:(1)minδ1∑Ax-b+δ2∑x-v0v0S. t.xi≥t0i,∀i∈Ixj=tj,∀j∈Jwhereδ1andδ2 are weights for the minimization problem (0.6 and 0.4, respectively),Α is the link-path incidence matrix (αij is 1 if the link j is part of path i),x is the link travel times vector (xi is the travel time of link i),b is the paths travel times vector (bj is the travel time of path j),v0 is the initial link travel times vector derived from the traffic assignment model (v0i is the initial travel time of link i as in the traffic assignment model),t0i is the free flow travel times of link i,tj is the observed travel times of link j (if measurements of traffic flow exist, the conversion takes place based on the VDF),I is the set of all links which constitute the paths,J is the subset of I of the links for which observations exist.The objective function consists of two parts: the first part contains the estimation of the difference between the path travel time and the sum of the link travel times which define the path. In the second part, the percentile difference is estimated between the link travel times derived from the traffic assignment model and the estimated travel time, in order to avoid burdening links with very small travel times, which would excessively increase the traffic flow.The first constraint ensures that the minimum link travel time cannot be smaller than the free flow link travel time. The second constraint ensures that the link travel time used for links for which travel times are measured is equal to the measured travel time.


#### 3.3.4. Short-Term Traffic Flow Prediction

Various studies have been developed for forecasting traffic state, flow, and patterns ([23–29]) but most of them are applied to freeways.For the short-term traffic flow prediction used in this framework, a linear autoregressive (AR of degree up to 3, depending on the time series created at each location) model is used. The degree of each model depends on the time series of the previous time periods and is formulated as follows:(2)φki+1=φ-k+∑j=1Nβkj∗φki+1-j-φ-kwhereφki is the traffic flow of link k for time period i,φ-k is the average traffic flow of link k for the time period of the last two days,βj is the serial correlation coefficient j of link k,N is the degree of the autoregressive model.


#### 3.3.5. Spatial Expansion of Traffic Flows

Various data fusion techniques have been developed for fusing multisource traffic data ([30, 31]). In the proposed framework, the spatial expansion of traffic flows is based on the Data Expansion Algorithm (DEA) ([32]). The implementation for Thessaloniki’s road network differs in that the link traffic flows are used as a constraint and the optimization regards the minimization of the differences of the distributions of vehicles on intersections (the original DEA does it in the opposite way). The mathematical formulation is presented below:(3)minD-p.∗Cn∗x-p.∗Cc∗cs.t.xi>lbi∀i∈Ixι<ubi∀i∈Ixj=fj∀j∈JwhereD is diagonal unitary matrix (with dimensions equal to the total number of links),p is the vector of the percentages of traffic flows on intersection (junction) level which is distributed at every link (pij is the percentage of traffic at intersection i derived to link j),Cn is the adjacency table at link level (Cnij is 1 if the link j precedes link i),x is the vector of traffic flows (xi is the traffic flow at link i),Cc is the incidence matrix (Ccij is 1 if the connector i ends or starts at intersection j),c is the vector of traffic flows found at the connectors (ci is the traffic flow at connector i),lb is vector of the minimum traffic flow values (lbi is the minimum traffic flow at link i),ub is the vector with the maximum traffic flow values (ubi is the maximum traffic flow at link i),f is the vector with the measured traffic flows (fi is the measured traffic flow at link i),I is the set of all links,J is the subset of I for which traffic flow measurements exist.The objective function consists of two parts: in the first part the adjacency matrix is estimated at link level. In the adjacency matrix, all the percentages of traffic flows from every link to all other links are included. In the second part, the traffic flow of the connector links is estimated.The first and second constraints ensure the minimum and maximum traffic flow for each link, while the third constraint ensures that the flow on links for which measurements exist is the measured flow.


#### 3.3.6. Real-Time Traffic Conditions Estimation

Based on the data and processes described above, traffic congestion is estimated at real time and forecasted in a short-term basis. Both travel time measured at selected routes using BT detectors and floating probe data are converted into traffic flow by using volume-delay functions. All measurements and estimations are forecasted by an autoregressive model for 15, 30, 45, and 60 minutes and the process is repeated, in order to obtain traffic flows for the forecasted scenarios. Finally, all traffic flows are merged into a nonlinear mathematical program by means of a modified DEA, resulting in link flows, travel times, and average speed values for the entire network (with the use of link-based volume-delay functions).


### 3.4. High Performance Computing in Thessaloniki

Transport and mobility data sets coming from multiple innovative and conventional data sources like those described in Section2 consist of both structured and unstructured data that usually are relatively large and also are being produced at very high rates. On the other hand, the corresponding monitoring and processing applications typically utilize complex algorithms that require the acquisition, transformation, combination, and processing of those data sets in almost real time in an efficient way. As the technology evolves, these requirements lead to a need of constant improvement of the software infrastructure, procedures, and data pipelines used by the applications.In this context, it becomes clearer that mature and cutting-edge technologies can be used together, in order for those data sets and streams to be handled efficiently. In the current architecture, a set of applications filters and transforms the raw data coming from different data sources and the result is stored in a relational database management systems and exposed via unified, compatible, and secure APIs. As many new open source software frameworks are made available to process big datasets, in batches or streams, and store the result in distributed storage systems, the architecture is being evolved towards a microservice architecture. The aim of the evolution is on one side to address the scalability and availability issues of the overall architecture and on the other side to implement the most recent software engineering best practices for the development and deployment of software components leveraging containerization technologies such as Docker. Evolving a software architecture involves both the technologies and the people who use them. As it is common in different research and production environments, new software tools and technologies must be integrated with some of the existing components and software packages.A new architecture for the ingestion, processing, and storage of the traffic data is being developed within the Big Data Europe project. The project aims at developing a platform where big data frameworks can be easily integrated to build distributed data processing pipelines. The platform usage will be demonstrated in all the seven societal challenges that have been addressed by the European Commission’s H2020 programme among which the fourth is about smart, green, and integrated transport. The architecture is based on a messaging system through which data producers and consumers can communicate using different channels. A data producer reads the data from a source, applying a transformation in order to use a common format and semantics that is known to the consumers, and writes the data into a channel. A consumer, subscribed to that channel, reads the data and applies some specific transformations before sending the result to another channel for further processing or to a sink. Producers and consumers are jobs that can be deployed in different nodes in order to parallelize the computation. The architecture is based on Apache Kafka for the message passing, on Apache Flink, Rserve, and Postgis for processing real time data streams and historical data, and on Elasticsearch for the storage of the results. All the components are deployed as Docker containers in a distributed environment. The platform is being tested using the Floating Car Data from Thessaloniki. The raw data containing the timestamp, the location of the vehicles, orientation, and speed is transformed and map matched to the road segments and then aggregated in time windows to compute the average speed and traffic flow.During the deployment phase of the transport pilot, some of those components will be externalized in virtual machines, relying upon cloud based High Performance Computing provided by GRNET, the national research infrastructure provider.


## 3.1. Thessaloniki’s Large-Scale Mobility Model

The urban mobility model for Thessaloniki includes 47807 intersections (with detailed information about the geometry and control type) and 137854 directed road segments (with length, number of lanes, free flow speed, capacity, direction, allowed transportation modes, existence of dedicated lanes, and parking regulation). Links are classified into 6 categories, depending on their capacity (which has been proportionaly reduced, based on the use of bus lanes and/or parking spaces) and free flow speed. Each road category has a unique Volume-Delay Function (VDF), based on the BPR (Bureau of Public Roads [7]).The network consists of 359 traffic analysis zones (306 describing the metropolitan area of Thessaloniki and the rest representing external zones) and 3508 connectors. The demand side consists of 24 hourly Origin-Destination matrices for private vehicle trips, estimated using household and road side surveys ([8, 9]).


## 3.2. Collection of Big Transport and Mobility Data

Thessaloniki is the largest city of Northern Greece and the second in the whole Greece, with a total of more than 1 million citizens in its greater area, which covers 1500 km2. It has an average density of 665 inhabitants per km2 and the total number of vehicles exceeds 777000, including private cars, heavy vehicles, and motorcycles [8]. Conventional sensors (loops, radars, and cameras), probe data (stationary and floating), and social networks derived content are utilized in the city for processing mobility-related indicators, as well as for providing Advanced Traveller Information Services (real-time travel time and vehicle speed estimation).


### 3.2.1. Conventional Traffic Data Sources

There are three sets of conventional mobility data sensors in Thessaloniki (Figure1):(i)
The surveillance system of the Peripheral Ring Road consisting of 9 cameras (CAM in Figure1) monitoring 100000 vehicles per day (as of 2011) in both directions.(ii)
The Thessaloniki’s Urban Mobility Management System, consisting of 12 cameras and 7 radars (CAR in Figure1), installed at the city’s busiest arterial, monitoring 50000 vehicles per day (as of 2012) in one direction.(iii)
The traffic lights management system, consisting of 503 Inductive Loop Detectors (ILD in Figure1) installed at traffic light controlled intersections in the city, monitoring 250000 vehicles per day.Figure 1
Mobility sensors in the city of Thessaloniki.


### 3.2.2. Stationary Probe Data

The Bluetooth (BT) detectors network is comprised of 43 roadside devices, installed at selected major intersections [10] throughout the road network of the city, as shown in Figure 2.Figure 2
BT detectors network in the city of Thessaloniki.More than 100000 BT-equipped devices are detected every day, generating on average a total of 300000 detections at the 43 locations.


### 3.2.3. Floating Probe Data

The floating probe data are derived from a 1200 taxi vehicles’ fleet, circulating 14 hours on average per day and generating pulses every 6 seconds, which contain their location and instantaneous speed. The data collected and processed reaches on average 2500 pulses per minute, with daily totals at approximately 1.5 million.


## 3.2.1. Conventional Traffic Data Sources

There are three sets of conventional mobility data sensors in Thessaloniki (Figure1):(i)
The surveillance system of the Peripheral Ring Road consisting of 9 cameras (CAM in Figure1) monitoring 100000 vehicles per day (as of 2011) in both directions.(ii)
The Thessaloniki’s Urban Mobility Management System, consisting of 12 cameras and 7 radars (CAR in Figure1), installed at the city’s busiest arterial, monitoring 50000 vehicles per day (as of 2012) in one direction.(iii)
The traffic lights management system, consisting of 503 Inductive Loop Detectors (ILD in Figure1) installed at traffic light controlled intersections in the city, monitoring 250000 vehicles per day.Figure 1
Mobility sensors in the city of Thessaloniki.


## 3.2.2. Stationary Probe Data

The Bluetooth (BT) detectors network is comprised of 43 roadside devices, installed at selected major intersections [10] throughout the road network of the city, as shown in Figure 2.Figure 2
BT detectors network in the city of Thessaloniki.More than 100000 BT-equipped devices are detected every day, generating on average a total of 300000 detections at the 43 locations.


## 3.2.3. Floating Probe Data

The floating probe data are derived from a 1200 taxi vehicles’ fleet, circulating 14 hours on average per day and generating pulses every 6 seconds, which contain their location and instantaneous speed. The data collected and processed reaches on average 2500 pulses per minute, with daily totals at approximately 1.5 million.


## 3.3. Processing of Big Data

Figure3 depicts the framework for real-time data processes and services for the city of Thessaloniki. It is composed of the data collection from the real world as well as the offline and real-time processes, which culminates in the provision of real-time mobility services.Figure 3
Framework for real-time data processes and services in Thessaloniki.The data collected by the above-mentioned sensors and systems require filtering and processing, in order to accurately estimate mobility indicators and provide Advanced Traveller Information Services in real time. This requests a trade-off between the quality of the analyses (time consuming) and the real-time provision of the services. The main traffic and mobility indicators estimated for the city of Thessaloniki are travel times along the main routes of the city, traffic flows in the prioritized road network, and traffic congestion levels.The individual components that have been developed and are presented in this paper are the following:(i)
Traffic flow estimation based on stationary probe data(ii)
Travel time estimation based on stationary probe data(iii)
Traffic flow estimation based on travel time(iv)
Short-term traffic flow prediction(v)
Spatial expansion of traffic flow(vi)
Real-time traffic conditions estimation


### 3.3.1. Traffic Flow Estimation from Stationary Probe Data

Figure4 depicts unfiltered traffic flow measurements (dashed line) and BT detections (straight line) in one of the busiest (in terms of traffic flow) intersections of the city for a 7-day period. It can be observed that the detections fit well with the traffic flow modifications, with a small deviation for large values of traffic flow, which may be improved by filtering properly the data. Details of this analysis can be found in [11].Figure 4
Detected BT devices and measured traffic flow versus time of day.Traffic flow is extrapolated directly from aggregated detections of devices equipped with BT. The reliability and accuracy of this methodology largely depend on the penetration of the Bluetooth technologies to travellers and vehicles. Statistical and comparative analyses conducted for the case of Thessaloniki reveal an R2 deviation between traffic flow measurements and BT detections equal to 0.91, reflecting the methodology’s potential.Figure5 presents the relation between detected BT devices and measured traffic flow at a single intersection. As observed, there is a strong correlation between the two with an R2 relation equal to 0.89 (prior to data filtering). In addition, 37% of the traffic flow is detected by BT detectors. It can be observed that the relation is different in low and in high values of traffic flow volume, which is also observed in Figure 4.Figure 5
Relation between detected BT devices and measured traffic flow without filtering the detections at a single intersection.After filtering the BT detections and removing double entries (related to nonmoving objects) during predefined time intervals, the corrected correlation between detected and measured vehicles is approximately 20%. Table1 summarizes the impact of using different time intervals for filtering the data (time duration during which detected objects are classified as nonmoving) for the same intersection used for obtaining Figures 4 and 5 during a single day. The best fit is obtained with the 15-minute filter.Table 1
Relation between detection and traffic flow for different filters.
Time interval used for data filtering Without filtering 5min filter 15min filter 60min filter Correlation coefficient 0.3682 0.2179 0.1972 0.0442  R2 0.8947 0.9193 0.9337 0.8594  Largest differences(absolute value and percentage ranges) -401 / 623 vehicles-26% / 75% -410 / 437 vehicles-23% / 61% -336 / 389 vehicles-22% / 57% -536 / 767 vehicles-35% / 79%


### 3.3.2. Travel Time Estimation

Floating probe data is used in a similar way for estimating travel times [12] and traffic states ([13–21]). Two consecutive pulses from moving objects generate 100-meter long trajectories, which are matched with virtual locations within the network, in order to generate “detections” and match them for estimating travel times. Only a part of the filters applied to the stationary probe data is applied, since the sample is “controlled” (all the data is related to vehicles).Alternatively, individual travel times are estimated by matching the detected MAC address identities at various locations of the road network and comparing the timestamps, in order to obtain individual travel times, which are aggregated and filtered to obtain average travel times. The aggregation of the individual travel times allows filtering them, eliminating outliers and noise, such as en-route stops, trip ends between detectors, detours deviating from the predefined paths, or records from other transportation modes, such as pedestrians, bicycles, and users of the public transport system as well as atypical vehicles such as couriers or delivery vehicles. The methodological flowchart can be found in [22].


### 3.3.3. Traffic Flow Estimation Based on Travel Time

The estimated travel times along various routes are converted to link travel times and to link traffic flows, according to the process depicted in Figure6.Figure 6
Traffic flow estimation procedure from path travel times.As observed, the measurements of route travel times (based on probe data) and individual link travel times (from conventional sensors/detectors) are used for the correction of the link travel times which belong to those routes. The link traffic flow measurements (based on both probe data and conventional sensors/detectors) are also used for the estimation of the link travel times. Finally, the link travel times are converted to link traffic flows (with the use of volume-delay functions) providing a unique relation between traffic volume and speed on a specific link for determining the spatial evolution of traffic flows and merged with the links having traffic flow measurements (stand-alone links).The conversion from route travel time to link travel time for the links which constitute the route is conducted using the following mathematical minimization problem:(1)minδ1∑Ax-b+δ2∑x-v0v0S. t.xi≥t0i,∀i∈Ixj=tj,∀j∈Jwhereδ1andδ2 are weights for the minimization problem (0.6 and 0.4, respectively),Α is the link-path incidence matrix (αij is 1 if the link j is part of path i),x is the link travel times vector (xi is the travel time of link i),b is the paths travel times vector (bj is the travel time of path j),v0 is the initial link travel times vector derived from the traffic assignment model (v0i is the initial travel time of link i as in the traffic assignment model),t0i is the free flow travel times of link i,tj is the observed travel times of link j (if measurements of traffic flow exist, the conversion takes place based on the VDF),I is the set of all links which constitute the paths,J is the subset of I of the links for which observations exist.The objective function consists of two parts: the first part contains the estimation of the difference between the path travel time and the sum of the link travel times which define the path. In the second part, the percentile difference is estimated between the link travel times derived from the traffic assignment model and the estimated travel time, in order to avoid burdening links with very small travel times, which would excessively increase the traffic flow.The first constraint ensures that the minimum link travel time cannot be smaller than the free flow link travel time. The second constraint ensures that the link travel time used for links for which travel times are measured is equal to the measured travel time.


### 3.3.4. Short-Term Traffic Flow Prediction

Various studies have been developed for forecasting traffic state, flow, and patterns ([23–29]) but most of them are applied to freeways.For the short-term traffic flow prediction used in this framework, a linear autoregressive (AR of degree up to 3, depending on the time series created at each location) model is used. The degree of each model depends on the time series of the previous time periods and is formulated as follows:(2)φki+1=φ-k+∑j=1Nβkj∗φki+1-j-φ-kwhereφki is the traffic flow of link k for time period i,φ-k is the average traffic flow of link k for the time period of the last two days,βj is the serial correlation coefficient j of link k,N is the degree of the autoregressive model.


### 3.3.5. Spatial Expansion of Traffic Flows

Various data fusion techniques have been developed for fusing multisource traffic data ([30, 31]). In the proposed framework, the spatial expansion of traffic flows is based on the Data Expansion Algorithm (DEA) ([32]). The implementation for Thessaloniki’s road network differs in that the link traffic flows are used as a constraint and the optimization regards the minimization of the differences of the distributions of vehicles on intersections (the original DEA does it in the opposite way). The mathematical formulation is presented below:(3)minD-p.∗Cn∗x-p.∗Cc∗cs.t.xi>lbi∀i∈Ixι<ubi∀i∈Ixj=fj∀j∈JwhereD is diagonal unitary matrix (with dimensions equal to the total number of links),p is the vector of the percentages of traffic flows on intersection (junction) level which is distributed at every link (pij is the percentage of traffic at intersection i derived to link j),Cn is the adjacency table at link level (Cnij is 1 if the link j precedes link i),x is the vector of traffic flows (xi is the traffic flow at link i),Cc is the incidence matrix (Ccij is 1 if the connector i ends or starts at intersection j),c is the vector of traffic flows found at the connectors (ci is the traffic flow at connector i),lb is vector of the minimum traffic flow values (lbi is the minimum traffic flow at link i),ub is the vector with the maximum traffic flow values (ubi is the maximum traffic flow at link i),f is the vector with the measured traffic flows (fi is the measured traffic flow at link i),I is the set of all links,J is the subset of I for which traffic flow measurements exist.The objective function consists of two parts: in the first part the adjacency matrix is estimated at link level. In the adjacency matrix, all the percentages of traffic flows from every link to all other links are included. In the second part, the traffic flow of the connector links is estimated.The first and second constraints ensure the minimum and maximum traffic flow for each link, while the third constraint ensures that the flow on links for which measurements exist is the measured flow.


### 3.3.6. Real-Time Traffic Conditions Estimation

Based on the data and processes described above, traffic congestion is estimated at real time and forecasted in a short-term basis. Both travel time measured at selected routes using BT detectors and floating probe data are converted into traffic flow by using volume-delay functions. All measurements and estimations are forecasted by an autoregressive model for 15, 30, 45, and 60 minutes and the process is repeated, in order to obtain traffic flows for the forecasted scenarios. Finally, all traffic flows are merged into a nonlinear mathematical program by means of a modified DEA, resulting in link flows, travel times, and average speed values for the entire network (with the use of link-based volume-delay functions).


## 3.3.1. Traffic Flow Estimation from Stationary Probe Data

Figure4 depicts unfiltered traffic flow measurements (dashed line) and BT detections (straight line) in one of the busiest (in terms of traffic flow) intersections of the city for a 7-day period. It can be observed that the detections fit well with the traffic flow modifications, with a small deviation for large values of traffic flow, which may be improved by filtering properly the data. Details of this analysis can be found in [11].Figure 4
Detected BT devices and measured traffic flow versus time of day.Traffic flow is extrapolated directly from aggregated detections of devices equipped with BT. The reliability and accuracy of this methodology largely depend on the penetration of the Bluetooth technologies to travellers and vehicles. Statistical and comparative analyses conducted for the case of Thessaloniki reveal an R2 deviation between traffic flow measurements and BT detections equal to 0.91, reflecting the methodology’s potential.Figure5 presents the relation between detected BT devices and measured traffic flow at a single intersection. As observed, there is a strong correlation between the two with an R2 relation equal to 0.89 (prior to data filtering). In addition, 37% of the traffic flow is detected by BT detectors. It can be observed that the relation is different in low and in high values of traffic flow volume, which is also observed in Figure 4.Figure 5
Relation between detected BT devices and measured traffic flow without filtering the detections at a single intersection.After filtering the BT detections and removing double entries (related to nonmoving objects) during predefined time intervals, the corrected correlation between detected and measured vehicles is approximately 20%. Table1 summarizes the impact of using different time intervals for filtering the data (time duration during which detected objects are classified as nonmoving) for the same intersection used for obtaining Figures 4 and 5 during a single day. The best fit is obtained with the 15-minute filter.Table 1
Relation between detection and traffic flow for different filters.
Time interval used for data filtering Without filtering 5min filter 15min filter 60min filter Correlation coefficient 0.3682 0.2179 0.1972 0.0442  R2 0.8947 0.9193 0.9337 0.8594  Largest differences(absolute value and percentage ranges) -401 / 623 vehicles-26% / 75% -410 / 437 vehicles-23% / 61% -336 / 389 vehicles-22% / 57% -536 / 767 vehicles-35% / 79%


## 3.3.2. Travel Time Estimation

Floating probe data is used in a similar way for estimating travel times [12] and traffic states ([13–21]). Two consecutive pulses from moving objects generate 100-meter long trajectories, which are matched with virtual locations within the network, in order to generate “detections” and match them for estimating travel times. Only a part of the filters applied to the stationary probe data is applied, since the sample is “controlled” (all the data is related to vehicles).Alternatively, individual travel times are estimated by matching the detected MAC address identities at various locations of the road network and comparing the timestamps, in order to obtain individual travel times, which are aggregated and filtered to obtain average travel times. The aggregation of the individual travel times allows filtering them, eliminating outliers and noise, such as en-route stops, trip ends between detectors, detours deviating from the predefined paths, or records from other transportation modes, such as pedestrians, bicycles, and users of the public transport system as well as atypical vehicles such as couriers or delivery vehicles. The methodological flowchart can be found in [22].


## 3.3.3. Traffic Flow Estimation Based on Travel Time

The estimated travel times along various routes are converted to link travel times and to link traffic flows, according to the process depicted in Figure6.Figure 6
Traffic flow estimation procedure from path travel times.As observed, the measurements of route travel times (based on probe data) and individual link travel times (from conventional sensors/detectors) are used for the correction of the link travel times which belong to those routes. The link traffic flow measurements (based on both probe data and conventional sensors/detectors) are also used for the estimation of the link travel times. Finally, the link travel times are converted to link traffic flows (with the use of volume-delay functions) providing a unique relation between traffic volume and speed on a specific link for determining the spatial evolution of traffic flows and merged with the links having traffic flow measurements (stand-alone links).The conversion from route travel time to link travel time for the links which constitute the route is conducted using the following mathematical minimization problem:(1)minδ1∑Ax-b+δ2∑x-v0v0S. t.xi≥t0i,∀i∈Ixj=tj,∀j∈Jwhereδ1andδ2 are weights for the minimization problem (0.6 and 0.4, respectively),Α is the link-path incidence matrix (αij is 1 if the link j is part of path i),x is the link travel times vector (xi is the travel time of link i),b is the paths travel times vector (bj is the travel time of path j),v0 is the initial link travel times vector derived from the traffic assignment model (v0i is the initial travel time of link i as in the traffic assignment model),t0i is the free flow travel times of link i,tj is the observed travel times of link j (if measurements of traffic flow exist, the conversion takes place based on the VDF),I is the set of all links which constitute the paths,J is the subset of I of the links for which observations exist.The objective function consists of two parts: the first part contains the estimation of the difference between the path travel time and the sum of the link travel times which define the path. In the second part, the percentile difference is estimated between the link travel times derived from the traffic assignment model and the estimated travel time, in order to avoid burdening links with very small travel times, which would excessively increase the traffic flow.The first constraint ensures that the minimum link travel time cannot be smaller than the free flow link travel time. The second constraint ensures that the link travel time used for links for which travel times are measured is equal to the measured travel time.


## 3.3.4. Short-Term Traffic Flow Prediction

Various studies have been developed for forecasting traffic state, flow, and patterns ([23–29]) but most of them are applied to freeways.For the short-term traffic flow prediction used in this framework, a linear autoregressive (AR of degree up to 3, depending on the time series created at each location) model is used. The degree of each model depends on the time series of the previous time periods and is formulated as follows:(2)φki+1=φ-k+∑j=1Nβkj∗φki+1-j-φ-kwhereφki is the traffic flow of link k for time period i,φ-k is the average traffic flow of link k for the time period of the last two days,βj is the serial correlation coefficient j of link k,N is the degree of the autoregressive model.


## 3.3.5. Spatial Expansion of Traffic Flows

Various data fusion techniques have been developed for fusing multisource traffic data ([30, 31]). In the proposed framework, the spatial expansion of traffic flows is based on the Data Expansion Algorithm (DEA) ([32]). The implementation for Thessaloniki’s road network differs in that the link traffic flows are used as a constraint and the optimization regards the minimization of the differences of the distributions of vehicles on intersections (the original DEA does it in the opposite way). The mathematical formulation is presented below:(3)minD-p.∗Cn∗x-p.∗Cc∗cs.t.xi>lbi∀i∈Ixι<ubi∀i∈Ixj=fj∀j∈JwhereD is diagonal unitary matrix (with dimensions equal to the total number of links),p is the vector of the percentages of traffic flows on intersection (junction) level which is distributed at every link (pij is the percentage of traffic at intersection i derived to link j),Cn is the adjacency table at link level (Cnij is 1 if the link j precedes link i),x is the vector of traffic flows (xi is the traffic flow at link i),Cc is the incidence matrix (Ccij is 1 if the connector i ends or starts at intersection j),c is the vector of traffic flows found at the connectors (ci is the traffic flow at connector i),lb is vector of the minimum traffic flow values (lbi is the minimum traffic flow at link i),ub is the vector with the maximum traffic flow values (ubi is the maximum traffic flow at link i),f is the vector with the measured traffic flows (fi is the measured traffic flow at link i),I is the set of all links,J is the subset of I for which traffic flow measurements exist.The objective function consists of two parts: in the first part the adjacency matrix is estimated at link level. In the adjacency matrix, all the percentages of traffic flows from every link to all other links are included. In the second part, the traffic flow of the connector links is estimated.The first and second constraints ensure the minimum and maximum traffic flow for each link, while the third constraint ensures that the flow on links for which measurements exist is the measured flow.


## 3.3.6. Real-Time Traffic Conditions Estimation

Based on the data and processes described above, traffic congestion is estimated at real time and forecasted in a short-term basis. Both travel time measured at selected routes using BT detectors and floating probe data are converted into traffic flow by using volume-delay functions. All measurements and estimations are forecasted by an autoregressive model for 15, 30, 45, and 60 minutes and the process is repeated, in order to obtain traffic flows for the forecasted scenarios. Finally, all traffic flows are merged into a nonlinear mathematical program by means of a modified DEA, resulting in link flows, travel times, and average speed values for the entire network (with the use of link-based volume-delay functions).


## 3.4. High Performance Computing in Thessaloniki

Transport and mobility data sets coming from multiple innovative and conventional data sources like those described in Section2 consist of both structured and unstructured data that usually are relatively large and also are being produced at very high rates. On the other hand, the corresponding monitoring and processing applications typically utilize complex algorithms that require the acquisition, transformation, combination, and processing of those data sets in almost real time in an efficient way. As the technology evolves, these requirements lead to a need of constant improvement of the software infrastructure, procedures, and data pipelines used by the applications.In this context, it becomes clearer that mature and cutting-edge technologies can be used together, in order for those data sets and streams to be handled efficiently. In the current architecture, a set of applications filters and transforms the raw data coming from different data sources and the result is stored in a relational database management systems and exposed via unified, compatible, and secure APIs. As many new open source software frameworks are made available to process big datasets, in batches or streams, and store the result in distributed storage systems, the architecture is being evolved towards a microservice architecture. The aim of the evolution is on one side to address the scalability and availability issues of the overall architecture and on the other side to implement the most recent software engineering best practices for the development and deployment of software components leveraging containerization technologies such as Docker. Evolving a software architecture involves both the technologies and the people who use them. As it is common in different research and production environments, new software tools and technologies must be integrated with some of the existing components and software packages.A new architecture for the ingestion, processing, and storage of the traffic data is being developed within the Big Data Europe project. The project aims at developing a platform where big data frameworks can be easily integrated to build distributed data processing pipelines. The platform usage will be demonstrated in all the seven societal challenges that have been addressed by the European Commission’s H2020 programme among which the fourth is about smart, green, and integrated transport. The architecture is based on a messaging system through which data producers and consumers can communicate using different channels. A data producer reads the data from a source, applying a transformation in order to use a common format and semantics that is known to the consumers, and writes the data into a channel. A consumer, subscribed to that channel, reads the data and applies some specific transformations before sending the result to another channel for further processing or to a sink. Producers and consumers are jobs that can be deployed in different nodes in order to parallelize the computation. The architecture is based on Apache Kafka for the message passing, on Apache Flink, Rserve, and Postgis for processing real time data streams and historical data, and on Elasticsearch for the storage of the results. All the components are deployed as Docker containers in a distributed environment. The platform is being tested using the Floating Car Data from Thessaloniki. The raw data containing the timestamp, the location of the vehicles, orientation, and speed is transformed and map matched to the road segments and then aggregated in time windows to compute the average speed and traffic flow.During the deployment phase of the transport pilot, some of those components will be externalized in virtual machines, relying upon cloud based High Performance Computing provided by GRNET, the national research infrastructure provider.


## 4. Conclusions and Further Work

This paper presented the framework for big transport and mobility data collection and processing applied in Thessaloniki. Recent technological advances allow for shifting from aggregated to disaggregated data collection at individual traveller level, which increases significantly on the one hand the needs for data processing and on the other hand the reliability of the Advanced Traveller Information Services.These result in a need for new postprocessing tools, which should be able to perform in real time. Also, new methodologies are needed, in order to take advantage of the technologies and new societal behaviour patterns for increasing the accuracy and performance of the existing transport related information services and the creation of new traveller services.Finally, future research directions should cover the topics of multisource mobility data exploitation, as well as fusion with data coming from social networks.



---

*Source: 9078547-2018-06-19.xml*