Moving-Target TSP and Related Problems

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 time a set of targets which move with constant velocities. We propose approximate and exact algorithms for several natural variants of Moving-Target TSP. Our implementation is available on the Web.

• Type: Conference
• Year: 1998
• Where: ESA
• Authors: Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky
• Keywords: Algorithms, ESA 1998, Moving-Target TSP, Time-dependent Generalization, Traveling Salesman Problem