Computing dynamic user equilibria for large-scale transportation networks

2006 ◽  
Author(s):  
Mansoureh Jeihani ◽  
Hanif D. Sherali ◽  
Antoine G. Hobeika
Keyword(s):  
Large Scale ◽  
Transportation Networks

Multi-modal transportation recommendation with unified route representation learning

2020 ◽  
Vol 14 (3) ◽  
pp. 342-350
Author(s):  
Hao Liu ◽  
Jindong Han ◽  
Yanjie Fu ◽  
Jingbo Zhou ◽  
Xinjiang Lu ◽  
...  
Keyword(s):  
Large Scale ◽  
Transportation Networks ◽  
Representation Learning ◽  
Transportation Systems ◽  
Graph Representation ◽  
Dynamic Graph ◽  
Arbitrary Length ◽  
Task Learning ◽  
Semantic Coherence ◽  
Spatio Temporal

Multi-modal transportation recommendation aims to provide the most appropriate travel route with various transportation modes according to certain criteria. After analyzing large-scale navigation data, we find that route representations exhibit two patterns: spatio-temporal autocorrelations within transportation networks and the semantic coherence of route sequences. However, there are few studies that consider both patterns when developing multi-modal transportation systems. To this end, in this paper, we study multi-modal transportation recommendation with unified route representation learning by exploiting both spatio-temporal dependencies in transportation networks and the semantic coherence of historical routes. Specifically, we propose to unify both dynamic graph representation learning and hierarchical multi-task learning for multi-modal transportation recommendations. Along this line, we first transform the multi-modal transportation network into time-dependent multi-view transportation graphs and propose a spatiotemporal graph neural network module to capture the spatial and temporal autocorrelation. Then, we introduce a coherent-aware attentive route representation learning module to project arbitrary-length routes into fixed-length representation vectors, with explicit modeling of route coherence from historical routes. Moreover, we develop a hierarchical multi-task learning module to differentiate route representations for different transport modes, and this is guided by the final recommendation feedback as well as multiple auxiliary tasks equipped in different network layers. Extensive experimental results on two large-scale real-world datasets demonstrate the performance of the proposed system outperforms eight baselines.

scholarly journals Deep Autoencoder Neural Networks for Short-Term Traffic Congestion Prediction of Transportation Networks

Sensors ◽  
2019 ◽  
Vol 19 (10) ◽  
pp. 2229 ◽  
Author(s):  
Sen Zhang ◽  
Yong Yao ◽  
Jie Hu ◽  
Yong Zhao ◽  
Shaobo Li ◽  
...  
Keyword(s):  
Neural Network ◽  
Intelligent Transportation Systems ◽  
Traffic Congestion ◽  
Large Scale ◽  
Transportation Networks ◽  
Transportation Network ◽  
Transportation Systems ◽  
Neural Network Models ◽  
Computation Efficiency ◽  
Congestion Prediction

Traffic congestion prediction is critical for implementing intelligent transportation systems for improving the efficiency and capacity of transportation networks. However, despite its importance, traffic congestion prediction is severely less investigated compared to traffic flow prediction, which is partially due to the severe lack of large-scale high-quality traffic congestion data and advanced algorithms. This paper proposes an accessible and general workflow to acquire large-scale traffic congestion data and to create traffic congestion datasets based on image analysis. With this workflow we create a dataset named Seattle Area Traffic Congestion Status (SATCS) based on traffic congestion map snapshots from a publicly available online traffic service provider Washington State Department of Transportation. We then propose a deep autoencoder-based neural network model with symmetrical layers for the encoder and the decoder to learn temporal correlations of a transportation network and predicting traffic congestion. Our experimental results on the SATCS dataset show that the proposed DCPN model can efficiently and effectively learn temporal relationships of congestion levels of the transportation network for traffic congestion forecasting. Our method outperforms two other state-of-the-art neural network models in prediction performance, generalization capability, and computation efficiency.

scholarly journals Urban Freight Management with Stochastic Time-Dependent Travel Times and Application to Large-Scale Transportation Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Shichao Sun ◽  
Zhengyu Duan ◽  
Dongyuan Yang
Keyword(s):  
Large Scale ◽  
Time Window ◽  
Transportation Networks ◽  
Optimal Path ◽  
Time Dependent ◽  
Travel Times ◽  
Urban Network ◽  
Routing Problem ◽  
On The Road ◽  
Stochastic Time

This paper addressed the vehicle routing problem (VRP) in large-scale urban transportation networks with stochastic time-dependent (STD) travel times. The subproblem which is how to find the optimal path connecting any pair of customer nodes in a STD network was solved through a robust approach without requiring the probability distributions of link travel times. Based on that, the proposed STD-VRP model can be converted into solving a normal time-dependent VRP (TD-VRP), and algorithms for such TD-VRPs can also be introduced to obtain the solution. Numerical experiments were conducted to address STD-VRPTW of practical sizes on a real world urban network, demonstrated here on the road network of Shenzhen, China. The stochastic time-dependent link travel times of the network were calibrated by historical floating car data. A route construction algorithm was applied to solve the STD problem in 4 delivery scenarios efficiently. The computational results showed that the proposed STD-VRPTW model can improve the level of customer service by satisfying the time-window constraint under any circumstances. The improvement can be very significant especially for large-scale network delivery tasks with no more increase in cost and environmental impacts.

