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 …
A new formulation of the time-dependent salesman problem is presented which uses n 3 variables and only n constraints.
The time-dependent traveling salesman problem may be stated as a scheduling problem in which n jobs have to be processed at minimum cost on a single machine. The set-up cost associated with each job depends not only on the job …