Search

Accurate and timely forecasting of critical components is pivotal in intelligent transportation systems and traffic management, crucially mitigating congestion and enhancing safety. This paper aims to comprehensively review deep learning algorithms and classical models employed in traffic forecasting. Spanning diverse traffic datasets, the study encompasses various scenarios, offering a nuanced understanding of traffic forecasting methods. Reviewing 111 seminal research works since the 1980s, encompassing both deep learning and classical models, the paper begins by detailing the data sources utilized in transportation systems. Subsequently, it delves into the theoretical underpinnings of prevalent deep learning algorithms and classical models prevalent in traffic forecasting. Furthermore, it investigates the application of these algorithms and models in forecasting key traffic characteristics, informed by their utility in transport and traffic analyses. Finally, the study elucidates the merits and drawbacks of proposed models through applied research in traffic forecasting. Findings indicate that while deep learning algorithms and classic models serve as valuable tools, their suitability varies across contexts, necessitating careful consideration in future studies. The study underscores research opportunities in road traffic forecasting, providing a comprehensive guide for future endeavors in this domain. [ABSTRACT FROM AUTHOR]

Accurate and reliable taxi demand prediction is of great importance for intelligent planning and management in the transportation system. To collectively forecast the taxi demand in all regions of a city, many existing studies focus on the capturing of spatial and temporal correlations among regions but ignore the local statistical differences throughout the geographical layout of a city. This limits the further improvement of prediction accuracy. In this paper, we propose a new deep learning framework, called the locally connected spatial-temporal fully convolutional neural network (LC-ST-FCN), to learn the spatial-temporal correlations and local statistical differences among regions simultaneously. We evaluate the proposed model on a real dataset from a ride-hailing service platform (DiDi Chuxing) and observe significant improvements compared with a bunch of baseline models. Besides, we further explore the working mechanism of the proposed model by visualizing its feature extraction processes. The visualization results showed that our approach can better localize and capture useful features from spatial-related regions. [ABSTRACT FROM AUTHOR]

The usage of mobile phones has undergone tremendous growth in the past decades. Large amounts of mobile-phone signaling data (MSD) are generated while using various mobile phone applications. The large-scale MSD presents opportunities for transport planners to utilize it for better planning and management of the transportation system. In this paper, we use MSD to analyze subway passengers' travel behavior and extract their complete travel trajectories. The complete travel trajectories of subway passengers include their trajectories, both inside and outside the subway system. In the first stage, the MSD from the subway base stations is selected, sorted by time, and the rough trajectory in the subway system is extracted. The ground base stations around the subway station are then considered to correct the boarding and alighting subway stations in order to obtain a more detailed trajectory. In the second stage, the service range of the base station is determined according to the Thiessen polygon, and a temporal dynamic threshold is proposed to extract the passenger's stop point outside the subway system. Finally, the complete trajectories of subway passengers are obtained. The proposed algorithms are verified using a set of MSD collected in Suzhou, China. The results show that the proposed algorithms can effectively extract the complete travel trajectory of subway passengers. [ABSTRACT FROM AUTHOR]

Dockless sharing bikes play an increasingly significant role in transit transfer, especially for the first/last mile. However, it is not always accessible for users to find sharing bicycles. The objective of this paper is to assess the accessibility of dockless sharing bikes from a network perspective, which would provide a decision-making basis not only for potential bike users but also for urban planners, policymakers, and bicycle suppliers to optimize sharing-bike systems. Considering bicycle travel characteristics, a hierarchical clustering algorithm was applied to construct the dockless sharing-bike network. The social network analysis (SNA) method was adopted to assess the accessibility of the bike network. Then, a spatial interaction model was chosen to conduct a correlation analysis to compare the accessibility obtained from the SNA approach. The case study of Shanghai indicates a strong connection between the accessibility and the SNA indicators with the correlation coefficient of 0.779, which demonstrates the feasibility of the proposed method. This paper contributes to a deep understanding of dockless sharing-bike network accessibility since the SNA approach considers both the interaction barriers and the network structure of a bicycle network. The developed methodology requires fewer data and is easy to operate. Thus, it can serve as a tool to facilitate the smart management of sharing bikes for improving a sustainable transportation system. [ABSTRACT FROM AUTHOR]

