Calculation of Fuzzy shortest path problem using Multi-valued Neutrosophic number under fuzzy environment

The most well-known subject in graph theory is the shortest path problem (SPP), which has real-world applications in several different fields of study, including transportation, emergency services, network communications, fire station services, etc. The arc weights of the applicable SP problems are...

Full description

Saved in:
Bibliographic Details
Published inNeutrosophic sets and systems Vol. 57; pp. 356 - 369
Main Authors Raut, Prasanta Kumar, Behera, Siva Prasad, Broumi, Said, Mishra, Debdas
Format Journal Article
LanguageEnglish
Published Neutrosophic Sets and Systems 01.09.2023
University of New Mexico
Subjects
Online AccessGet full text
ISSN2331-6055
2331-608X
DOI10.5281/zenodo.8271401

Cover

Abstract The most well-known subject in graph theory is the shortest path problem (SPP), which has real-world applications in several different fields of study, including transportation, emergency services, network communications, fire station services, etc. The arc weights of the applicable SP problems are typically represented by fuzzy numbers in real-world applications. In this paper, we discussed the process of finding the shortest distance in a connected graph network in which the arc weights are multi-valued neutrosophic numbers (MNNs). Moreover, here we compare our method with some of the existing results and illustrate one implementation of our method with the help of one numerical example. Keywords: Directed graph network; Multi-valued neutrosophic numbers; selection sort technique; shortest path problem.
AbstractList The most well-known subject in graph theory is the shortest path problem (SPP), which has real-world applications in several different fields of study, including transportation, emergency services, network communications, fire station services, etc. The arc weights of the applicable SP problems are typically represented by fuzzy numbers in real-world applications. In this paper, we discussed the process of finding the shortest distance in a connected graph network in which the arc weights are multi-valued neutrosophic numbers (MNNs). Moreover, here we compare our method with some of the existing results and illustrate one implementation of our method with the help of one numerical example. Keywords: Directed graph network; Multi-valued neutrosophic numbers; selection sort technique; shortest path problem.
The most well-known subject in graph theory is the shortest path problem (SPP), which has real-world applications in several different fields of study, including transportation, emergency services, network communications, fire station services, etc. The arc weights of the applicable SP problems are typically represented by fuzzy numbers in real-world applications. In this paper, we discussed the process of finding the shortest distance in a connected graph network in which the arc weights are multi-valued neutrosophic numbers (MNNs). Moreover, here we compare our method with some of the existing results and illustrate one implementation of our method with the help of one numerical example.
Audience Academic
Author Mishra, Debdas
Raut, Prasanta Kumar
Behera, Siva Prasad
Broumi, Said
Author_xml – sequence: 1
  fullname: Raut, Prasanta Kumar
– sequence: 2
  fullname: Behera, Siva Prasad
– sequence: 3
  fullname: Broumi, Said
– sequence: 4
  fullname: Mishra, Debdas
BookMark eNo9kUtrwzAQhEVpoa9ce9YfSCpZliUfS2jaQh-XFnozK2mdKNhSkOVA8utr0lIWZodh-C5zTc5DDEjIHWcLWWh-f8QQXVzoQvGS8TNyVQjB5xXT3-f_XspLMhuGLWOMF7yWgl8Rv4TOjh1kHwONLV2Nx-OBDpuYMg6Z7iBv6C5F02FPx8GHNX0bu-zne-hGdPQdx5ziEHcbb2kYe4OJjsFN2p5AGPY-xdBjyLfkooVuwNnfvyFfq8fP5fP89ePpZfnwOndcyTwpMLRGOORVWShjNWhtHQOssazBlGi5sro0BXJnZSEqFKqqjQNljClB3JCXX66LsG12yfeQDk0E35yCmNYNpOxth02rNMrKSTSgSwRhUFoualXUojIG1MRa_LLWMNV9aGNOYKdz2Hs7LdD6KX_QTAmpq6oWP-g3fdQ
ContentType Journal Article
Copyright COPYRIGHT 2023 Neutrosophic Sets and Systems
Copyright_xml – notice: COPYRIGHT 2023 Neutrosophic Sets and Systems
DBID DOA
DOI 10.5281/zenodo.8271401
DatabaseName DOAJ: Directory of Open Access Journals
DatabaseTitleList

Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ: Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Philosophy
EISSN 2331-608X
EndPage 369
ExternalDocumentID oai_doaj_org_article_f78e56d5eba84ea3be5c13972936bba7
A807358669
GroupedDBID 5VS
ABDBF
ACUHS
ADBBV
ALMA_UNASSIGNED_HOLDINGS
AMVHM
BCNDV
ESX
FAEIB
GROUPED_DOAJ
IAO
ITC
KQ8
OK1
PV9
RZL
ID FETCH-LOGICAL-d175t-d1a0ecb3de16427bc8a88cd0ae9e49ab4ec17c84b2e1dc5236e3769bda7bbb4a3
IEDL.DBID DOA
ISSN 2331-6055
IngestDate Fri Oct 03 12:53:35 EDT 2025
Tue Jun 10 21:06:56 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-d175t-d1a0ecb3de16427bc8a88cd0ae9e49ab4ec17c84b2e1dc5236e3769bda7bbb4a3
OpenAccessLink https://doaj.org/article/f78e56d5eba84ea3be5c13972936bba7
PageCount 14
ParticipantIDs doaj_primary_oai_doaj_org_article_f78e56d5eba84ea3be5c13972936bba7
gale_infotracacademiconefile_A807358669
PublicationCentury 2000
PublicationDate 2023-09-01
PublicationDateYYYYMMDD 2023-09-01
PublicationDate_xml – month: 09
  year: 2023
  text: 2023-09-01
  day: 01
