Skip to main content
SpringerLink
Log in

Searching for a Sub-Optimal Solution of the Dynamic Traveling Salesman Problem Using the Monte Carlo Method

  • OPTIMIZATION, SYSTEM ANALYSIS, AND OPERATIONS RESEARCH
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

The problem of drawing up a bypass plan for targets moving rectilinearly to one point for simple movements of an interceptor (traveling salesman) is considered. A new criterion of the problem is proposed based on the initial partition of the possible intercept area, as well as an algorithm for finding a sub-optimal bypass plan based on the construction of a solution search tree by the Monte Carlo method. A numerical implementation of the algorithm has been developed, modeling has been carried out and the obtained plans for bypassing targets have been statistically analyzed.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1.
Fig. 2.
Fig. 3.
Fig. 4.
Fig. 5.
Fig. 6.
Fig. 7.
Fig. 8.
Fig. 9.
Fig. 10.

REFERENCES

  1. Galyaev, A.A., Yakhno, V.P., Berlin, L.M., Lysenko, P.V., and Buzikov, M.E., Optimization of the Interception Plan for Linearly Moving Targets, Autom. Remote Control, 2023, no. 10, pp. 18–36.

  2. Sikharulidze, G.G., On a Generalization of the Traveling Salesman Problem. I, Autom. Remote Control, 1971, no. 8. pp. 116–123.

  3. Sikharulidze, G.G., On a Generalization of the Traveling Salesman Problem. II, Autom. Remote Control, 1971, no. 10. pp. 142–147.

  4. Picard, J.C. and Queyranne, M., The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling, Oper. Res., 1978, vol. 26, no. 1. pp. 86–110. https://doi.org/10.1287/opre.26.L86

    Article  MathSciNet  Google Scholar 

  5. Helvig, C.S., Robins, G., and Zelikovsky, A., The Moving-Target Traveling Salesman Problem, J. Algorithm. Comput. Technol., 2003, vol. 49, no. 1, pp. 153–174. https://doi.org/10.1016/S0196-6774(03)00075-0

    Article  MathSciNet  Google Scholar 

  6. Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco, Calif.: W.H. Freeman & Co., 1979.

    Google Scholar 

  7. Li, C., Yang, M., and Kang, L., A New Approach to Solving Dynamic Traveling Salesman Problems, in Simulated Evolution and Learning, Lecture Notes Comput. Sci., Wang, T.-D. et al., Eds., 2006, vol. 4247, Berlin, Heidelber: Springer.

  8. Archetti, C., Feillet, D., Mor, A., and Speranza, M.G., Dynamic Traveling Salesman Problem with Stochastic Release Dates, Eur. J. Oper., 2020, vol. 280, no. 3, pp. 832–844, ISSN 0377-2217.

  9. Silver, D., Huang, A., Maddison, C., et al., Mastering the Game of Go with Deep Neural Networks and Tree Search, Nature, 2016, vol. 529, pp. 484–489. https://doi.org/10.1038/nature16961

    Article  Google Scholar 

  10. Schadd, M.P.D., Winands, M.H.M., van den Herik, H.J., Chaslot, G.M.J.B., and Uiterwijk, J.W.H.M., Single-Player Monte-Carlo Tree Search, in Computers and Games, CG 2008, Lecture Notes in Computer Science, vol. 5131, Berlin, Heidelberg: Springer.

    Google Scholar 

  11. Mattia Crippa, Pier Luca Lanzi, Fabio Marocchi, An Analysis of Single-Player Monte Carlo Tree Search Performance in Sokoban, Expert Syst. Appl., April 15, 2022, vol. 192, pp. 2–3.

    Article  Google Scholar 

  12. Cotarelo, A., Vicente, G., Edward Rolando, N., Cristian, G., Alberto, G., and Jerry, Ch., Improving Monte Carlo Tree Search with Artificial Neural Networks without Heuristics, Appl. Sci., 2021, vol. 11, no. 5, pp. 2056. https://doi.org/10.3390/app11052056

    Article  Google Scholar 

  13. Marco, K., Beyond  Games:  A  Systematic  Review  of  Neural Monte Carlo Tree Search Applications, arXiv:2303.08060. https://doi.org/10.48550

  14. Auer, P., Cesa-Bianchi, N., and Fischer, P., Finite-time Analysis of the Multiarmed Bandit Problem, Machine Learning, 2002, vol. 47, pp. 235–256. https://doi.org/10.1023/A:1013689704352

    Article  Google Scholar 

  15. Kocsis, L. and Szepesvári, C., Bandit Based Monte-Carlo Planning, in Machine Learning: ECML 2006, Lecture Notes Comput. Sci., vol. 4212, Fürnkranz, J., Scheffer, T., Spiliopoulou, M., Eds., Berlin, Heidelberg: Springer.

  16. Świechowski, M., Godlewski, K., Sawicki, B., et al., Monte Carlo Tree Search: A Review of Recent Modifications and Applications, Artif. Intell. Rev., 2023, vol. 56, pp. 2497–2562. https://doi.org/10.1007/s10462-022-10228-y

    Article  Google Scholar 

Download references

Funding

The work was supported by the Russian Science Foundation, project no. 23-19-00134.

Author information

Authors and Affiliations

  1. Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia

    A. A. Galyaev & E. A. Ryabushev

Authors
  1. A. A. Galyaev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. A. Ryabushev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to A. A. Galyaev or E. A. Ryabushev.

Ethics declarations

The authors of this work declare that they have no conflicts of interest.

Additional information

This paper was recommended for publication by A.A. Lazarev, a member of the Editorial Board

Publisher’s Note.

Pleiades Publishing 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

Galyaev, A.A., Ryabushev, E.A. Searching for a Sub-Optimal Solution of the Dynamic Traveling Salesman Problem Using the Monte Carlo Method. Autom Remote Control 85, 162–173 (2024). https://doi.org/10.1134/S0005117924020048

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117924020048

Keywords:

Search

Navigation