IDEAS home Printed from https://ideas.repec.org/a/igg/jfsa00/v9y2020i2p132-161.html
   My bibliography  Save this article

A Different Approach for Solving the Shortest Path Problem Under Mixed Fuzzy Environment

Author

Listed:
  • Ranjan Kumar

    (National Institute of Technology, Jamshedpur)

  • Sripati Jha

    (National Institute of Technology, Jamshedpur, India)

  • Ramayan Singh

    (National Institute of Technology, Jamshedpur)

Abstract

The authors present a new algorithm for solving the shortest path problem (SPP) in a mixed fuzzy environment. With this algorithm, the authors can solve the problems with different sets of fuzzy numbers e.g., normal, trapezoidal, triangular, and LR-flat fuzzy membership functions. Moreover, the authors can solve the fuzzy shortest path problem (FSPP) with two different membership functions such as normal and a fuzzy membership function under real-life situations. The transformation of the fuzzy linear programming (FLP) model into a crisp linear programming model by using a score function is also investigated. Furthermore, the shortcomings of some existing methods are discussed and compared with the algorithm. The objective of the proposed method is to find the fuzzy shortest path (FSP) for the given network; however, this is also capable of predicting the fuzzy shortest path length (FSPL) and crisp shortest path length (CSPL). Finally, some numerical experiments are given to show the effectiveness and robustness of the new model. Numerical results show that this method is superior to the existing methods.

Suggested Citation

  • Ranjan Kumar & Sripati Jha & Ramayan Singh, 2020. "A Different Approach for Solving the Shortest Path Problem Under Mixed Fuzzy Environment," International Journal of Fuzzy System Applications (IJFSA), IGI Global, vol. 9(2), pages 132-161, April.
    • Handle: RePEc:igg:jfsa00:v:9:y:2020:i:2:p:132-161
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJFSA.2020040106
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jfsa00:v:9:y:2020:i:2:p:132-161. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.