Dijkstra’s algorithm for shortest path problem under hesitant fuzzy environment using different operator

Abstract

Hesitant fuzzy set theory is a branch of fuzzy set theory that uses new measures to address uncertainty in shortest path problems. In this paper, we propose a generalized version of Dijkstra's algorithm from source node to destination node for scenarios where each edge has an associated hesitant fuzzy number as its cost. The Bonferroni mean (BM) is indeed a useful tool in multi-criteria decision-making (MCDM) because it effectively captures the interrelationships among different criteria or arguments. We introduce a modified hesitant fuzzy Dijkstra's algorithm (MHFDA) to address hesitant fuzzy shortest path problems (HFSPP). This algorithm utilizes hesitant fuzzy Bonferroni means (HFBM) and hesitant fuzzy weighted geometric operators (HFWG) to find the solution.