TY  - JOUR
T1  - An Efficient Multiple Sources Single-Destination (MSSD) Heuristic Algorithm Using Nodes Exclusions
AU - Arman, Nabil AU - Khamayseh, Faisal 
JO  - International Journal of Soft Computing
VL  - 10
IS  - 5
SP  - 301
EP  - 306
PY  - 2015
DA  - 2001/08/19
SN  - 1816-9503
DO  - ijscomp.2015.301.306
UR  - https://makhillpublications.co/view-article.php?doi=ijscomp.2015.301.306
KW  - Shortest path
KW  -communication network
KW  -graph
KW  -multiple sources single-destination
KW  -candidate subgraphs
KW  -node exclusions
AB  - The problem of identifying the best paths between given set of nodes and a given single-destination in a graph of vertices is commonly referred to as network multiple sourcessingle-destination problems. In real life researchers always find themselves in a critical situation in which they seek the nearest set of related points such as the urgent need for fire stations. This study describes, the problem and proposesan algorithm for finding the shortest paths between the set of sources &lt;s<SUB>i</SUB>&gt; and a single-destination &lt;t&gt; given that &lt;s<SUB>i</SUB>&gt; and &lt;t&gt;&isin; weighted graph G(V, E, w) with vertex set V and arc set E associated with nonnegative real valued weight. An efficient algorithm is developed based on different graph representations. The proposed heuristic determines a candidate subgraph G' and excludes all nodes that do not lead to destination. The proposed algorithm improves partially the performance of improved traditional shortest path algorithms, i.e., Dijkstra&#146; algorithm. This is shown obviously by applying the algorithm on set of random graphs.
ER  -