三角模糊中性信息下的最短路径问题

2016 10th International Conference on Software, Knowledge, Information Management & Applications (SKIMA) Pub Date : 1900-01-01 DOI:10.1109/SKIMA.2016.7916216

S. Broumi, A. Bakali, M. Talea, F. Smarandache, L. Vlădăreanu

{"title":"三角模糊中性信息下的最短路径问题","authors":"S. Broumi, A. Bakali, M. Talea, F. Smarandache, L. Vlădăreanu","doi":"10.1109/SKIMA.2016.7916216","DOIUrl":null,"url":null,"abstract":"In this paper, we develop a new approach to deal with neutrosphic shortest path problem in a network in which each edge weight (or length) is represented as triangular fuzzy neutrosophic number. The proposed algorithm also gives the shortest path length from source node to destination node using ranking function. Finally, an illustrative example is also included to demonstrate our proposed approach.","PeriodicalId":417370,"journal":{"name":"2016 10th International Conference on Software, Knowledge, Information Management & Applications (SKIMA)","volume":"17 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"43","resultStr":"{\"title\":\"Shortest path problem under triangular fuzzy neutrosophic information\",\"authors\":\"S. Broumi, A. Bakali, M. Talea, F. Smarandache, L. Vlădăreanu\",\"doi\":\"10.1109/SKIMA.2016.7916216\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we develop a new approach to deal with neutrosphic shortest path problem in a network in which each edge weight (or length) is represented as triangular fuzzy neutrosophic number. The proposed algorithm also gives the shortest path length from source node to destination node using ranking function. Finally, an illustrative example is also included to demonstrate our proposed approach.\",\"PeriodicalId\":417370,\"journal\":{\"name\":\"2016 10th International Conference on Software, Knowledge, Information Management & Applications (SKIMA)\",\"volume\":\"17 4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"43\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 10th International Conference on Software, Knowledge, Information Management & Applications (SKIMA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SKIMA.2016.7916216\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 10th International Conference on Software, Knowledge, Information Management & Applications (SKIMA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SKIMA.2016.7916216","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 43

摘要

在本文中，我们提出了一种新的方法来处理网络中的中性最短路径问题，其中每条边的权值(或长度)表示为三角形模糊中性数。该算法还利用排序函数给出了源节点到目的节点的最短路径长度。最后，给出了一个示例来说明我们提出的方法。

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

查看原文本刊更多论文

Shortest path problem under triangular fuzzy neutrosophic information

In this paper, we develop a new approach to deal with neutrosphic shortest path problem in a network in which each edge weight (or length) is represented as triangular fuzzy neutrosophic number. The proposed algorithm also gives the shortest path length from source node to destination node using ranking function. Finally, an illustrative example is also included to demonstrate our proposed approach.

求助全文

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

来源期刊

2016 10th International Conference on Software, Knowledge, Information Management & Applications (SKIMA)

自引率

0.00%

发文量