PublicationDecade 2020
PublicationTitle Neutrosophic sets and systems
PublicationYear 2023
Publisher Neutrosophic Sets and Systems
University of New Mexico
Publisher_xml – name: Neutrosophic Sets and Systems
– name: University of New Mexico
SSID ssj0001219531
Score 2.240197
Snippet The most well-known subject in graph theory is the shortest path problem (SPP), which has real-world applications in several different fields of study,...
SourceID doaj
gale
SourceType Open Website
Aggregation Database
StartPage 356
SubjectTerms directed graph network
multi-valued neutrosophic numbers
selection sort technique
shortest path problem
Title Calculation of Fuzzy shortest path problem using Multi-valued Neutrosophic number under fuzzy environment
URI https://doaj.org/article/f78e56d5eba84ea3be5c13972936bba7
Volume 57
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAFT
  databaseName: Open Access Digital Library
  customDbUrl:
  eissn: 2331-608X
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0001219531
  issn: 2331-6055
  databaseCode: KQ8
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html
  providerName: Colorado Alliance of Research Libraries
– providerCode: PRVAON
  databaseName: DOAJ: Directory of Open Access Journals
  customDbUrl:
  eissn: 2331-608X
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0001219531
  issn: 2331-6055
  databaseCode: DOA
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVEBS
  databaseName: EBSCOhost Academic Search Ultimate
  customDbUrl: https://search.ebscohost.com/login.aspx?authtype=ip,shib&custid=s3936755&profile=ehost&defaultdb=asn
  eissn: 2331-608X
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0001219531
  issn: 2331-6055
  databaseCode: ABDBF
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://search.ebscohost.com/direct.asp?db=asn
  providerName: EBSCOhost
– providerCode: PRVEBS
  databaseName: EBSCOhost Mathematics Source - HOST
  customDbUrl:
  eissn: 2331-608X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001219531
  issn: 2331-6055
  databaseCode: AMVHM
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://www.ebsco.com/products/research-databases/mathematics-source
  providerName: EBSCOhost
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07a8MwEBYlU5bSJ01faCh0cuOHLEtjGhpCoaFDA9mMTjq3geIU1xmSX1-d7YK3Ll08GCMLnXUP677vY-xOysJhUujA-OonIPqWQJnCBVZYBREd_DkCOL8s5Hwpnlfpqif1RT1hLT1wu3DjIlOYSpciGCXQJICppazFhykJYBoceah0r5hq_67Q8VDUKMslUeBz9rRlbExjFY33WPqa70HFxFYXdWz9nU_uRZfZETvs0kI-aadzzA6wPGHD11-dgd0pW0_Np-20tvim4LPtfr_j3x_ULPtdc1IW5p06DKdm9nfeYGsDYvNGxxe4ratmrLXlrQwIJ_xYxYtmoB7g7YwtZ09v03nQ6SQEzgf_2l9NiBYSh772iTOwyihlXWhQo9AGBNoos0pAjJGzvvKU6N2KBmcyABAmOWeDclPiBeP-uTBSNkOXJsLvf1BOY-FzSC2B2tJG7JHWKv9qqTByIqdubniT5Z3J8r9MNmL3tNI5baG6MtZ0SAA_BSKjyifK-51USakv_-N1V2xIGvFtY9g1G9TVFm98JlHDbfPR_AAfa8sB
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Calculation+of+Fuzzy+shortest+path+problem+using+Multi-valued+Neutrosophic+number+under+fuzzy+environment&rft.jtitle=Neutrosophic+sets+and+systems&rft.au=Prasanta+Kumar+Raut&rft.au=Siva+Prasad+Behera&rft.au=Said+Broumi&rft.au=Debdas+Mishra&rft.date=2023-09-01&rft.pub=University+of+New+Mexico&rft.issn=2331-6055&rft.eissn=2331-608X&rft.volume=57&rft.spage=356&rft.epage=369&rft_id=info:doi/10.5281%2Fzenodo.8271401&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_f78e56d5eba84ea3be5c13972936bba7
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2331-6055&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2331-6055&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2331-6055&client=summon