Skip to main content
SpringerLink
Log in

Shortest Path Computation in a Network with Multiple Destinations

  • Research Article-Computer Engineering and Computer Science
  • Published:
Arabian Journal for Science and Engineering Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Adapted from [21]

Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Adamatzky, A.: Shortest Path Solvers. From Software to Wetware, vol. 32. Springer, Berlin (2018)

    Book  Google Scholar 

  2. Cormen, T.H.: Algorithms Unlocked. The MIT Press, Cambridge (2013)

    MATH  Google Scholar 

  3. Kalaitzakis, A.: Comparative study of community detection algorithms in social networks. Master’s thesis, Technological Educational Institute of Crete (2012)

  4. Bharath-Kumar, K.; Jaffe, J.: Routing to multiple destinations in computer networks. IEEE Trans. Commun. 31, 343–351 (1983)

    Article  Google Scholar 

  5. Larizgoitia Burgaña, J.: Design and evaluation of a link-state routing protocol for Internet-wide geocasting. Master’s thesis, University of Twente (2017)

  6. Dong, Y.F.; Xia, H.M.; Zhou, Y.C.: Disordered and multiple destinations path planning methods for mobile robot in dynamic environment. J. Electri. Comput. Eng. 2016, 1–10 (2016)

    Google Scholar 

  7. Huang, Y.; Lin, B.H.; Tseng, V.S.: Efficient multi-destinations route planning with deadlines and cost constraints. In: Lee, K. (ed.) 18th IEEE International Conference on Mobile Data Management (MDM), pp. 228–233 (2017)

  8. Sepehrifar, M.K.; Zamanifar, K.; Sepehrifar, M.B.: An algorithm to select the optimal composition of the services. J. Theor. Appl. Inf. Technol. 8, 154–161 (2009)

    Google Scholar 

  9. Korte, B.; Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 6th edn. Springer, Berlin (2018)

    Book  Google Scholar 

  10. Ticha, H.B.; Absi, N.; Feillet, D.; Quilliot, A.: A solution method for the multi-destination bi-objectives shortest path problem. Tech. Rep., Ecole des Mines de Saint Etienne, CMP, Gardanne, France (2017)

  11. Christoforaki, M.; Suel, T.: Estimating pairwise distances in large graphs. In: IEEE International Conference on Big Data (Big Data), pp. 335–344, IEEE (2014)

  12. Dave, V.S.; Al Hasan, M.: TopCom: index for shortest distance query in directed graph. In: International Conference on Database and Expert Systems Applications, pp. 471–480. Springer, Berlin (2015)

  13. Holte, R.C.; Felner, A.; Sharon, G.; Sturtevant, N.R.; Chen, J.: MM: a bidirectional search algorithm that is guaranteed to meet in the middle. Artif. Intell. 252, 232–266 (2017)

    Article  MathSciNet  Google Scholar 

  14. Arman, N.; Khamayseh, F.: A path-compression approach for improving shortest-path algorithms. Int. J. Electr. Comput. Eng. 5, 772–781 (2015)

    Google Scholar 

  15. Hashim, M.B.: A New Algorithm and Data Structures for the All Pairs Shortest Path Problem. PhD thesis, University of Canterbury (2013)

  16. Wagner, D.; Willhalm, T.: Speed-up techniques for shortest-path computations. In: Thomas, W., Weil, P. (eds.) Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp. 23–36. Springer, Berlin (2007)

  17. Shu-Xi, W.: The improved Dijkstra’s shortest path algorithm and its application. In: Guo, H. (ed.) International Workshop on Information and Electronics Engineering, vol. 29 of Procedia Engineering, pp. 1186–1190. Elsevier (2012)

  18. Peyer, S.; Rautenbach, D.; Vygen, J.: A generalization of Dijkstra’s shortest path algorithm with applications to VLSI routing. J. Discrete Algorith. 7, 377–390 (2009)

    Article  MathSciNet  Google Scholar 

  19. Zeng, W.; Church, R.L.: Finding shortest paths on real road networks: the case for A*. Int. J. Geogr. Inf. Sci. 23(4), 531–543 (2009)

    Article  Google Scholar 

  20. Demetrescu, C.; Italiano, G.F.: The quest for the shortest route. In: Ausiello, G., Petreschi, R. (eds.) The Power of Algorithms: Inspiration and Examples in Everyday Life. Springer, Berlin (2013)

    Google Scholar 

  21. Cormen, T.H.; Leiserson, C.E.; Rivest, R.L.; Stein, C.: Introduction to Algorithms. The MIT Press, Cambridge (2009)

    MATH  Google Scholar 

  22. Kasem, A.: Heuristic Approaches for Survivable Network Optimization. PhD thesis, University of Alberta (2015)

  23. Fredman, M.L.; Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. Assoc. Comput. Mach. 34, 596–615 (1987)

    Article  MathSciNet  Google Scholar 

  24. Qu, T.; Cai, Z.: A fast isomap algorithm based on Fibonacci heap. In: Tan, Y., Shi, Y., Buarque, F., Gelbukh, A., Das, S., Engelbrecht, A. (eds.) Advances in Swarm and Computational Intelligence, pp. 225–231. Springer, Berlin (2015)

    Chapter  Google Scholar 

  25. Lu, X.; Camitz, M.: Finding the shortest paths by node combination. Appl. Math. Comput. 217(13), 6401–6408 (2011)

    MathSciNet  MATH  Google Scholar 

  26. Xu, M.; Liu, Y.; Huang, Q.; Zhang, Y.; Luan, G.: An improved Dijkstra’s shortest path algorithm for sparse network. Appl. Math. Comput. 185(1), 247–254 (2007)

    MathSciNet  MATH  Google Scholar 

  27. Orlin, J.B.; Madduri, K.; Subramani, K.; Williamson, M.: A faster algorithm for the single source shortest path problem with few distinct positive lengths. J. Discrete Algorithms 8(2), 189–198 (2010)

    Article  MathSciNet  Google Scholar 

  28. Thorup, M.: Undirected single-source shortest paths with positive integer weights in linear time. J. ACM 46, 362–394 (1999)

    Article  MathSciNet  Google Scholar 

  29. Thorup, M.: On RAM priority queues. SIAM J. Comput. 30(1), 86–109 (2000)

    Article  MathSciNet  Google Scholar 

  30. MacCormick, J.: What Can Be Computed?: A Practical Guide to the Theory of Computation. Princeton University Press, Princeton (2018)

    MATH  Google Scholar 

  31. Holzer, M.; Schulz, F.; Wagner, D.; Willhalm, T.: Combining speed-up techniques for shortest-path computations. J. Exp. Algorithm. 10, 2–5 (2005)

    Article  MathSciNet  Google Scholar 

  32. Chen, Y.Z.; Shen, S.F.; Chen, T.; Yang, R.: Path optimization study for vehicles evacuation based on Dijkstra algorithm. In: Yao, H. (ed.) Procedia Engineering, vol. 71, pp. 159–165. Elsevier, Amsterdam (2014)

    Google Scholar 

  33. Madkour, A.; Aref, W.G.; Rehman, F.U.; Rahman, M.A.; Basalamah, S.: A survey of shortest-path algorithms, arXiv preprint arXiv:1705.02044 (2017)

  34. Okengwu, U.A.; Nwachukwu, E.O.; Osegi, E.N.: Modified Dijkstra algorithm with invention hierarchies applied to a conic graph, arXiv preprint arXiv:1503.02517 (2015)

  35. Hong, Y.; Li, D.; Wu, Q.; Xu, H.: Priority-oriented route network planning for evacuation in constrained space scenarios. J. Optim. Theory Appl. 181(1), 279–297 (2019)

    Article  MathSciNet  Google Scholar 

  36. Jin, W.; Chen, S.; Jiang, H.: Finding the k shortest paths in a time-schedule network with constraints on arcs. Comput. Oper. Res. 40(12), 2975–2982 (2013)

    Article  MathSciNet  Google Scholar 

  37. Ananta, M.T.; Jiang, J.R.; Muslim, M.A.: Multicasting with the extended Dijkstra’s shortest path algorithm for software defined networking. Int. J. Appl. Eng. Res. 9(23), 21017–21030 (2014)

    Google Scholar 

  38. Ammar, A.; Bennaceur, H.; Châari, I.; Koubâa, A.; Alajlan, M.: Relaxed Dijkstra and A* with linear complexity for robot path planning problems in large-scale grid environments. Soft Comput. 20(10), 4149–4171 (2016)

    Article  Google Scholar 

  39. Yan, J.: Enhanced global congestion awareness (EGCA) for load balance in networks-on-chip. J. Supercomput. 72(2), 567–587 (2016)

    Article  Google Scholar 

  40. Siek, J.G.; Lee, L.Q.; Lumsdaine, A.: The Boost Graph Library: User Guide and Reference Manual. Portable Documents. C++ In-Depth Series. Pearson Education, London (2001)

    Google Scholar 

  41. Bollobás, B.: Random Graphs. Cambridge Studies in Advanced Mathematics, 2nd edn. Cambridge, Cambridge University Press (2001)

    Book  Google Scholar 

  42. Feng, C.H.; Heinzelman, W.: RBMulticast: Receiver based multicast for wireless sensor networks. In: IEEE Wireless Communications and Networking Conference, pp. 1–6, IEEE (2009)

  43. Leskovec, J.; Krevl, A.: SNAP Datasets: Stanford large network dataset collection. http://snap.stanford.edu/data (2019)

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, 84156-83111, Iran

    Mohammad K. Sepehrifar & Ali Fanian

  2. Department of Mathematics and Statistics, Mississippi State University, Mississippi State, MS, 39762, USA

    Mohammad B. Sepehrifar

Authors
  1. Mohammad K. Sepehrifar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ali Fanian
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mohammad B. Sepehrifar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohammad B. Sepehrifar.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sepehrifar, M.K., Fanian, A. & Sepehrifar, M.B. Shortest Path Computation in a Network with Multiple Destinations. Arab J Sci Eng 45, 3223–3231 (2020). https://doi.org/10.1007/s13369-020-04340-w

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13369-020-04340-w

Keywords

Search

Navigation