COMPARATIVE ANALYSIS OF HEURISTIC ALGORITHMS USAGE IN THE TRAVELING SALESMAN PROBLEM SOLVING IN TOPOLOGIES

Authors

  • Artur Morozov National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute”, Ukraine
  • Artem Volokyta National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute”, Ukraine

Keywords:

euristic algorithms, traveling salesman problem, topologies, fully connected topology

Abstract

This article discusses the issue of comparing the use of different heuristic algorithms to solve the salesman problem in different topologies. The example in a fully connected topology is given. We analyze different existing topologies and different heuristic algorithms, and conduct a statistical comparison of the results of using these algorithms to solve this problem with different input data.

References

Cilker, B., Orlov, S. (2011). Organization of Computers and Systems: Book for High Schools -2nd edition.(p. 688).

Kureichik, V. (1998). Genetic algorithms - 2nd edition (pp. 5 – 11).

Kureichik, V., Kazharov, A. (2008). About some modifications of an ant algorithm – 4th edition (pp. 7-11).

Levitin, A. (2006). Introduction to The Design & Analysis of Algorithms (p. 141).

Downloads

Published

2023-06-08

Issue

2020

Section

Global Networks, Grid and Cloud