The time-dependent traveling salesman problem (TDTSP) is a generalization of the classical traveling salesman problem where the cost of any given arc is dependent of its position in the tour. The TDTSP can model several real world applications (e.g., one-machine …
We consider the problem of individual route guidance in an Intelligent Vehicle-Highway Systems (IVHS ) environment, based on time-dependent forecasts of link travel time. We propose a consistency condition which deterministic forecasts should be constrained to satisfy, and show that …
Many research papers have presented mathematical models for vehicle scheduling. Several of these models have been embedded in commercial decision support systems for intra-city vehicle scheduling for launderies, grocery stores, banks, express mail customers, etc. Virtually all of these models …
The time dependent vehicle routing problem (TDVRP) is defined as follows. A vehicle fleet of fixed capacities serves customers of fixed demands from a central depot. Customers are assigned to vehicles and the vehicles routed so that the total time …
This paper discusses vehicle-routeing and scheduling problems subject to time window restriction and time-varying traffic congestion. Time-varying congestion increases the complications of the problems and, in fact, makes it challenging even to find feasible solutions. Numerous heuristics have been developed …
In this paper the shortest-path problem in networks in which the delay (or weight) of the edges changes with time according to arbitrary functions is considered. Algorithms for finding the shortest path and minimum delay under various waiting constraints are …
We examine the two-dimensional minimal time routing problem for a vessel traveling from an origin to several ordered destination points. The sailing space is characterized by time-dependent routing properties. The controls are the power setting and the heading. For the …
In this paper we study the problem of motion planning in the presence of time dependent, i.e. moving, obstacles. More specifically, we will consider the problem: given a body B and a collection of moving obstacles in D-dimensional space decide …
This paper introduces the problem of finding the least expected travel time path between two nodes in a network with travel times that are both random and time-dependent (e.g., a truck, rail, air or bus network). It first shows that …