Applying Dijkstra Algorithm for Solving Neutrosophic Shortest Path Problem

Applying Dijkstra Algorithm for Solving Neutrosophic Shortest Path Problem PDF Author: Said Broumi
Publisher: Infinite Study
ISBN:
Category :
Languages : en
Pages : 5

Get Book

Book Description
The selection of shortest path problem is one the classic problems in graph theory. In literature, many algorithms have been developed to provide a solution for shortest path problem in a network.

Shortest path problem using Bellman algorithm under neutrosophic environment

Shortest path problem using Bellman algorithm under neutrosophic environment PDF Author: Said Broumi
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 8

Get Book

Book Description
An elongation of the single-valued neutrosophic set is an interval-valued neutrosophic set. It has been demonstrated to deal indeterminacy in a decision-making problem. Real-world problems have some kind of uncertainty in nature and among them; one of the influential problems is solving the shortest path problem (SPP) in interconnections. In this contribution, we consider SPP through Bellman’s algorithm for a network using interval-valued neutrosophic numbers (IVNNs). We proposed a novel algorithm to obtain the neutrosophic shortest path between each pair of nodes. Length of all the edges is accredited an IVNN. Moreover, for the validation of the proposed algorithm, a numerical example has been offered. Also, a comparative analysis has been done with the existing methods which exhibit the advantages of the new algorithm.

Shortest Path Solution of Trapezoidal Fuzzy Neutrosophic Graph Based on Circle‐Breaking Algorithm

Shortest Path Solution of Trapezoidal Fuzzy Neutrosophic Graph Based on Circle‐Breaking Algorithm PDF Author: Lehua Yang
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 22

Get Book

Book Description
The shortest path problem is a topic of increasing interest in various scientific fields. The damage to roads and bridges caused by disasters makes traffic routes that can be accurately expressed become indeterminate. A neutrosophic set is a collection of the truth membership, indeterminacy membership, and falsity membership of the constituent elements. It has a symmetric form and indeterminacy membership is their axis of symmetry.

Neutrosophic Shortest Path Problem

Neutrosophic Shortest Path Problem PDF Author: Ranjan Kumar
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 11

Get Book

Book Description
Neutrosophic set theory provides a new tool to handle the uncertainties in shortest path problem (SPP). This paper introduces the SPP from a source node to a destination node on a neutrosophic graph in which a positive neutrosophic number is assigned to each edge as its edge cost. We define this problem as neutrosophic shortest path problem (NSSPP). A simple algorithm is also introduced to solve the NSSPP. The proposed algorithm finds the neutrosophic shortest path (NSSP) and its corresponding neutrosophic shortest path length (NSSPL) between source node and destination node.

Interval Valued Neutrosophic Shortest Path Problem by A* Algorithm

Interval Valued Neutrosophic Shortest Path Problem by A* Algorithm PDF Author: S. Krishna Prabha
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 9

Get Book

Book Description
Many researchers have been proposing various algorithms to unravel different types of fuzzy shortest path problems. There are many algorithms like Dijkstra’s, Bellman-Ford,Floyd-Warshall and kruskal’s etc. are existing for solving the shortest path problems. In this work a shortest path problem with interval valued neutrosophic numbers is investigated using the proposed algorithm. A* algorithm is extensively applied in pathfinding and graph traversal.Unlike the other algorithms mentioned above, A* algorithm entails heuristic function to uncover the cost of path that traverses through the particular state. In the structured work A* algorithm is applied to unravel the length of the shortest path by utilizing ranking function from the source node to the destination node. A* algorithm is executed by applying best first search with the help of this search, it greedily decides which vertex to investigate subsequently. A* is equally complete and optimal if an acceptable heuristic is concerned. The arc lengths in interval valued neutrosophic numbers are defuzzified using the score function. A numerical example is used to illustrate the proposed approach.

Shortest Path Solution of Trapezoidal Fuzzy Neutrosophic Graph Based on Circle-Breaking Algorithm

Shortest Path Solution of Trapezoidal Fuzzy Neutrosophic Graph Based on Circle-Breaking Algorithm PDF Author: Lehua Yang
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 22

Get Book

Book Description
The shortest path problem is a topic of increasing interest in various scientific fields. The damage to roads and bridges caused by disasters makes traffic routes that can be accurately expressed become indeterminate. A neutrosophic set is a collection of the truth membership, indeterminacy membership, and falsity membership of the constituent elements. It has a symmetric form and indeterminacy membership is their axis of symmetry. In uncertain environments, the neutrosophic number can more effectively express the edge distance.

Shortest Path On Interval-Valued Triangular Neutrosophic Fuzzy Graphs With Application

Shortest Path On Interval-Valued Triangular Neutrosophic Fuzzy Graphs With Application PDF Author: K. Kalaiarasi
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 14

Get Book

Book Description
In this article, inaugurate interval-valued triangular neutrosophic fuzzy graph (IVTNFG) of SPP, which is drew on three-sided numbers and IVTNFG. Hear a genuine application is given an illustrative model for IVTNFG. Additionally Shortest way is determined for this model. This present Dijkstra's Algorithm briefest way was checked through Python Jupiter Notebook (adaptation) programming.

The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment

