Application of a Modified Ant Colony Imitation Algorithm for the Traveling Salesman Problem with Time Windows When Designing an Intelligent Assistant

As part of this study, an intelligent travel planning system has been developed. It includes an intelligent search module and a module for building the optimal route. The intelligent search module acts as a recommendation system and offers the user sights and interesting places to visit. Based on the data obtained, the optimal route planning module plans a schedule of visits to the selected attractions. In this article, the authors considered an algorithmic approach to solving the traveling salesman problem with time windows, based on the heuristic method of ant colony simulation. The comparative analysis of heuristic methods and the modified method of exhaustive search of vertices in the loaded graph - the method of boundary branches is carried out. The study showed the advantages of the method that we used to build the optimal route between the most attractive places for the user.