A New Dynamic Graph Structure for Large-Scale Transportation Networks

2013 ◽  
pp. 312-323 ◽  
Author(s):  
Georgia Mali ◽  
Panagiotis Michail ◽  
Andreas Paraskevopoulos ◽  
Christos Zaroliagis
Keyword(s):  
Large Scale ◽  
Transportation Networks ◽  
Graph Structure ◽  
Dynamic Graph

Discovering spurious links in multiplex networks based on interlayer relevance

2019 ◽  
Vol 7 (5) ◽  
pp. 641-658 ◽  
Author(s):  
Zeynab Samei ◽  
Mahdi Jalili
Keyword(s):  
Social Networks ◽  
Social Networking ◽  
Link Prediction ◽  
Large Scale ◽  
Transportation Networks ◽  
Similarity Index ◽  
Similarity Measures ◽  
Computation Complexity ◽  
Multiplex Networks ◽  
Large Scale Networks

Abstract Many real-world complex systems can be better modelled as multiplex networks, where the same individuals develop connections in multiple layers. Examples include social networks between individuals on multiple social networking platforms, and transportation networks between cities based on air, rail and road networks. Accurately predicting spurious links in multiplex networks is a challenging issue. In this article, we show that one can effectively use interlayer information to build an algorithm for spurious link prediction. We propose a similarity index that combines intralayer similarity with interlayer relevance for the link prediction purpose. The proposed similarity index is used to rank the node pairs, and identify those that are likely to be spurious. Our experimental results show that the proposed metric is much more accurate than intralayer similarity measures in correctly predicting the spurious links. The proposed method is an unsupervised method and has low computation complexity, and thus can be effectively applied for spurious link prediction in large-scale networks.

scholarly journals Electrical Vehicle Charging Services Planning and Operation with Interdependent Power Networks and Transportation Networks: A Review of the Current Scenario and Future Trends

Energies ◽  
2020 ◽  
Vol 13 (13) ◽  
pp. 3371 ◽  
Author(s):  
Shafqat Jawad ◽  
Junyong Liu
Keyword(s):  
Power Distribution ◽  
Traffic Congestion ◽  
Large Scale ◽  
Network Performance ◽  
Transportation Networks ◽  
Transportation Systems ◽  
Survey Analysis ◽  
Power Networks ◽  
Interdependent Network ◽  
Electrical Vehicle

The growing trend in electrical vehicle (EV) deployment has transformed independent power network and transportation network studies into highly congested interdependent network performance evaluations assessing their impact on power and transportation systems. Electrified transportation is highly capable of intensifying the interdependent correlations across charging service, transportation, and power networks. However, the evaluation of the complex coupled relationship across charging services, transportation, and power networks poses several challenges, including an impact on charging scheduling, traffic congestion, charging loads on the power grid, and high costs. Therefore, this article presents comparative survey analytics of large-scale EV integration’s impact on charging service network scheduling, transportation networks, and power networks. Moreover, price mechanism strategies to determine the charging fares, minimize investment profits, diminish traffic congestion, and reduce power distribution constraints under the influence of various factors were carried out. Additionally, the survey analysis stipulates the interdependent network performance index, ascertaining travel distance, route selection, long-term and short-term planning, and different infrastructure strategies. Finally, the limitations of the proposed study, potential research trends, and critical technologies are demonstrated for future inquiries.

scholarly journals Real-time Analysis of City Scale Transportation Networks in New Orleans Metropolitan Area using an Agent Based Model Approach

2019 ◽  
Vol 271 ◽  
pp. 06007
Author(s):  
Millard McElwee ◽  
Bingyu Zhao ◽  
Kenichi Soga
Keyword(s):  
New Orleans ◽  
Real Time ◽  
High Performance ◽  
Large Scale ◽  
Transportation Networks ◽  
Transportation Network ◽  
Regional Scale ◽  
Agent Based Model ◽  
Agent Based ◽  
Real Time Analysis

The primary focus of this research is to develop and implement an agent-based model (ABM) to analyze the New Orleans Metropolitan transportation network near real-time. ABMs have grown in popularity because of their ability to analyze multifaceted community scale resilience with hundreds of thousands of links and millions of agents. Road closures and reduction in capacities are examples of influences on the weights or removal of edges which can affect the travel time, speed, and route of agents in the transportation model. Recent advances in high-performance computing (HPC) have made modeling networks on the city scale much less computationally intensive. We introduce an open-source ABM which utilizes parallel distributed computing to enable faster convergence to large scale problems. We simulate 50,000 agents on the entire southeastern Louisiana road network and part of Mississippi as well. This demonstrates the capability to simulate both city and regional scale transportation networks near real time.

Sign in / Sign up

Export Citation Format

Share Document