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, 2015, Issue 3, Pages 108–124 (Mi at14201)  

This article is cited in 3 scientific papers (total in 3 papers)

System Analysis and Operations Research

Modifications of the ant colony method for aviation routing problems

Yu. P. Titov

Moscow Aviation Institute, Moscow, Russia
References:
Abstract: We study the ant colony method developed to solve the traveling salesman problem. We consider the possibility to apply the ant colony method to other graph-based problems: to the problem of collecting resources under various constraints and conditions and to the routing problem for several vehicles with the possibility to choose the place where these vehicles are located. We develop an algorithm that implements this method. We give an estimate of the algorithm's efficiency for various problems. The algorithms has proven to converge quickly, and the resulting solution is close to the optimal. This method can be recommended for solving most graph-based problems.
Presented by the member of Editorial Board: P. Yu. Chebotarev

Received: 09.07.2012
English version:
Automation and Remote Control, 2015, Volume 76, Issue 3, Pages 458–471
DOI: https://doi.org/10.1134/S0005117915030091
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: Yu. P. Titov, “Modifications of the ant colony method for aviation routing problems”, Avtomat. i Telemekh., 2015, no. 3, 108–124; Autom. Remote Control, 76:3 (2015), 458–471
Citation in format AMSBIB
\Bibitem{Tit15}
\by Yu.~P.~Titov
\paper Modifications of the ant colony method for aviation routing problems
\jour Avtomat. i Telemekh.
\yr 2015
\issue 3
\pages 108--124
\mathnet{http://mi.mathnet.ru/at14201}
\elib{https://elibrary.ru/item.asp?id=23283651}
\transl
\jour Autom. Remote Control
\yr 2015
\vol 76
\issue 3
\pages 458--471
\crossref{https://doi.org/10.1134/S0005117915030091}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000351234100009}
\elib{https://elibrary.ru/item.asp?id=24016984}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84924778571}
Linking options:
  • https://www.mathnet.ru/eng/at14201
  • https://www.mathnet.ru/eng/at/y2015/i3/p108
  • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:285
    Full-text PDF :172
    References:40
    First page:32
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024