There has been an increasing interest in recent years in using clustering analysis for the identification of traffic patterns that are representative of traffic conditions in support of transportation system operations and management (TSMO); integrated corridor management; and analysis, modeling, and simulation (AMS). However, there has been limited information to support agencies in their selection of the most appropriate clustering technique(s), associated parameters, the optimal number of clusters, clustering result analysis, and selecting observations that are representative of each cluster. This paper investigates and compares the use of a number of existing clustering methods for traffic pattern identifications, considering the above. These methods include the K-means, K-prototypes, K-medoids, four variations of the Hierarchical method, and the combination of Principal Component Analysis for mixed data (PCAmix) with K-means. Among these methods, the K-prototypes and K-means with PCs produced the best results. The paper then provides recommendations regarding conducting and utilizing the results of clustering analysis. [ABSTRACT FROM AUTHOR]

Two common types of animal-vehicle collision data (reported animal-vehicle collision (AVC) data and carcass removal data) are usually recorded by transportation management agencies. Previous studies have found that these two datasets often demonstrate different characteristics. To accurately identify the higher-risk animal-vehicle collision sites, this study compared the differences in hotspot identification and the effect of explanation variables between carcass removal and reported AVCs. To complete the objective, both the Negative Binomial (NB) model and the generalized Negative Binomial (GNB) are applied in calculating the Empirical Bayesian (EB) estimates using the animal collision data collected on ten highways in Washington State. The important findings can be summarized as follows. (1) The explanatory variables have different effects on the occurrence of carcass removal data and reported AVC data. (2) The ranking results from EB estimates when using carcass removal data and reported AVC data differ significantly. (3) The results of hotspot identification are different between carcass removal data and reported AVC data. However, the ranking results of GNB models are better than those of NB models in terms of consistency. Thus, transportation management agencies should be cautious when using either carcass removal data or reported AVC data to identify hotspots. [ABSTRACT FROM AUTHOR]

Deterministic/point/vertical and shockwave/physical/horizontal queueing models are widely used in traffic operation to estimate vehicular queue length and delays at bottlenecks such as signalized intersections. The consistency between the two types of queueing model in terms of their estimation performance has been a subject of debate for decades. This paper reexamines the issue, typically with respect to oversaturated signal intersections, and demonstrates the consistency based on analytical studies and microscopic simulations. While fixed-location sensor data was dominating, it was hardly possible to construct the deterministic or shockwave queueing profile using real data. For this reason, either profile had significance only at a conceptual level and could not be put into practical usage. With the quick spread of mobile sensing data, however, the situation has drastically changed. In this context, this paper also intends to develop an efficient approach to the reconstruction of the deterministic and shockwave queueing profiles in a quasi-real-time manner using very limited mobile sensing data. Microscopic simulations with AIMSUN have demonstrated the efficiency of the approach as well as the analytical results obtained in this paper. [ABSTRACT FROM AUTHOR]

The increase in air traffic worldwide requires improvement of flight operational efficiency. This study aims to reveal the potential benefits, namely, savings on fuel consumption and flight time, which are expected for Japanese airspace, by statistically evaluating the operational efficiency defined by average differences of fuel consumption, flight time, and flight distance between the original and the optimized flight of domestic flights in Japan. The aircraft position and time data used in this study were obtained from Collaborative Actions for Renovation of Air Traffic Systems Open Data—the radar data released by the Japan Civil Aviation Bureau. Flight information, such as air data and fuel flow, is estimated by applying meteorological data and aircraft performance model to the position information of radar data. Each reconstructed trajectory is optimized in terms of flight fuel consumption and flight time with an assumed cost index (CI). Dynamic programming is used as the trajectory optimization method. The flight fuel consumption and flight time of the optimized flight are compared with the original values to evaluate the operational efficiency. Herein, approximately one-third of 1-day data, i.e., 1087 cases of four aircraft types, are analyzed with reasonable CI settings. Our research findings suggest that flight fuel consumption and flight distance can be saved by 312 kg and 19.7 km, respectively, on average for the object flights. Following a statistical comparison between the original and the optimized flights, it was observed that two types of features, namely, flying on a detoured path and flying with nonoptimal altitude and speed in the cruise phase, are major factors which deteriorate the total operational efficiency in terms of fuel consumption, flight time, and flight distance. [ABSTRACT FROM AUTHOR]

