IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v22y2022i4d10.1007_s12351-022-00693-2.html
   My bibliography  Save this article

Solving the shortest path problem on networks with fuzzy arc lengths using the complete ranking method

Author

Listed:
  • Tina Verma

    (Thapar Institute of Engineering and Technology)

Abstract

The fuzzy shortest path problem provides the shortest way to the decision-maker having least possible distance from source to destination. Niroomand et al. (Oper Res 17:395–411, 2017) recently advanced a method for solving the fuzzy shortest path problem. They divided the problem into two sub-problems and solved them separately. They asserted that their method always meets a unique upper and lower bound on the fuzzy shortest distance from source to destination for each $$\alpha$$ α . The proposed study focuses on a significant omission in Niroomand et al. method. The flaws in their approach stem from not clearly revealing the solution concept for the shortest path problem. The flaws of their approach are addressed in this study, and new approaches are proposed to overcome these flaws. The proposed approaches use the complete ranking method to solve the fuzzy shortest path problem. The proposed approaches ensure that the fuzzy shortest distance is equal among all possible shortest paths. The proposed research is carried out using numerical examples of fuzzy shortest path problems. The computational results of proposed approaches are compared to existing methods.

Suggested Citation

  • Tina Verma, 2022. "Solving the shortest path problem on networks with fuzzy arc lengths using the complete ranking method," Operational Research, Springer, vol. 22(4), pages 3607-3631, September.
    • Handle: RePEc:spr:operea:v:22:y:2022:i:4:d:10.1007_s12351-022-00693-2
    DOI: 10.1007/s12351-022-00693-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-022-00693-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12351-022-00693-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Sadegh Niroomand & Ali Mahmoodirad & Ahmad Heydari & Fatemeh Kardani & Abdollah Hadi-Vencheh, 2017. "An extension principle based solution approach for shortest path problem with fuzzy arc lengths," Operational Research, Springer, vol. 17(2), pages 395-411, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Tanveen Kaur Bhatia & Amit Kumar & Srimantoorao S. Appadoo & Yuvraj Gajpal & Mahesh Kumar Sharma, 2021. "Mehar Approach for Finding Shortest Path in Supply Chain Network," Sustainability, MDPI, vol. 13(7), pages 1-14, April.

    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:spr:operea:v:22:y:2022:i:4:d:10.1007_s12351-022-00693-2. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.