Пошук академічних текстів

Інформація × Реєстраційний номер 2124U007977, Матеріали видань та локальних репозитаріїв Категорія Стаття Назва роботи Сomputer tools for solving the traveling salesman problem Автор Pekár JurajBrezina IvanKultan JaroslavUshakova I.Dorokhov O. Дата публікації 13-05-2024 Постачальник інформації Харківський національний економічний університет імені Семена Кузнеця Першоджерело http://repository.hneu.edu.ua/handle/123456789/32514 Видання ХНЕУ ім. С. Кузнеця Опис The task of the traveling salesman, which is to find the shortest or least costly circular route, is one of the most common optimization problems that need to be solved in various fields of practice. The article analyzes and demonstrates various methods for solving this problem using a specific example: heuristic (the nearest neighbor method, the most profitable neighbor method), metaheuristic (evolutionary algorithm), methods of mathematical programming. In addition to classic exact methods (which are difficult to use for large-scale tasks based on existing software) and heuristic methods, the article suggests using the innovative features of the commercially available MS Excel software using a meta-heuristic base. To find the optimal solution using exact methods, the Excel (Solver) software package was used, as well as the specialized GAMS software package. Comparison of different approaches to solving the traveling salesman problem using a practical example showed that the use of traditional heuristic approaches (the nearest neighbor method or the most profitable neighbor method) is not difficult from a computational point of view, but does not provide solutions that would be acceptable in modern conditions. The use of MS Excel for solving the problem using the methods of mathematical programming and metaheuristics enabled us to obtain an optimal solution, which led to the conclusion that modern tools are an appropriate addition to solving the traveling salesman problem while maintaining the quality of the solution. Додано в НРАТ 2025-11-10 Закрити