2013
DOI: 10.1061/(asce)cp.1943-5487.0000220
|View full text |Cite
|
Sign up to set email alerts
|

Finding All-Pairs Shortest Path for a Large-Scale Transportation Network Using Parallel Floyd-Warshall and Parallel Dijkstra Algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0
2

Year Published

2015
2015
2023
2023

Publication Types

Select...
5
5

Relationship

0
10

Authors

Journals

citations
Cited by 51 publications
(18 citation statements)
references
References 23 publications
0
12
0
2
Order By: Relevance
“…The intermediate node is selected in accordance with certain route strategy. Inspired by the idea of OpenFlow in Soft-Defined Networks, in this paper, the route table is centrally derived by using the Floyd-Warshall algorithm [36]. The object function is the overall weighted shortest path from the source to receiver, and the weight of the path is the number of datasets waiting in the node buffer.…”
Section: Data Transmission Analysis In Cyber Layermentioning
confidence: 99%
“…The intermediate node is selected in accordance with certain route strategy. Inspired by the idea of OpenFlow in Soft-Defined Networks, in this paper, the route table is centrally derived by using the Floyd-Warshall algorithm [36]. The object function is the overall weighted shortest path from the source to receiver, and the weight of the path is the number of datasets waiting in the node buffer.…”
Section: Data Transmission Analysis In Cyber Layermentioning
confidence: 99%
“…In addition, in most cases, the formulation from a real-world network is NPhard [31] which is not feasible for mathematical methods. To solve these NP-hard problems, heuristic methods were introduced to obtain a near optimum solution [32][33][34]. These two kinds of solution methods can effectively solve FBNDP for networks under certain size threshold.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The distances between the towns will change following the decommissioning of certain bridges. Using the Warshall-Floyd algorithm, this study successively calculates the shortest distances between two towns whenever a bridge is decommissioned (Floyd 1962;Pradhan 2013;Wang 2014;Warshall 1962). STEP 9: Calculating the demographic energy for the overall network from town populations and distances.…”
Section: 2mentioning
confidence: 99%