Fuzzy Shortest Path Problem Based on Index Ranking

S. Elizabeth, L. Sujatha

Abstract


The Shortest path problem is a classical network optimisation
problem which has wide range of applications in various fields. In
this work, we study the task of finding the shortest path in fuzzy
weighted graph (network) i.e., vertices remains crisp, but the edge
weights will be of fuzzy numbers. It has been proposed to present
new algorithms for finding the shortest path in fuzzy sense where
illustrative examples are also included to demonstrate our proposed
approach.

Full Text: PDF DOI: 10.5539/jmr.v3n4p80

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

Journal of Mathematics Research   ISSN 1916-9795 (Print)   ISSN 1916-9809 (Online)

Copyright © Canadian Center of Science and Education

To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.

----------------------------------------------------------------------------------------------------------------------------------------------------------------------

doaj_logo_new_120 proquest_logo_120images_120.