The single line moving target traveling salesman problem with release times

  • Michael HassounEmail author
  • Shraga Shoval
  • Eran Simchon
  • Liron Yedidsion
Short Note


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.


Traveling salesman problem Moving target Release times Dynamic programing 



  1. Chalasani, P., & Motwani, R. (1999). Approximating capacitated routing and delivery problems. SIAM Journal on Computing, 28(6), 2133–2149.CrossRefGoogle Scholar
  2. 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
  3. Helvig, C. S., Robins, G., & Zelikovsky, A. (2003). The moving-target traveling salesman problem. Journal of Algorithms, 49(1), 153–174.CrossRefGoogle Scholar
  4. 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
  5. Karuno, Y., Nagamochi, H., & Ibaraki, T. (1997). Vehicle scheduling on a tree with release and handling times. Annals of Operations Research, 69, 193–207.CrossRefGoogle Scholar
  6. 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
  7. Osman, I. H., & Laporte, G. (1996). Metaheuristics: a bibliography. Annals of Operations Research, 63(5), 511–623.CrossRefGoogle Scholar
  8. Psaraftis, H. N., Solomon, M. M., Magnanti, T. L., & Kim, T. U. (1990). Routing and scheduling on a shoreline with release times. Management Science, 36(2), 212–223.CrossRefGoogle Scholar
  9. Tsitsiklis, J. N. (1992). Special cases of traveling salesman and repairman problems with time windows. Networks, 22(3), 263–282.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Department of Industrial Engineering and ManagementAriel UniversityArielIsrael
  2. 2.Faculty of Industrial Engineering and ManagementTechnion - Israel Institute of TechnologyHaifaIsrael
  3. 3.Amazon LogisticsSeattleUSA

Personalised recommendations