An article dissertates on application of the graph theory, specifically traveling salesman problem. In paper are describe methods for traveling salesman problem solution. There are method branch and bound, method branch and cut, method branch and price, greedy algorithm, local search method, hill climbing algorithm, method taboo search, method simulated annealing, genetic algorithms, ant colony, bee colony, particle swarm optimization. All methods are described briefly and theoretically.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.