Service matching aims to find the information similar to a given query, which has numerous applications in web search. Although existing methods yield promising results, they are not applicable for transportation. In this paper, we propose a multilevel matching method based on semantic technology, towards efficiently searching the traffic information requested. Our approach is divided into two stages: service clustering, which prunes candidate services that are not promising, and functional matching. The similarity at function level between services is computed by grouping the connections between the services into inheritance and noninheritance relationships. We also developed a three-layer framework with a semantic similarity measure that requires less time and space cost than existing method since the scale of candidate services is significantly smaller than the whole transportation network. The OWL_TC4 based service set was used to verify the proposed approach. The accuracy of offline service clustering reached 93.80%, and it reduced the response time to 651 ms when the total number of candidate services was 1000. Moreover, given the different thresholds for the semantic similarity measure, the proposed mixed matching model did better in terms of recall and precision (i.e., up to 72.7% and 80%, respectively, for more than 1000 services) compared to the compared models based on information theory and taxonomic distance. These experimental results confirmed the effectiveness and validity of service matching for responding quickly and accurately to user queries. [ABSTRACT FROM AUTHOR]

This study examines the potential for a social network peer-to-peer-based carpooling system called FacePorter for the University of Calgary staff and students. In this study, a survey that combined both revealed and stated preferences was designed and distributed randomly among students and staff. The survey consisted of a sample of 210 responses, which were divided into two groups of stated preference respondents: (i) auto drivers, who were given the choice between driving alone and carpooling as drivers; and (ii) transit riders, who were given the choice between public transport and carpooling as passengers. A binomial logit model and two ordinal logit models (one for ride offerors and one for ride seekers) were calibrated to examine the impacts of various examined socio-economic, psychological, and travel characteristic variables on the propensity to participate in the hypothetical carpooling program. The results of the models clearly demonstrated that many factors have significant impacts on FacePorter demand: occupation, income, marital status, working schedule flexibility, trip characteristics (i.e., distance, travel time, and number of required transfers when riding transit), weather condition, carpooling fee, perceived rider and driver profiles, and carpooling fee would significantly influence the market demand of the examined carpooling system. Copyright © 2015 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

I critique the innovation processes that yield transportation's technologies, and to aid my analysis I look back to take advantage of the accumulation of experiences and insights marked by the millennium. I identify supply, transport, and user systems. Transport systems move things; supply systems provide fuel, pavements, and other inputs to transport activities; and user systems combine transport with other activities for socially useful purposes. The discussion then shifts from structure to behavior, and a short review of the emergence of today's systems reminds us that technological advances may improve the provision of old services, offer new ways of doing old things, or induce qualitative changes that enable doing new things. With these structural and behavioral matters in mind, I challenge the reader to judge the present situation and the future. [ABSTRACT FROM AUTHOR]

North-Eastern Europe is a peripheral area around the Baltic Sea. In some parts i.e. Scandinavia high living standards including developed transport systems exist when at the same time rapid changes in the way of living in other parts - Poland, the Baltic Countries and Russia - are ongoing. Transport policies in the European Union are caught between demands for improved mobility and the concern on the environmental protection. In the former socialist countries the environmental issues are subdued by the demands for efficient transport. A fixed road and rail connection between Denmark and Sweden will change the transport geography of the western part of the area. Also the integration of the Baltic States and Poland to the Union will inside a few years change the economic and by that way also transport structure. After a short presentation of the geography and history the current European transport landscape will be described and current transport policies reviewed. Then some topics on the major changes during the last decennia as well as future studies will be presented. The paper draws heavily from the research projects - SAMI, START and STEMM - financed by the European Commission DGVII. [ABSTRACT FROM AUTHOR]