用毕达哥拉斯模糊三角数求解最短路径问题

Journal of Neutrosophic and Fuzzy Systems Pub Date : 1900-01-01 DOI:10.54216/jnfs.060205

M. Basha, M. M. Jabarulla, Broumi Said

{"title":"用毕达哥拉斯模糊三角数求解最短路径问题","authors":"M. Basha, M. M. Jabarulla, Broumi Said","doi":"10.54216/jnfs.060205","DOIUrl":null,"url":null,"abstract":"This paper, they developed a new path to compromise with Pythagorean Shortest Path Problem (PSPP) in a network location each edge weight is expressed an Triangular Fuzzy Pythagorean Numbers (TFPNs). Then the Proposed Algorithm (PA) further provide the SP length from the source node (SN) to destination node (DN) from applying a Ranking Function for Pythagorean Fuzzy Numbers (PFN). Certainly, a descriptive example is also included.","PeriodicalId":438286,"journal":{"name":"Journal of Neutrosophic and Fuzzy Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Shortest Path Problem using Pythagorean Fuzzy Triangular Number\",\"authors\":\"M. Basha, M. M. Jabarulla, Broumi Said\",\"doi\":\"10.54216/jnfs.060205\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper, they developed a new path to compromise with Pythagorean Shortest Path Problem (PSPP) in a network location each edge weight is expressed an Triangular Fuzzy Pythagorean Numbers (TFPNs). Then the Proposed Algorithm (PA) further provide the SP length from the source node (SN) to destination node (DN) from applying a Ranking Function for Pythagorean Fuzzy Numbers (PFN). Certainly, a descriptive example is also included.\",\"PeriodicalId\":438286,\"journal\":{\"name\":\"Journal of Neutrosophic and Fuzzy Systems\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Neutrosophic and Fuzzy Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.54216/jnfs.060205\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Neutrosophic and Fuzzy Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.54216/jnfs.060205","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

在本文中，他们开发了一种新的路径来解决毕达哥拉斯最短路径问题(PSPP)，在一个网络位置中，每条边的权值表示为三角模糊毕达哥拉斯数(tfpn)。在此基础上，利用毕达哥拉斯模糊数排序函数(PFN)进一步确定源节点到目的节点的SP长度。当然，还包括一个描述性示例。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Shortest Path Problem using Pythagorean Fuzzy Triangular Number

This paper, they developed a new path to compromise with Pythagorean Shortest Path Problem (PSPP) in a network location each edge weight is expressed an Triangular Fuzzy Pythagorean Numbers (TFPNs). Then the Proposed Algorithm (PA) further provide the SP length from the source node (SN) to destination node (DN) from applying a Ranking Function for Pythagorean Fuzzy Numbers (PFN). Certainly, a descriptive example is also included.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Neutrosophic and Fuzzy Systems

自引率

0.00%

发文量