A mean-time comparison of algorithms for the all-pairs shortest-path problem with arbitrary arc lengths

Networks ◽  
1978 ◽  
Vol 8 (2) ◽  
pp. 97-106 ◽  
Author(s):  
W. D. Kelton ◽  
A. M. Law
2016 ◽  
Vol 17 (2) ◽  
pp. 395-411 ◽  
Author(s):  
Sadegh Niroomand ◽  
Ali Mahmoodirad ◽  
Ahmad Heydari ◽  
Fatemeh Kardani ◽  
Abdollah Hadi-Vencheh

2020 ◽  
Vol 39 (5) ◽  
pp. 7653-7656
Author(s):  
Ranjan Kumar ◽  
SA Edalatpanah ◽  
Hitesh Mohapatra

There are different conditions where SPP play a vital role. However, there are various conditions, where we have to face with uncertain parameters such as variation of cost, time and so on. So to remove this uncertainty, Yang et al. [1] “[Journal of Intelligent & Fuzzy Systems, 32(1), 197-205”] have proposed the fuzzy reliable shortest path problem under mixed fuzzy environment and claimed that it is better to use their proposed method as compared to the existing method i.e., “[Hassanzadeh et al.; A genetic algorithm for solving fuzzy shortest path problems with mixed fuzzy arc lengths, Mathematical and Computer Modeling, 57(2013) 84-99” [2]]. The aim of this note is, to highlight the shortcoming that is carried out in Yang et al. [1] article. They have used some mathematical incorrect assumptions under the mixed fuzzy domain, which is not true in a fuzzy environment.


Sign in / Sign up

Export Citation Format

Share Document