Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Prasanta Kumar Raut"'
Publikováno v:
Neutrosophic Sets and Systems, Vol 64, Pp 113-131 (2024)
The shortest path problem is a classic optimization problem in graph theory and computer technology. It involves identifying the shortest path between two nodes in a graph, where each edge has a numerical weight. In this paper, we put our effort into
Externí odkaz:
https://doaj.org/article/63e1e9b067624d5abfb55d6fc1752186
Publikováno v:
Neutrosophic Sets and Systems, Vol 57, Pp 328-341 (2023)
The shortest path (SP) problem (SPP) has several applications in graph theory. It can be used to calculate the distance between the provided initial and final vertex in a network. In this paper, we employed the Fermatean neutrosophic number as the ap
Externí odkaz:
https://doaj.org/article/ed714bfeb59640a3896816922b149017
Publikováno v:
Neutrosophic Sets and Systems, Vol 57, Pp 356-369 (2023)
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.
Externí odkaz:
https://doaj.org/article/f78e56d5eba84ea3be5c13972936bba7
Solving the shortest path problem (SPP) by the Floyd-Warshall algorithm (FWA) is often found in the literature. In this article, we propose a fuzzy Floyd-Warshall algorithm for resolving the SPP in fuzzy circumstances with fuzzy parameters. In realit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::faa3a05c4c73a7b67a75c15bff69d5ef
https://doi.org/10.21203/rs.3.rs-2475745/v1
https://doi.org/10.21203/rs.3.rs-2475745/v1
Publikováno v:
International Journal of Engineering Science Technologies. 6:28-34
In a given network there exist many paths from source to destination, among all selected paths finding the optimal shortest path is a challenging task. In this research paper, we proposed a new concept of particle swarm optimization technique, called
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8c585636e088b6ccefef5a00164346aa
https://doi.org/10.29121/ijoest.v6.i3.2022.330
https://doi.org/10.29121/ijoest.v6.i3.2022.330
Autor:
Siva Behera, Prasanta Kumar Raut
Publikováno v:
International Journal of Reasoning-based Intelligent Systems. 1:1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cbf7c4d7dc84077447db072df6314549
https://doi.org/10.1504/ijris.2023.10053470
https://doi.org/10.1504/ijris.2023.10053470