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 …
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 …
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 …
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 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 …
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 …
The time-dependent orienteering problem is dual to the time-dependent traveling salesman problem. It consists of visiting a maximum number of sites within a given deadline. The traveling time between two sites is in general dependent on the starting time. For …
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 …
A mathematical model is formulated for the time-dependent vehicle routing problem (TDVRP) and a genetic algorithm (GA) is proposed for solving it. Formulation of the problem considers multiple vehicles with different capacities, pick-up or delivery demands with soft time windows, …