In this work, we find that optimizing walking time with time-dependent paths to moving destinations is a computationally challenging problem. In most cases, it turns out as NP-hard, and we find edge cases that are polynomial or permit fully polynomial time approximation. Nonetheless, it is possible to establish fast exact search algorithms.
Unable to display preview. Download preview PDF.