Welcome to the InfoSci Platform
Reference Hub1
A Greedy Algorithm for Fuzzy Shortest Path Problem using Quasi-Gaussian Fuzzy Weights

A Greedy Algorithm for Fuzzy Shortest Path Problem using Quasi-Gaussian Fuzzy Weights

Madhushi Verma, K. K. Shukla
Copyright: © 2013 |Volume: 3 |Issue: 2 |Pages: 16
ISSN: 2156-177X|EISSN: 2156-1761|EISBN13: 9781466632806|DOI: 10.4018/ijfsa.2013040104
Cite Article Cite Article

MLA

Verma, Madhushi, and K. K. Shukla. "A Greedy Algorithm for Fuzzy Shortest Path Problem using Quasi-Gaussian Fuzzy Weights." IJFSA vol.3, no.2 2013: pp.55-70. http://doi.org/10.4018/ijfsa.2013040104

APA

Verma, M. & Shukla, K. K. (2013). A Greedy Algorithm for Fuzzy Shortest Path Problem using Quasi-Gaussian Fuzzy Weights. International Journal of Fuzzy System Applications (IJFSA), 3(2), 55-70. http://doi.org/10.4018/ijfsa.2013040104

Chicago

Verma, Madhushi, and K. K. Shukla. "A Greedy Algorithm for Fuzzy Shortest Path Problem using Quasi-Gaussian Fuzzy Weights," International Journal of Fuzzy System Applications (IJFSA) 3, no.2: 55-70. http://doi.org/10.4018/ijfsa.2013040104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Several algorithms exist to determine the shortest path in a network for the crisp case where the weights are real numbers. In the real world, these weights represent parameters like cost, packet arrival time, link capacity etc which are not naturally precise. To model the uncertainty involved, for the first time we use the Gaussian fuzzy numbers as weights and a method has been presented in this paper to determine the fuzzy shortest path. Gaussian membership functions are preferred over other membership functions (triangular and trapezoidal) that are easy to analyze because it is continuous and differentiable enabling efficient gradient based optimization and it is simpler to represent because it requires fewer parameters. The issue of performing fuzzy arithmetic operations to calculate the fuzzy shortest path length and the corresponding fuzzy shortest path in the network has been addressed and to tackle it the concept of decomposed fuzzy numbers has been used. Also, a greedy algorithm which is an extension of Dijkstra’s algorithm for fuzzy shortest path problem has been proposed.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.