Results 11  20
of
78
Engineering the labelconstrained shortestpath algorithm
, 2007
"... Abstract. We consider a generalization of the shortestpath problem: given an alphabet Σ, a graph G whose edges are weighted and Σlabeled, and a regular language L ⊆ Σ∗, the Lconstrained shortestpath problem consists of finding a shortest path p in G such that the concatenated labels along p form ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
Abstract. We consider a generalization of the shortestpath problem: given an alphabet Σ, a graph G whose edges are weighted and Σlabeled, and a regular language L ⊆ Σ∗, the Lconstrained shortestpath problem consists of finding a shortest path p in G such that the concatenated labels along p form a word of L. This definition allows to model, e. g., many trafficplanning problems. We present extensions of wellknown speedup techniques for the standard shortestpath problem, and conduct an extensive experimental study of their performance with various networks and language constraints. Our results show that depending on the network type, both goaldirected and bidirectional search speed up the search considerably, while combinations of these do not. 1
Minimum Time and Minimum Cost Path Problems in Street Networks With Periodic Traffic Lights
, 2001
"... This paper investigates minimum time and minimum cost path problems in street networks regulated by periodic traffic lights. We show that the minimum time path problem is polynomially solvable. On the other hand, minimum cost path problems are generally NPhard. Special, realistic, cases which ar ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
This paper investigates minimum time and minimum cost path problems in street networks regulated by periodic traffic lights. We show that the minimum time path problem is polynomially solvable. On the other hand, minimum cost path problems are generally NPhard. Special, realistic, cases which are polynomially solvable are discussed.
Shortest paths in fifo timedependent networks: theory and algorithms
, 2004
"... ..."
(Show Context)
Distributed Intelligence in Large Scale Traffic Simulations on Parallel Computers
 Collective Cognition: Mathematical Foundations of Distributed Intelligence, Santa Fe Institute
, 2002
"... Transportation systems can be seen as displaying metaintelligence, in the sense that intelligent actors (travelers) conspire to make the system function as a whole. ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
(Show Context)
Transportation systems can be seen as displaying metaintelligence, in the sense that intelligent actors (travelers) conspire to make the system function as a whole.
Bidirectional A ∗ Search on TimeDependent Road Networks
, 2010
"... The computation of pointtopoint shortest paths on timedependent road networks has a large practical interest, but very few works propose efficient algorithms for this problem. We propose a novel approach which tackles one of the main complications of route planning in timedependent graphs, which ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
(Show Context)
The computation of pointtopoint shortest paths on timedependent road networks has a large practical interest, but very few works propose efficient algorithms for this problem. We propose a novel approach which tackles one of the main complications of route planning in timedependent graphs, which is the difficulty of using bidirectional search: since the exact arrival time at the destination is unknown, we start a backward search from the destination node using lower bounds on arc costs in order to restrict the set of nodes that have to be explored by the forward search. Our algorithm is based on A ∗ with landmarks (ALT); extensive computational results show that it is very effective in practice if we are willing to accept a small approximation factor, resulting in a speedup of more than one order of magnitude with respect to Dijkstra’s algorithm while finding only slightly suboptimal solutions. The main idea presented here can also be generalized to other types of search algorithms.
On Distributed TimeDependent Shortest Paths over DutyCycled Wireless Sensor Networks
"... Abstract—We revisit the shortest path problem in asynchronous dutycycled wireless sensor networks, which exhibit timedependent features. We model the timevarying link cost and distance from each node to the sink as periodic functions. We show that the timecost function satisfies the FIFO propert ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract—We revisit the shortest path problem in asynchronous dutycycled wireless sensor networks, which exhibit timedependent features. We model the timevarying link cost and distance from each node to the sink as periodic functions. We show that the timecost function satisfies the FIFO property, which makes the timedependent shortest path problem solvable in polynomialtime. Using the βsynchronizer, we propose a fast distributed algorithm to build alltoone shortest paths with polynomial message complexity and time complexity. The algorithm determines the shortest paths for all discrete times with a single execution, in contrast with multiple executions needed by previous solutions. We further propose an efficient distributed algorithm for timedependent shortest path maintenance. The proposed algorithm is loopfree with low message complexity and low space complexity of O(maxdeg), where maxdeg is the maximum degree for all nodes. The performance of our solution is evaluated under diverse network configurations. The results suggest that our algorithm is more efficient than previous solutions in terms of message complexity and space complexity. I.
Fast paths in largescale dynamic road networks
, 2007
"... Efficiently computing fast paths in largescale dynamic road networks (where dynamic traffic information is known over a part of the network) is a practical problem faced by several traffic information service providers who wish to offer a realistic fast path computation to GPS terminal enabled vehi ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Efficiently computing fast paths in largescale dynamic road networks (where dynamic traffic information is known over a part of the network) is a practical problem faced by several traffic information service providers who wish to offer a realistic fast path computation to GPS terminal enabled vehicles. The heuristic solution method we propose is based on a highway hierarchybased shortest path algorithm for static largescale networks; we maintain a static highway hierarchy and perform each query on the dynamically evaluated network, using a simple algorithm to propagate available dynamic traffic information over a larger part of the road network. We provide computational results that show the efficacy of our approach.
ON FINDING PATHS AND FLOWS IN MULTICRITERIA, STOCHASTIC AND TIMEVARYING NETWORKS
"... This dissertation addresses two classes of network flow problems in networks with multiple, stochastic and timevarying attributes. The first problem class is concerned with providing routing instructions with the ability to make updated decisions as information about travel conditions is revealed f ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
This dissertation addresses two classes of network flow problems in networks with multiple, stochastic and timevarying attributes. The first problem class is concerned with providing routing instructions with the ability to make updated decisions as information about travel conditions is revealed for individual travelers in a transportation network. Three exact algorithms are presented for identifying all or a subset of the adaptive Paretooptimal solutions with respect to the expected value of each criterion from each node to a desired destination for each departure time in the period of interest. The second problem class is concerned with problems of determining the optimal set of a priori path flows for evacuation in capacitated networks are addressed, where the timedependent and stochastic nature of arc attributes and capacities inherent in these problems is explicitly considered. The concept of Safest Escape is formulated for developing egress instructions. An exact algorithm is proposed to determine the pattern of flow that maximizes the minimum path probability of successful arrival of supply at the sink While the Safest Escape problem considers stochastic, timevarying capacities,