Reversibility of the Time-Dependent Shortest Path Problem

Time-dependent shortest path problems arise in a variety of applications; e.g., dynamic traffic assignment (DTA), network control, automobile driver guidance, ship routing and airplane dispatching. In the majority of cases one seeks the cheapest (least generalized cost) or quickest (least time) route between an origin and a destination for a given time of departure. This is the “forward†shortest path problem. In some applications, however, e.g., when dispatching airplanes from airports and in DTA versions of the “morning commute problemâ€, one seeks the cheapest or quickest routes for a given arrival time. This is the “backward†shortest path problem. It is shown that an algorithm that solves the forward quickest path problem on a network with first-in-first-out (FIFO) links also solves the backward quickest path problem on the same network. More generally, any algorithm that solves forward (or backward) problems of a particular type is shown also to solve backward (forward) problems of a conjugate type.