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 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.

[1]  Nabil Arman,et al.  A Path-Compression Approach for Improving Shortest-Path Algorithms , 2015 .

[2]  Dorothea Wagner,et al.  Speed-Up Techniques for Shortest-Path Computations , 2007, STACS.

[3]  Wang Shu-xi,et al.  Improved Dijkstra Shortest Path Algorithm and its Application , 2012 .

[4]  Zixing Cai,et al.  A Fast Isomap Algorithm Based on Fibonacci Heap , 2015, ICSI.

[5]  Jon Larizgoitia Burgaña.  Design and evaluation of a link-state routing protocol for Internet-Wide Geocasting , 2017 .

[6]  Vincent S. Tseng,et al.  Efficient Multi-Destinations Route Planning with Deadlines and Cost Constraints , 2017, 2017 18th IEEE International Conference on Mobile Data Management (MDM).

[7]  Giuseppe F. Italiano,et al.  The Quest for the Shortest Route , 2013, The Power of Algorithms.

[8]  Richard L. Church,et al.  Finding shortest paths on real road networks: the case for A* , 2009, Int. J. Geogr. Inf. Sci..

[9]  John MacCormick,et al.  What Can Be Computed?: A Practical Guide to the Theory of Computation , 2018 .

[10]  Torsten Suel,et al.  Estimating pairwise distances in large graphs , 2014, 2014 IEEE International Conference on Big Data (Big Data).

[11]  K. Bharath-Kumar,et al.  Routing to Multiple Destinations in Computer Networks , 1983, IEEE Trans. Commun..

[12]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[13]  Jeremy G. Siek,et al.  The Boost Graph Library - User Guide and Reference Manual , 2001, C++ in-depth series.

[14]  Ugochi A. Okengwu,et al.  Modified Dijkstra Algorithm with Invention Hierarchies Applied to a Conic Graph , 2015, ArXiv.

[15]  K. Subramani,et al.  A faster algorithm for the single source shortest path problem with few distinct positive lengths , 2010, J. Discrete Algorithms.

[16]  Y. Q. Liu,et al.  An improved Dijkstra's shortest path algorithm for sparse network , 2007, Appl. Math. Comput..

[17]  Deying Li,et al.  Priority-Oriented Route Network Planning for Evacuation in Constrained Space Scenarios , 2019, J. Optim. Theory Appl..

[18]  Kamran Zamanifar,et al.  AN ALGORITHM TO SELECT THE OPTIMAL COMPOSITION OF THE SERVICES , 2009 .

[19]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[20]  Ahmed M Kasem.  Heuristic Approaches for Survivable Network Optimization , 2015 .

[21]  Rui Yang,et al.  Path Optimization Study for Vehicles Evacuation based on Dijkstra Algorithm , 2014 .

[22]  Xin Lu,et al.  Finding the shortest paths by node combination , 2011, Appl. Math. Comput..

[23]  Mikkel Thorup,et al.  Undirected single-source shortest paths with positive integer weights in linear time , 1999, JACM.

[24]  Jens Vygen,et al.  A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing , 2009, J. Discrete Algorithms.

[25]  Mikkel Thorup,et al.  On RAM priority queues , 1996, SODA '96.

[26]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[27]  Hai Jiang,et al.  Finding the K shortest paths in a time-schedule network with constraints on arcs , 2013, Comput. Oper. Res..

[28]  Andreas Kalaitzakis,et al.  Comparative study of community detection algorithms in social networks. , 2012 .

[29]  Jili Yan.  Enhanced global congestion awareness (EGCA) for load balance in networks-on-chip , 2015, The Journal of Supercomputing.

[30]  Anis Koubaa,et al.  Relaxed Dijkstra and A* with linear complexity for robot path planning problems in large-scale grid environments , 2016, Soft Comput..

[31]  Vachik S. Dave,et al.  TopCom: Index for Shortest Distance Query in Directed Graph , 2015, DEXA.

[32]  Wang Shu-xi,et al.  The Improved Dijkstra's Shortest Path Algorithm and Its Application , 2012 .

[33]  Thomas H. Cormen,et al.  Algorithms Unlocked , 2013 .

[34]  Jens Vygen,et al.  The Book Review Column1 , 2020, SIGACT News.

[35]  Nathan R. Sturtevant,et al.  MM: A bidirectional search algorithm that is guaranteed to meet in the middle , 2017, Artif. Intell..

[36]  Wendi B. Heinzelman,et al.  RBMulticast: Receiver Based Multicast for Wireless Sensor Networks , 2009, 2009 IEEE Wireless Communications and Networking Conference.

[37]  Jure Leskovec,et al.  {SNAP Datasets}: {Stanford} Large Network Dataset Collection , 2014 .

[38]  Yancong Zhou,et al.  Disordered and Multiple Destinations Path Planning Methods for Mobile Robot in Dynamic Environment , 2016, J. Electr. Comput. Eng..

[39]  Dorothea Wagner,et al.  Combining speed-up techniques for shortest-path computations , 2004, JEAL.