The single line moving target traveling salesman problem with release times
We define and study a variant of the Moving Target Traveling Salesman Problem, with all targets confined to a line and moving at the same speed. Target may appear at different times and the agent’s (salesman’s) objective is to intercept all targets in a minimum of time. We present a polynomial time algorithm to solve this problem.
KeywordsTraveling salesman problem Moving target Release times Dynamic programing
- Hammar, M., & Nilsson, B.J. (1999). Approximation results for kinetic variants of tsp. In International colloquium on automata, languages, and programming (pp. 392–401). Berlin:Springer.Google Scholar
- Jiang, Q., Sarker, R., & Abbass, H. (2005). Tracking moving targets and the non-stationary traveling salesman problem. Complexity International, 11(2005), 171–179.Google Scholar
- Marlow, D.O., Kilby, P., & Mercer, G.N. (2007). The travelling salesman problem in maritime surveillance–techniques, algorithms and analysis. In Proceedings of the international congress on modelling and simulation, pp. 684–690.Google Scholar