scholarly journals A distributed approach for shortest path algorithm in dynamic multimodal transportation networks

2017 ◽  
Vol 27 ◽  
pp. 294-300 ◽  
Author(s):  
Abdelfattah Idri ◽  
Mariyem Oukarfi ◽  
Azedine Boulmakoul ◽  
Karine Zeitouni ◽  
Ali Masri
Keyword(s):  
Shortest Path ◽  
Transportation Networks ◽  
Shortest Path Algorithm ◽  
Multimodal Transportation ◽  
Distributed Approach

scholarly journals A new time-dependent shortest path algorithm for multimodal transportation network

2017 ◽  
Vol 109 ◽  
pp. 692-697 ◽  
Author(s):  
Abdelfattah Idri ◽  
Mariyem Oukarfi ◽  
Azedine Boulmakoul ◽  
Karine Zeitouni ◽  
Ali Masri
Keyword(s):  
Shortest Path ◽  
Transportation Network ◽  
Time Dependent ◽  
Shortest Path Algorithm ◽  
Multimodal Transportation ◽  
New Time

Identifying Multiple and Reasonable Paths in Transportation Networks: A Heuristic Approach

1997 ◽  
Vol 1607 (1) ◽  
pp. 31-37 ◽  
Author(s):  
Dongjoo Park ◽  
Laurence R. Rilett
Keyword(s):  
Travel Time ◽  
Shortest Path ◽  
Heuristic Algorithms ◽  
Transportation Networks ◽  
Multiple Criteria Decision Making ◽  
Path Selection ◽  
Multiple Criteria ◽  
Transportation Engineering ◽  
Shortest Path Algorithm ◽  
Shortest Path Algorithms

A fundamental component of many transportation engineering applications is the identification of the route between a given origin and destination. Typically, some type of shortest-path algorithm is used for this task. However, shortest-path algorithms are only applicable when a single criterion, such as minimizing travel time, is used for path selection. When multiple criteria, such as the mean and variance of travel time, are used for path selection, then alternative-path identification methods must be found. The present objective is to develop an algorithm that can identify multiple and reasonable routes in transportation networks so that multiple-criteria decision-making techniques can be used in route selection. First, the definitions of single and multiple routes from a transportation engineering perspective are examined. It is indicated that although the traditional k-shortest-path algorithms can find routes with similar route travel times, the routes may be too similar with respect to the links used and consequently are not appropriate for certain transportation applications. A definition of a reasonable path is developed on the basis of transportation engineering rather than purely mathematical considerations. Two k-reasonable-path algorithms are then illustrated. These algorithms can be used to identify multiple and reasonable routes in transportation networks. Lastly, the two heuristic algorithms were tested on a network from Bryan to College Station, Texas, and the results were compared with the results obtained with a traditional k-shortest-path algorithm. It was found that the reasonable-path algorithms can identify routes that are similar in route travel time but significantly different in terms of the links used.

scholarly journals The shortest path algorithm performance comparison in graph and relational database on a transportation network

2014 ◽  
Vol 26 (1) ◽  
pp. 75-82 ◽  
Author(s):  
Mario Miler ◽  
Damir Medak ◽  
Dražen Odobašić
Keyword(s):  
Shortest Path ◽  
Road Network ◽  
Transportation Networks ◽  
Transportation Network ◽  
Database Systems ◽  
Performance Comparison ◽  
Graph Database ◽  
Shortest Path Algorithm ◽  
Algorithm Performance ◽  
Path Calculation

In the field of geoinformation and transportation science, the shortest path is calculated on graph data mostly found in road and transportation networks. This data is often stored in various database systems. Many applications dealing with transportation network require calculation of the shortest path. The objective of this research is to compare the performance of Dijkstra shortest path calculation in PostgreSQL (with pgRouting) and Neo4j graph database for the purpose of determining if there is any difference regarding the speed of the calculation. Benchmarking was done on commodity hardware using OpenStreetMap road network. The first assumption is that Neo4j graph database would be well suited for the shortest path calculation on transportation networks but this does not come without some cost. Memory proved to be an issue in Neo4j setup when dealing with larger transportation networks.

Sign in / Sign up

Export Citation Format

Share Document