Abstract
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.
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: International Journal of Computer Applications Technology and Research
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.
