Abstract
Many real-world problems face a kind of uncertainty. One of these problems is finding the shortest path. Given that the distance between the two paths is often ambiguous. Therefore, in this article, we try to examine this problem in a hesitant fuzzy atmosphere. First, we provide a new distance to calculate the distance between two hesitant fuzzy sets, and then we try to solve it with the help of the Dijkstra algorithm. Finally, we present an example of the efficiency of our proposed method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Ahuja, R.K., Mehlhorn, K., Orlin, J., Tarjan, R.E.: Faster algorithms for the shortest path problem. J. ACM (JACM) 37(2), 213–223 (1990)
Akram, M., Adeel, A., Alcantud, J.C.R.: Hesitant fuzzy N-soft sets: a new model with applications in decision-making. J. Intell. Fuzzy Syst. 36(6), 6113–6127 (2019)
Arsham, H.: Stability analysis for the shortest path problems. Congressus Numerantium 171–210 (1998)
Bisht, K., Kumar, S.: Hesitant fuzzy set based computational method for financial time series forecasting. Granular Comput. 4(4), 655–669 (2018)
Broumi, S., Nagarajan, D., Bakali, A., Talea, M., Smarandache, F., Lathamaheswari, M.: The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment. Complex Intell. Syst. 5(4), 391–402 (2019)
Chanas, S., Kamburowski, J.: The fuzzy shortest route problem. In: Interval and fuzzy mathematics, Proceedings of Polish Symposium, Technical University of Poznan, Poznan, pp. 35–41 (1983)
Darehmiraki, M.: A novel parametric ranking method for intuitionistic fuzzy numbers. Iran. J. Fuzzy Syst. 16(1), 129–143 (2019)
Dubois, D., Parde, H.: Fuzzy Sets and Systems: Theory and Applications, vol. 144. Academic Press, New York (1980)
Liao, X., JiaYi, W., Li, M.: An algorithmic approach for finding the fuzzy constrained shortest paths in a fuzzy graph. Complex Intell. Syst. 1–11 (2020)
Roditty, L., Zwick, U.: On dynamic shortest paths problems. In: European Symposium on Algorithms. Springer, Heidelberg (2004)
Xu, Z.S., Xia, M.M.: Distance and similarity measures for hesitant fuzzy sets. Inf. Sci. 181, 2128–2138 (2011)
Xia, M., Xu, Z.: Hesitant fuzzy information aggregation in decision making. Inter. J. Approx. Reasoning 52(3), 395–407 (2011)
Yang, C.-D., Lee, D.-T., Wong, C.-K.: On bends and lengths of rectilinear paths: a graph-theoretic approach. Int. J. Comput. Geom. Appl. 2(01), 61–74 (1992)
Yager, R.R.: Paths of least resistance in possibilistic production systems. Fuzzy Sets Syst. 19(2), 121–132 (1986)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Darehmiraki, M. (2021). A New Solution for the Generalized Shortest Path Problem. In: Allahviranloo, T., Salahshour, S., Arica, N. (eds) Progress in Intelligent Decision Science. IDS 2020. Advances in Intelligent Systems and Computing, vol 1301. Springer, Cham. https://doi.org/10.1007/978-3-030-66501-2_26
Download citation
DOI: https://doi.org/10.1007/978-3-030-66501-2_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-66500-5
Online ISBN: 978-3-030-66501-2
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)