Abstract
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. Key Words: dijkstra’s algorithm, fuzzy numbers, graded mean integration
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: INTERANTIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
