29,255 research outputs found
K shortest paths in stochastic time-dependent networks
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. More recently, a growing interest has been attracted by networks that are both stochastic and time-dependent. In these networks, the best route choice is not necessarily a path, but rather a time-adaptive strategy that assigns successors to nodes as a function of time. In some particular cases, the shortest origin-destination path must nevertheless be chosen a priori, since time-adaptive choices are not allowed. Unfortunately, finding the a priori shortest path is NP-hard, while the best time-adaptive strategy can be found in polynomial time. In this paper, we propose a solution method for the a priori shortest path problem, and we show that it can be easily adapted to the ranking of the first K shortest paths. Moreover, we present a computational comparison of time-adaptive and a priori route choices, pointing out the effect of travel time and cost distributions. The reported results show that, under realistic distributions, our solution methods are effectiveShortest paths; K shortest paths; stochastic time-dependent networks; routing; directed hypergraphs
Recommended from our members
Time-dependent stochastic shortest path(s) algorithms for a scheduled transportation network
Following on from our work concerning travellersâ preferences in public transportation networks (Wu and Hartley, 2004), we introduce the concept of stochasticity to our algorithms. Stochasticity greatly increases the complexity of the route finding problem, so greater algorithmic efficiency becomes imperative. Public transportation networks (buses, trains) have two important features: edges can only be traversed at certain points in time and the weights of these edges change in a day and have an uncertainty associated with them. These features determine that a public transportation network is a stochastic and time-dependent network. Finding multiple shortest paths in a both stochastic and time-dependent network is currently regarded as the most difficult task in the route finding problems (Loui, 1983). This paper discusses the use of k-shortest-paths (KSP) algorithms to find optimal route(s) through a network in which the edge weights are defined by probability distributions. A comprehensive review of shortest path(s) algorithms with probabilistic graphs was conducted
A note on âMulticriteria adaptive paths in stochastic, time-varying networksâ
In a recent paper, Opasanon and Miller-Hooks study multicriteria adaptive paths in stochastic time-varying networks. They propose a label correcting algorithm for finding the full set of efficient strategies. In this note we show that their algorithm is not correct, since it is based on a property that does not hold in general. Opasanon and Miller-Hooks also propose an algorithm for solving a parametric problem. We give a simplified algorithm which is linear in the input size.Multiple objective programming; shortest paths; stochastic time-dependent networks; time-adaptive strategies
Finding the K shortest hyperpaths using reoptimization
The shortest hyperpath problem is an extension of the classical shortest path problem and has applications in many different areas. Recently, algorithms for finding the K shortest hyperpaths in a directed hypergraph have been developed by Andersen, Nielsen and Pretolani. In this paper we improve the worst-case computational complexity of an algorithm for finding the K shortest hyperpaths in an acyclic hypergraph. This result is obtained by applying new reoptimization techniques for shortest hyperpaths. The algorithm turns out to be quite effective in practice and has already been successfully applied in the context of stochastic time-dependent networks, for finding the K best strategies and for solving bicriterion problems.Network programming; Directed hypergraphs; K shortest hyperpaths; K shortest paths
Optimal stochastic paths
A shortest-route algorithm for finite networks is modified for application to path-dependent finite networks and to stochastic networks. The type of stochastic network considered has a capture probability associated with each node;The problem of finding a path of minimum expected value on a countable infinite stochastic network is discussed. Conditions are presented under which countable paths have the same minimum expected value as permutation paths;A continuous analog of the countable network, consisting of a hazard function on the plane and curves in the plane, is developed. Two optimality criteria are investigated: stochastic ordering and minimum expected value. Necessary conditions are given for paths to be optimal under the two criteria
Spreading paths in partially observed social networks
Understanding how and how far information, behaviors, or pathogens spread in
social networks is an important problem, having implications for both
predicting the size of epidemics, as well as for planning effective
interventions. There are, however, two main challenges for inferring spreading
paths in real-world networks. One is the practical difficulty of observing a
dynamic process on a network, and the other is the typical constraint of only
partially observing a network. Using a static, structurally realistic social
network as a platform for simulations, we juxtapose three distinct paths: (1)
the stochastic path taken by a simulated spreading process from source to
target; (2) the topologically shortest path in the fully observed network, and
hence the single most likely stochastic path, between the two nodes; and (3)
the topologically shortest path in a partially observed network. In a sampled
network, how closely does the partially observed shortest path (3) emulate the
unobserved spreading path (1)? Although partial observation inflates the length
of the shortest path, the stochastic nature of the spreading process also
frequently derails the dynamic path from the shortest path. We find that the
partially observed shortest path does not necessarily give an inflated estimate
of the length of the process path; in fact, partial observation may,
counterintuitively, make the path seem shorter than it actually is.Comment: 12 pages, 9 figures, 1 tabl
A new algorithm for finding the k shortest transport paths in dynamic stochastic networks
The static K shortest paths (KSP) problem has been resolved. In reality, however, most of the networks are actually dynamic stochastic networks. The state of the arcs and nodes are not only uncertain in dynamic stochastic networks but also interrelated. Furthermore, the cost of the arcs and nodes are subject to a certain probability distribution. The KSP problem is generally regarded as a dynamic stochastic optimization problem. The dynamic stochastic characteristics of the network and the relationships between the arcs and nodes of the network are analyzed in this paper, and the probabilistic shortest path concept is defined. The mathematical optimization model of the dynamic stochastic KSP and a genetic algorithm for solving the dynamic stochastic KSP problem are proposed. A heuristic population initialization algorithm is designed to avoid loops and dead points due to the topological characteristics of the network. The reasonable crossover and mutation operators are designed to avoid the illegal individuals according to the sparsity characteristic of the network. Results show that the proposed model and algorithm can effectively solve the dynamic stochastic KSP problem. The proposed model can also solve the network flow stochastic optimization problems in transportation, communication networks, and other networks
Stochastic Trip Planning in High Dimensional Public Transit Network
This paper proposes a generalised framework for density estimation in large
networks with measurable spatiotemporal variance in edge weights. We solve the
stochastic shortest path problem for a large network by estimating the density
of the edge weights in the network and analytically finding the distribution of
a path. In this study, we employ Gaussian Processes to model the edge weights.
This approach not only reduces the analytical complexity associated with
computing the stochastic shortest path but also yields satisfactory
performance. We also provide an online version of the model that yields a 30
times speedup in the algorithm's runtime while retaining equivalent
performance. As an application of the model, we design a real-time trip
planning system to find the stochastic shortest path between locations in the
public transit network of Delhi. Our observations show that different paths
have different likelihoods of being the shortest path at any given time in a
public transit network. We demonstrate that choosing the stochastic shortest
path over a deterministic shortest path leads to savings in travel time of up
to 40\%. Thus, our model takes a significant step towards creating a reliable
trip planner and increase the confidence of the general public in developing
countries to take up public transit as a primary mode of transportation
- âŚ