Shortest Path Computation in a Network with Multiple Destinations

The shortest path problem is the problem of finding a path with minimum total weight from a source node to each destination node in a network. The existing solution to this fundamental problem searches the shortest paths to all network nodes until it meets the given multiple-destination nodes. By gr...

Full description

Saved in:
Bibliographic Details
Published in:Arabian journal for science and engineering (2011) 2020-04, Vol.45 (4), p.3223-3231
Main Authors: Sepehrifar, Mohammad K., Fanian, Ali, Sepehrifar, Mohammad B.
Format: Article
Language:English
Subjects:
Algorithms
Computer simulation
Engineering
Humanities and Social Sciences
multidisciplinary
Nodes
Research Article-Computer Engineering and Computer Science
Science
Shortest-path problems
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The shortest path problem is the problem of finding a path with minimum total weight from a source node to each destination node in a network. The existing solution to this fundamental problem searches the shortest paths to all network nodes until it meets the given multiple-destination nodes. By granting preference to routes to each destination node, the proposed algorithm meets the destination nodes faster. The results of the experimental analysis on a real-world dataset and simulated random networks show the superiority of the proposed algorithm to the existing solution. This remarkable improvement makes the proposed algorithm applicable in all related applications.
ISSN:2193-567X
1319-8025
2191-4281
DOI:10.1007/s13369-020-04340-w