Fuzzy programming technique for solving the shortest path problem on networks under triangular and trapezoidal fuzzy environment Online publication date: Wed, 19-Aug-2015
by Sathi Mukherjee
International Journal of Mathematics in Operational Research (IJMOR), Vol. 7, No. 5, 2015
Abstract: In this paper, a well-known problem called the shortest path problem (SPP) has been considered in an uncertain environment. The cost parameters for travelling each arc have been considered as triangular or trapezoidal fuzzy numbers (TFNs or TrFNs) which are the more generalised form of fuzzy numbers involving a lower limit and an upper limit. A methodology has been developed for solving the fuzzy shortest path problem (FSPP), which results in lowest cost solution corresponding to the minimum-cost path or the shortest path. In the proposed method, the FSPP has been written in the form of single-objective fuzzy linear programming problem with fuzzy costs, which has been transformed into a crisp multi-objective linear programming problem. This in turn has been solved by the well-known fuzzy programming technique. Comparisons of the proposed methodology with some latest researches in this field have been discussed. Numerical examples illustrate the effectiveness of the proposed method.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook