Finding the reliable shortest path with correlated link travel times in signalized traffic networks under uncertainty

2020 ◽  
Vol 144 ◽  
pp. 102159
Author(s):  
Liang Shen ◽  
Hu Shao ◽  
Ting Wu ◽  
Emily Zhu Fainman ◽  
William H.K. Lam
Keyword(s):  
Shortest Path ◽  
Traffic Networks ◽  
Travel Times

Adaptive Reliable Shortest Path in Discrete Stochastic Networks

2014 ◽  
Vol 587-589 ◽  
pp. 1854-1857
Author(s):  
Yi Yong Pan
Keyword(s):  
Shortest Path ◽  
Stochastic Networks ◽  
Shortest Path Problem ◽  
Successive Approximations ◽  
Stochastic Network ◽  
Route Guidance ◽  
Travel Times ◽  
Routing Policy ◽  
The Face ◽  
Stochastic Travel Times

This paper addresses adaptive reliable shortest path problem which aims to find adaptive en-route guidance to maximize the reliability of arriving on time in stochastic networks. Such routing policy helps travelers better plan their trips to prepare for the risk of running late in the face of stochastic travel times. In order to reflect the stochastic characteristic of travel times, a traffic network is modeled as a discrete stochastic network. Adaptive reliable shortest path problem is uniformly defined in a stochastic network. Bellman’s Principle that is the core of dynamic programming is showed to be valid if the adaptive reliable shortest path is defined by optimal-reliable routing policy. A successive approximations algorithm is developed to solve adaptive reliable shortest path problem. Numerical results show that the proposed algorithm is valid using typical transportation networks.

scholarly journals The Effect of Route-choice Strategy on Transit Travel Time Estimates

2019 ◽  
Author(s):  
Nate Wessel ◽  
Steven Farber
Keyword(s):  
Travel Time ◽  
Shortest Path ◽  
Imperfect Information ◽  
Optimal Path ◽  
Shortest Paths ◽  
Route Choice ◽  
Travel Times ◽  
Selection Strategies ◽  
Time Estimates ◽  
Average Travel Time

Estimates of travel time by public transit often rely on the calculation of a shortest-path between two points for a given departure time. Such shortest-paths are time-dependent and not always stable from one moment to the next. Given that actual transit passengers necessarily have imperfect information about the system, their route selection strategies are heuristic and cannot be expected to achieve optimal travel times for all possible departures. Thus an algorithm that returns optimal travel times at all moments will tend to underestimate real travel times all else being equal. While several researchers have noted this issue none have yet measured the extent of the problem. This study observes and measures this effect by contrasting two alternative heuristic routing strategies to a standard shortest-path calculation. The Toronto Transit Commission is used as a case study and we model actual transit operations for the agency over the course of a normal week with archived AVL data transformed into a retrospective GTFS dataset. Travel times are estimated using two alternative route-choice assumptions: 1) habitual selection of the itinerary with the best average travel time and 2) dynamic choice of the next-departing route in a predefined choice set. It is shown that most trips present passengers with a complex choice among competing itineraries and that the choice of itinerary at any given moment of departure may entail substantial travel time risk relative to the optimal outcome. In the context of accessibility modelling, where travel times are typically considered as a distribution, the optimal path method is observed in aggregate to underestimate travel time by about 3-4 minutes at the median and 6-7 minutes at the \nth{90} percentile for a typical trip.

Plate scanning tools to obtain travel times in traffic networks

2017 ◽  
Vol 21 (5) ◽  
pp. 390-408 ◽  
Author(s):  
Santos Sánchez-Cambronero ◽  
Pilar Jiménez ◽  
Ana Rivas ◽  
Inmaculada Gallego
Keyword(s):  
Traffic Networks ◽  
Travel Times

scholarly journals Unitary Partition Algorithm in Shortest Path Problems

2019 ◽  
Vol 8 (3) ◽  
pp. 5307-5311
Keyword(s):  
Shortest Path ◽  
Interaction Networks ◽  
Traffic Networks ◽  
Friendship Networks ◽  
Electrical Networks ◽  
New Approach ◽  
Total Cost ◽  
Shortest Path Problems ◽  
System A ◽  
Railway Networks

In Existing system, a network consists of N(V,E) to find a shortest path to minimize the total cost from source to destination. Researchers have been proposed many algorithms for finding the shortest path like two familiar algorithms namely Prim’s algorithm and Kruskal’s algorithm. In this paper we provide a new approach to solve the shortest path problems using unity partitions algorithm in C programme. We may apply this unitary partitions algorithm to find the shortest path in physical networks and social networks like road networks, railway networks, airline traffic networks, electrical networks and organizational charts, friendship networks, Interaction networks

Sign in / Sign up

Export Citation Format

Share Document