scholarly journals Performance of shortest path algorithm based on parallel vertex traversal

2016 ◽  
Vol 13 (1) ◽  
pp. 31-43 ◽  
Author(s):  
Mihailo Vesovic ◽  
Aleksandra Smiljanic ◽  
Dusan Kostic
Keyword(s):  
Shortest Path ◽  
Multicore Processors ◽  
Vlsi Design ◽  
Efficient Algorithms ◽  
Shortest Path Algorithm ◽  
Internet Routing ◽  
Shortest Path Problems ◽  
Shortest Path Algorithms ◽  
Natural Way ◽  
Standard Solutions

Shortest path algorithms for different applications, such as Internet routing, VLSI design and so on are used. Dijkstra and Bellman-Ford are commonly used shortest path algorithms which are typically implemented in networks with hundreds of nodes. However, scale of shortest path problems is increasing, and more efficient algorithms are needed. With the development of multicore processors, one natural way to speedup shortest path algorithms is through parallelization. In this paper, we propose a novel shortest path algorithm with parallel vertex transversal, and compare its speed with standard solutions in datacenter topologies.

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.

Experimental Study of Dynamic Single-Source Shortest Path Algorithm

2011 ◽  
Vol 58-60 ◽  
pp. 1493-1498
Author(s):  
Qian Cai Xiao ◽  
Ming Qi Li ◽  
Wen Qiang Guo
Keyword(s):  
Shortest Path ◽  
Single Source ◽  
Shortest Path Algorithm ◽  
Time Efficiency ◽  
Dynamic Algorithms ◽  
Dynamic Topology ◽  
Shortest Path Algorithms ◽  
Relationship Of ◽  
The Relationship ◽  
Better Than

In this paper, software Inet 3.0 is applied to generate topology, which randomly generates dynamic topology nodes. Based on dynamic shortest path algorithms put forward by P.Narvaez, Xiaobin et al, we analyzed the time efficiency of dynamic and static shortest path algorithms, the different time efficiency inner dynamic shortest path algorithms, and the relationship of time efficiency between topology and dynamic shortest path algorithms. The result shows that Xiaobin algorithm is statistically better than Narvaez algorithm about 20-30 percent. Dynamic algorithms are not always better than static algorithms considering the amount of changed topology. Dynamic and static algorithms are roughly same when the amount of changed topology holds 10 percent. Dynamic algorithms perform better when less than 10 percent, otherwise static algorithms will be better. The time efficiency of dynamic algorithms is related to special topology.

Utilizing Restricted Direction Strategy and Binary Heap Technology to Optimize Dijkstra Algorithm in WebGIS

2009 ◽  
Vol 419-420 ◽  
pp. 557-560 ◽  
Author(s):  
Rui Li
Keyword(s):  
Shortest Path ◽  
Operating Efficiency ◽  
Dijkstra Algorithm ◽  
Shortest Path Algorithm ◽  
Research Focus ◽  
Network Information ◽  
The Core ◽  
Highway Network ◽  
Core Issue ◽  
Storage Structures

Shortest path is the core issue in application of WebGIS. Improving the efficiency of the algorithm is an urgent requirement to be resolved at present. By the lossy algorithm analyzing, which is the current research focus of the shortest path algorithm to optimize, utilizing adjacency table of storage structures, restricted direction strategy and binary heap technology to optimize the algorithm, thereby reduce the scale of algorithm to improve the operating efficiency of algorithm. This scheme has been applied in the simulation of the data downloaded from the Guangdong Provincial Highway Network Information System and satisfactory results have been obtained.

Sign in / Sign up

Export Citation Format

Share Document