Abstract
The paper provides a brief theoretical overview of existing approaches to solving travelling salesman problem. The software implementation of the problem solution using the ant algorithm is performed. The analysis of the time efficiency of the algorithm on different volumes of input data is carried out. Dependency graph is plotted. Further directions of studying this algorithm are determined.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
