IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-030-57197-9_25.html
   My bibliography  Save this book chapter

Analyzing Shortest Path Problem via Single-Valued Triangular Neutrosophic Numbers: A Case Study

In: Neutrosophic Operational Research

Author

Listed:
  • Gözde Koca

    (Bilecik Şeyh Edebali University)

  • Ezgi Demir

    (Piri Reis University)

  • Özgür İcan

    (Ondokuz Mayıs University)

  • Çağlar Karamaşa

    (Anadolu University)

Abstract

The shortest path problem as a core combinatorial problem in graph theory that can be applied in various fields such as project scheduling, routing, transportation, network, operation research, and computer science. The main objective of this problem is to find the path having minimum length between any pair of nodes (or vertices). In this study an algorithm was applied in order to find the shortest path having single-valued triangular neutrosophic numbers via score function. A real case study was introduced and solved by this algorithm for the purpose of showing the applicability in real-world problems.

Suggested Citation

  • Gözde Koca & Ezgi Demir & Özgür İcan & Çağlar Karamaşa, 2021. "Analyzing Shortest Path Problem via Single-Valued Triangular Neutrosophic Numbers: A Case Study," Springer Books, in: Florentin Smarandache & Mohamed Abdel-Basset (ed.), Neutrosophic Operational Research, pages 559-573, Springer.
    • Handle: RePEc:spr:sprchp:978-3-030-57197-9_25
    DOI: 10.1007/978-3-030-57197-9_25
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:sprchp:978-3-030-57197-9_25. 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: 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.