Computation of Shortest Path in a Fuzzy Network: Case Study with Rajasthan Roadways Network | Zendy

Pijus Kanti De | Zendy; Amita Bhinchar | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Computation of Shortest Path in a Fuzzy Network: Case Study with Rajasthan Roadways Network

Author(s) -

Pijus Kanti De,

Amita Bhinchar

Publication year - 2010

Publication title -

international journal of computer applications

Language(s) - English

Resource type - Journals

ISSN - 0975-8887

DOI - 10.5120/1633-2195

Subject(s) - computer science , computation , shortest path problem , path (computing) , fuzzy logic , operations research , computer network , artificial intelligence , theoretical computer science , algorithm , mathematics , graph

paper propose a shortest path problem with fuzzy parameters in the domain of Operations Research which is based on Bellman Dynamic Programming algorithm. Attention has been paid to the study of fuzzy network with topological ordering.. Here we discuss the shortest path problem from a specified vertex to all other vertices in a network. For illustration a real life example has been considered from Rajasthan State Roadways Transport Network.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research