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

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 Application of Pentagonal Neutrosophic Number in Shortest Path Problem

2020 ◽  
pp. 21-28
Author(s):  
Avishek Chakraborty ◽  
Keyword(s):  
Cost Function ◽  
Shortest Path ◽  
Score Function ◽  
Path Selection ◽  
Shortest Path Problem ◽  
Time Dependent ◽  
Accuracy Function ◽  
Shortest Path Algorithm ◽  
Human Kind ◽  
Neutrosophic Number

Real-human kind issues have distinct sort of ambiguity and among them; one of the critical troubles is solving the shortest path problem. In this contribution, we applied the developed score function and accuracy function of pentagonal neutrosophic number (PNN) into a shortage path selection problem. Further, a time dependent and heuristic cost function related shortest path algorithm is considered here in PNN area and solved it utilizing an influx of dissimilar rational pioneer thinking. Lastly, estimation of total ideal time of the graph reflects the importance of this noble work.

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