Skip to main content
SpringerLink
Log in

The single line moving target traveling salesman problem with release times

  • Short Note
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

References

  • Chalasani, P., & Motwani, R. (1999). Approximating capacitated routing and delivery problems. SIAM Journal on Computing, 28(6), 2133–2149.

    Article  Google Scholar 

  • 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.

  • Helvig, C. S., Robins, G., & Zelikovsky, A. (2003). The moving-target traveling salesman problem. Journal of Algorithms, 49(1), 153–174.

    Article  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 

  • Karuno, Y., Nagamochi, H., & Ibaraki, T. (1997). Vehicle scheduling on a tree with release and handling times. Annals of Operations Research, 69, 193–207.

    Article  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.

  • Osman, I. H., & Laporte, G. (1996). Metaheuristics: a bibliography. Annals of Operations Research, 63(5), 511–623.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Tsitsiklis, J. N. (1992). Special cases of traveling salesman and repairman problems with time windows. Networks, 22(3), 263–282.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering and Management, Ariel University, Ariel, Israel

    Michael Hassoun & Shraga Shoval

  2. Faculty of Industrial Engineering and Management, Technion - Israel Institute of Technology, Haifa, Israel

    Eran Simchon

  3. Amazon Logistics, Seattle, WA, USA

    Liron Yedidsion

Authors
  1. Michael Hassoun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shraga Shoval
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Eran Simchon
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Liron Yedidsion
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Michael Hassoun.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hassoun, M., Shoval, S., Simchon, E. et al. The single line moving target traveling salesman problem with release times. Ann Oper Res 289, 449–458 (2020). https://doi.org/10.1007/s10479-019-03412-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-019-03412-x

Keywords

Search

Navigation