Results 101 to 110 of about 1,013,293 (288)
Distributed algorithms from arboreal ants for the shortest path problem. [PDF]
Proc Natl Acad Sci U S A, 2023 Garg S +3 more
europepmc +1 more source
Solving the Robust Shortest Path Problem with Multimodal Transportation
MathematicsThis paper explores the challenges of finding robust shortest paths in multimodal transportation networks. With the increasing complexity and uncertainties in modern transportation systems, developing efficient and reliable routing strategies that can ...
Jinzuo Guo +3 more
doaj +1 more source
A NEW APPROACH ON SHORTEST PATH IN FUZZY ENVIRONMENT [PDF]
ICTACT Journal on Soft Computing, 2010 This paper introduces a new type of fuzzy shortest path network problem using triangular fuzzy number. To find the smallest edge by the fuzzy distance using graded mean integration representation of generalized fuzzy number for every node.
A. Nagoorgani, A. Mumtaj Begam
doaj
On the shortest path problem of uncertain random digraphs. [PDF]
Soft comput, 2022 Li H, Zhang K.
europepmc +1 more source
Extended Dijkstra algorithm and Moore-Bellman-Ford algorithm
, 2017 Study the general single-source shortest path problem. Firstly, define a path function on a set of some path with same source on a graph, and develop a kind of general single-source shortest path problem (GSSSP) on the defined path function.
Cheng, Cong-Dian
core
The time-varying shortest path problem with fuzzy transit costs and speedup
Acta Universitatis Sapientiae: Mathematica, 2016 In this paper, we focus on the time-varying shortest path problem, where the transit costs are fuzzy numbers. Moreover, we consider this problem in which the transit time can be shortened at a fuzzy speedup cost.
Rezapour Hassan, Shirdel Gholamhassan
doaj +1 more source
Computing Homotopic Shortest Paths Efficiently [PDF]
arXiv, 2002 This paper addresses the problem of finding shortest paths homotopic to a given disjoint set of paths that wind amongst point obstacles in the plane. We present a faster algorithm than previously known.
arxiv
K shortest paths in stochastic time-dependent networks [PDF]
A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent.
Andersen, Kim Allan +2 more
core
The Algorithm of the Time-Dependent Shortest Path Problem with Time Windows
, 2014 In this paper, we present a new algorithm of the time-dependent shortest path problem with time windows. Give a directed graph , where V is a set of nodes, E is a set of edges with a non-negative transit-time function .
N. El-Sherbeny
semanticscholar +1 more source
Maximum probability shortest path problem
Discrete Applied Mathematics, 2015 The maximum probability shortest path problem involves the constrained shortest path problem in a given graph where the arcs resources are independent normally distributed random variables. We maximize the probability that all resource constraints are jointly satisfied while the path cost does not exceed a given threshold.
Jianqiang Cheng, Abdel Lisser
openaire +4 more sources