Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment

2012 ◽  
Vol 12 (3) ◽  
pp. 1231-1237 ◽  
Author(s):  
Yong Deng ◽  
Yuxin Chen ◽  
Yajuan Zhang ◽  
Sankaran Mahadevan
2014 ◽  
Vol 596 ◽  
pp. 861-867 ◽  
Author(s):  
Yu Qiang Li ◽  
Yu Wen Li ◽  
Lei Che

Services composing have played an important role in the industry and academia in recent years. Based on the relevant theory and experience of the shortest path problem in a DAG, we propose the method of dijkstra algorithm implementing services composing way selection. Then we provide the pseudo code description of the algorithm implementing the optimal path selecting process and test the correctness of algorithm through the contrast experiment to offer a feasible solution for services composing way selection.


Author(s):  
Samir Dey ◽  
Sriza Malakar ◽  
Shibnath Rajak

Dijkstra algorithm is a widely used algorithm to find the shortest path between two specified nodes in a network problem. In this paper, a generalized fuzzy Dijkstra algorithm is proposed to find the shortest path using a new parameterized defuzzification method. Here, we address most important issue like the decision maker’s choice. A numerical example is used to illustrate the efficiency of the proposed algorithm.


IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 154414-154423
Author(s):  
Ke Wei Jie ◽  
Gao Chang Zhao ◽  
Xiao Jun Sun

Sign in / Sign up

Export Citation Format

Share Document