Jozef Kratica
In this paper was described one heuristic for solving "traveling salesman" problem. For that problem exist only algorithms with exponential execution time, which find optimal solution, because "traveling salesman" problem is NP complete. That algorithms are correct theoretically, and easy find solution for small nodes of graph (N<20), but for large number of nodes (N>20) execution time is enormous large.
Therefore, in this paper was described algorithm, which give suboptimal solutions (heuristic), but has polynomial execution time. This algorithm is member of class "greedy heuristics".
Back to Jozef's Papers Home Page | Back to Jozef's Home Page