Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Avtomatika i Telemekhanika, 2024, Issue 2, Pages 103–119
DOI: https://doi.org/10.31857/S0005231024020065 (Mi at16359) 		 
Optimization, System Analysis, and Operations Research

Searching for a sub-optimal solution of the dynamic traveling salesman problem using the Monte Carlo method

A. A. Galyaev, E. A. Ryabushev

V. A. Trapeznikov Institute of Control Sciences of Russian Academy of Sciences, Moscow
Full-text PDF (5234 kB) First page
References:
PDF
HTML
DOI: https://doi.org/10.31857/S0005231024020065
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.
Keywords: moving targets traveling salesman problem, combinatorial optimization, interception in simple motions, Monte Carlo algorithm.
Funding agency Grant number
Russian Science Foundation 23-19-00134
Presented by the member of Editorial Board: A. A. Lazarev

Received: 05.10.2023
Revised: 04.12.2023
Accepted: 21.12.2023
English version:
Automation and Remote Control, 2024, Volume 85, Issue 2, Pages 162–173
DOI: https://doi.org/10.1134/S0005117924020048
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: A. A. Galyaev, E. A. Ryabushev, “Searching for a sub-optimal solution of the dynamic traveling salesman problem using the Monte Carlo method”, Avtomat. i Telemekh., 2024, no. 2, 103–119; Autom. Remote Control, 85:2 (2024), 162–173
Citation in format AMSBIB
\Bibitem{GalRya24}
\by A.~A.~Galyaev, E.~A.~Ryabushev
\paper Searching for a sub-optimal solution of the dynamic traveling salesman problem using the Monte Carlo method
\jour Avtomat. i Telemekh.
\yr 2024
\issue 2
\pages 103--119
\mathnet{http://mi.mathnet.ru/at16359}
\crossref{https://doi.org/10.31857/S0005231024020065}
\edn{https://elibrary.ru/UCSGKV}
\transl
\jour Autom. Remote Control
\yr 2024
\vol 85
\issue 2
\pages 162--173
\crossref{https://doi.org/10.1134/S0005117924020048}
Linking options:
  • https://www.mathnet.ru/eng/at16359
  • https://www.mathnet.ru/eng/at/y2024/i2/p103
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Avtomatika i Telemekhanika
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025