Loading article...
Loading article...
Stream/Area:
-
Subject:
-
Paper ID:
10.55041/IJSREM27478
Volume:
7 |
12 |
Dec 2023
Pages:
Publication Frequency:
Monthly (12 issues per year)
License:International Journal of Scientific Research in Engineering and Management follows the Creative Commons Attribution 4.0 (CC BY 4.0) License, allowing free use and distribution with proper attribution.
Shortest path for crisp numbers can be found efficiently using the Dijkstra’s algorithm. There are some uncertain conditions in the environment which introduces a fuzzy number for the distances between two nodes. A classical Dijkstra algorithm is modified to fuzzy Dijkstra algorithm to address the problem. Graded mean integration is used to enhance the algorithm by calculating and comparing the path length between two nodes when the arc length is fuzzy. A sample network is shown to understand the shortest path for fuzzy numbers.
KEYWORDS
Publication Date
12/11/2023
Peer Review Type
Double-Blind Peer Review
Review Rounds: 2
Documents
Article Views
0
Total views since publication
PDF Downloads
1
Total downloads since publication
Geographic Reach
5
Digital Preservation: This article is permanently archived on Zenodo and complies with all data preservation standards across major indexing platforms.
Plagiarism Screening
This manuscript has been checked for plagiarism using TurnitinPlagiarismChecker software.
Conflict of Interest
The authors declare no conflict of interest related to this research work.
Funding Information
No funding information available for this research.
Related research in the same subject area
Loading similar articles...