Models and algorithms for vehicle routing are usually based on known constant travel times between all relevant locations, an assumption that is far from reality, particularly for urban areas. But the consideration of travel times that vary with the time …
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 …
This work addresses the problem of determining optimal routing decisions in signalized traffic networks, where arc travel times vary over time and are known only probabilistically (i.e. in stochastic, time-varying (STV) networks) and additional delay due to signal operations is …
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 …
Most of the models for vehicle routing reported in the literature assume constant travel times. Clearly, ignoring the fact that the travel time between two locations does not depend only on the distance traveled, but on many other factors including …
Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent generalization of TSP which we call Moving-Target TSP, where a pursuer must intercept in minimum …
In this paper, we apply the stochastic dynamic programming to find the dynamic shortest path from the source node to the sink node in stochastic dynamic networks, in which the arc lengths are independent random variables with exponential distributions. In …
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 …
A problem often considered in Operations Research and Computational Physics is the traveling salesman problem, in which a traveling salesperson has to find the shortest closed tour between a given set of cities touching each city exactly once. The distances …
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. …