Zobrazeno 1 - 10
of 16 174
pro vyhledávání: '"Shortest Path Problem"'
Autor:
Bernadette Fina
Publikováno v:
Energy Strategy Reviews, Vol 56, Iss , Pp 101556- (2024)
While electricity-based energy communities (ECs) have received significant scientific attention, heat-based ECs have not gotten the attention they deserve. This paper builds upon the hypothesis that ECs could be a lever to increase the adoption rates
Externí odkaz:
https://doaj.org/article/82195ecc3ec84edba35e8e0f43bce06c
Autor:
Raj, Regilan Soosai ⁎, Hema, Lakshmi Kuppusamy
Publikováno v:
In Expert Systems With Applications 10 March 2025 264
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 63, Pp 82-94 (2024)
Efficiently determining optimal paths and calculating the least travel time within complex networks is of utmost importance in addressing transportation challenges. Several techniques have been developed to identify the most effective routes within g
Externí odkaz:
https://doaj.org/article/84bb259c13dc43acb5beb6101f52abe7
Autor:
Souhail Dhouib
Publikováno v:
Cognitive Robotics, Vol 4, Iss , Pp 62-73 (2024)
The Mobile Robot Path Problem looks to find the optimal shortest path from the starting point to the target point with collision-free for a mobile robot. This is a popular issue in robotics and in this paper the environment is considered as static an
Externí odkaz:
https://doaj.org/article/5844ae52ebce4018b71cd4433f309dbe
Publikováno v:
Digital Communications and Networks, Vol 9, Iss 6, Pp 1340-1350 (2023)
Data center networks may comprise tens or hundreds of thousands of nodes, and, naturally, suffer from frequent software and hardware failures as well as link congestions. Packets are routed along the shortest paths with sufficient resources to facili
Externí odkaz:
https://doaj.org/article/a29767f2a3f844eca4bc1c3a33c74917
Autor:
Shilin Yu, Yuantao Song
Publikováno v:
Complex & Intelligent Systems, Vol 10, Iss 2, Pp 2299-2325 (2023)
Abstract In emergency management, the transportation scheduling of emergency supplies and relief personnel can be regarded as the multi-objective shortest path problem with mixed time window (MOSPPMTW), which has high requirements for timeliness and
Externí odkaz:
https://doaj.org/article/751b087fe41f44f68b59e74458ca1f7b
Publikováno v:
International Journal of Mathematical, Engineering and Management Sciences, Vol 8, Iss 5, Pp 991-1005 (2023)
Shortest path problem (SPP) has various applications in areas such as telecommunications, transportation and emergency services, and postal services among others. As a result, several algorithms have been developed to solve the SPP and related proble
Externí odkaz:
https://doaj.org/article/d9d15cdf76a44d7ead25f6d68f934047
Publikováno v:
Mathematics, Vol 12, Iss 19, p 2995 (2024)
The shortest path problem is fundamental in graph theory and has been studied extensively due to its practical importance. Despite this aspect, finding the shortest path between two nodes remains a significant challenge in many applications, as it of
Externí odkaz:
https://doaj.org/article/23d56d5f80444497b1a1c28f95361af1
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