The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment PDF Author: Said Broumi
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 14

Get Book

Book Description
Real-life decision-making problem has been demonstrated to cover the indeterminacy through single valued neutrosophic set. It is the extension of interval valued neutrosophic set. Most of the problems of real life involve some sort of uncertainty in it among which, one of the famous problem is finding a shortest path of the network. In this paper, a new score function is proposed for interval valued neutrosophic numbers and SPP is solved using interval valued neutrosophic numbers. Additionally, novel algorithms are proposed to find the neutrosophic shortest path by considering interval valued neutrosophic number, trapezoidal and triangular interval valued neutrosophic numbers for the length of the path in a network with illustrative example. Further, comparative analysis has been done for the proposed algorithm with the existing method with the shortcoming and advantage of the proposed method and it shows the effectiveness of the proposed algorithm.

Collected Papers. Volume VII

Collected Papers. Volume VII PDF Author: Florentin Smarandache
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 1002

Get Book

Book Description
This seventh volume of Collected Papers includes 70 papers comprising 974 pages on (theoretic and applied) neutrosophics, written between 2013-2021 by the author alone or in collaboration with the following 122 co-authors from 22 countries: Mohamed Abdel-Basset, Abdel-Nasser Hussian, C. Alexander, Mumtaz Ali, Yaman Akbulut, Amir Abdullah, Amira S. Ashour, Assia Bakali, Kousik Bhattacharya, Kainat Bibi, R. N. Boyd, Ümit Budak, Lulu Cai, Cenap Özel, Chang Su Kim, Victor Christianto, Chunlai Du, Chunxin Bo, Rituparna Chutia, Cu Nguyen Giap, Dao The Son, Vinayak Devvrat, Arindam Dey, Partha Pratim Dey, Fahad Alsharari, Feng Yongfei, S. Ganesan, Shivam Ghildiyal, Bibhas C. Giri, Masooma Raza Hashmi, Ahmed Refaat Hawas, Hoang Viet Long, Le Hoang Son, Hongbo Wang, Hongnian Yu, Mihaiela Iliescu, Saeid Jafari, Temitope Gbolahan Jaiyeola, Naeem Jan, R. Jeevitha, Jun Ye, Anup Khan, Madad Khan, Salma Khan, Ilanthenral Kandasamy, W.B. Vasantha Kandasamy, Darjan Karabašević, Kifayat Ullah, Kishore Kumar P.K., Sujit Kumar De, Prasun Kumar Nayak, Malayalan Lathamaheswari, Luong Thi Hong Lan, Anam Luqman, Luu Quoc Dat, Tahir Mahmood, Hafsa M. Malik, Nivetha Martin, Mai Mohamed, Parimala Mani, Mingcong Deng, Mohammed A. Al Shumrani, Mohammad Hamidi, Mohamed Talea, Kalyan Mondal, Muhammad Akram, Muhammad Gulistan, Farshid Mofidnakhaei, Muhammad Shoaib, Muhammad Riaz, Karthika Muthusamy, Nabeela Ishfaq, Deivanayagampillai Nagarajan, Sumera Naz, Nguyen Dinh Hoa, Nguyen Tho Thong, Nguyen Xuan Thao, Noor ul Amin, Dragan Pamučar, Gabrijela Popović, S. Krishna Prabha, Surapati Pramanik, Priya R, Qiaoyan Li, Yaser Saber, Said Broumi, Saima Anis, Saleem Abdullah, Ganeshsree Selvachandran, Abdulkadir Sengür, Seyed Ahmad Edalatpanah, Shahbaz Ali, Shahzaib Ashraf, Shouzhen Zeng, Shio Gai Quek, Shuangwu Zhu, Shumaiza, Sidra Sayed, Sohail Iqbal, Songtao Shao, Sundas Shahzadi, Dragiša Stanujkić, Željko Stević, Udhayakumar Ramalingam, Zunaira Rashid, Hossein Rashmanlou, Rajkumar Verma, Luige Vlădăreanu, Victor Vlădăreanu, Desmond Jun Yi Tey, Selçuk Topal, Naveed Yaqoob, Yanhui Guo, Yee Fei Gan, Yingcang Ma, Young Bae Jun, Yuping Lai, Hafiz Abdul Wahab, Wei Yang, Xiaohong Zhang, Edmundas Kazimieras Zavadskas, Lemnaouar Zedam.

INTERVAL TYPE-2 FUZZY SETS AND INTERVAL NEUTROSOPHIC SETS IN INTELLIGENT SYSTEMS

INTERVAL TYPE-2 FUZZY SETS AND INTERVAL NEUTROSOPHIC SETS IN INTELLIGENT SYSTEMS PDF Author: M. LATHA MAHESWARI M.
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 407

Get Book

Book Description
In this thesis, interval type-2 fuzzy sets (IT2FSs) and interval neutrosophic sets (INSs) have been considered for all the proposed concepts. Fusion of information is an essential task to get the optimized solution for any real world problem. In this task, aggregation operators are playing an important role in all the fields. Since most of the realistic problems have uncertainty in nature, one can use the logic of fuzzy and neutrosophic theory. For the entire proposed concepts interval based logic has been used as it handles more uncertainty.