Category: <span>Cited by 1st review</span>

An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems

In this article, we propose a solution procedure for the Elementary Shortest Path Problem with Resource Constraints (ESPPRC). A relaxed version of this problem in which the path does not have to be elementary has been the backbone of a …

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 …

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