Time-dependent routing

Dynamic and stochastic shortest path in transportation networks with two components of travel time uncertainty

The existing dynamic and stochastic shortest path problem (DSSPP) algorithms assume that the mean and variance of link travel time (or other specific random variable such as cost) are available. When they are used with observed data from previous time …

Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks

Travel times in congested transportation networks are time-varying quantities that can at best be known a priori probabilistically. In such networks, the arc weights (travel times) are represented by random variables whose probability distribution functions vary with time. These networks …

Minimum time and minimum cost-path problems in street networks with periodic traffic lights

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 NP-hard. …

A heuristic search approach for a nonstationary stochastic shortest path problem with terminal cost

We present a best-first heuristic search approach for determining an optimal policy for a stochastic shortest path problem. A vehicle is to travel from an origin, starting at time t0, to a destination, where once the destination is reached a …

Incorporating uncertainty and multiple objectives in real-time route selection

There is a requirement in real-time, routing information systems to identify the “optimal” route based on the multiple objectives and the individual decision-making rules of the users. While a number of utility theory-based techniques have been developed to accomplish this …

x
This site uses cookies to make navigation simple and efficient. By continuing you declare that you want to automatically accept the privacy policy. More. Close