Single-source shortest paths in the CONGEST model with improved bounds

2021 ◽  
Author(s):  
Shiri Chechik ◽  
Doron Mukhtar
Keyword(s):  
Shortest Paths ◽  
Single Source

Computing single source shortest paths using single-objective fitness

2009 ◽  
Author(s):  
Surender Baswana ◽  
Somenath Biswas ◽  
Benjamin Doerr ◽  
Tobias Friedrich ◽  
Piyush P. Kurur ◽  
...  
Keyword(s):  
Shortest Paths ◽  
Single Source ◽  
Single Objective

How to Employ Reverse Search in Distributed Single Source Shortest Paths

2001 ◽  
pp. 191-200 ◽  
Author(s):  
Luboš Brim ◽  
Ivana Černá ◽  
Pavel Krčál ◽  
Radek Pelánek
Keyword(s):  
Shortest Paths ◽  
Single Source

scholarly journals A Forward-Backward Single-Source Shortest Paths Algorithm

2015 ◽  
Vol 44 (3) ◽  
pp. 698-739
Author(s):  
David B. Wilson ◽  
Uri Zwick
Keyword(s):  
Shortest Paths ◽  
Single Source

scholarly journals A hybrid technique for single-source shortest path-based on A* algorithm and ant colony optimization

2020 ◽  
Vol 9 (2) ◽  
pp. 356
Author(s):  
Sameer Alani ◽  
Atheer Baseel ◽  
Mustafa Maad Hamdi ◽  
Sami Abduljabbar Rashid
Keyword(s):  
Ant Colony Optimization ◽  
Shortest Path ◽  
Shortest Paths ◽  
Ant Colony ◽  
Fast Time ◽  
Hybrid Technique ◽  
Single Source ◽  
A Algorithm ◽  
A New Technique

<span lang="EN-US">In the single-source shortest path (SSSP) problem, the shortest paths from a source vertex v to all other vertices in a graph should be executed in the best way. A common algorithm to solve the (SSSP) is the A* and Ant colony optimization (ACO). However, the traditional A* is fast but not accurate because it doesn’t calculate all node's distance of the graph. Moreover, it is slow in path computation. In this paper, we propose a new technique that consists of a hybridizing of A* algorithm and ant colony optimization (ACO). This solution depends on applying the optimization on the best path. For justification, the proposed algorithm has been applied to the parking system as a case study to validate the proposed algorithm performance. First, A*algorithm generates the shortest path in fast time processing. ACO will optimize this path and output the best path. The result showed that the proposed solution provides an average decreasing time performance is 13.5%.</span>

Sign in / Sign up

Export Citation Format

Share Document