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

Gözde Koca (), Ezgi Demir (), Özgür İcan () and Çağlar Karamaşa ()
Additional contact information
Gözde Koca: Bilecik Şeyh Edebali University
Ezgi Demir: Piri Reis University
Çağlar Karamaşa: Anadolu University

A chapter in Neutrosophic Operational Research, 2021, pp 559-573 from Springer

Abstract: 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.

Keywords: Shortest path problem; Score function; Single-valued triangular neutrosophic numbers; Project management (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-030-57197-9_25

Ordering information: This item can be ordered from
http://www.springer.com/9783030571979

DOI: 10.1007/978-3-030-57197-9_25

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().