APPLYFICATION OF TRAVELING SALESMAN PROBLEM IN THE TRAFFIC NETWORK

Problem trgovačkog putnika, skraćeno TSP (traveling salesman problem) je jedan od najpoznatijih i najproučavanijih problema kombinatorne optimizacije. Problem trgovačkog putnika javlja se u situacijama kad je potrebno odabrati najpovoljniju rutu (rutu s najmanjim troškovima putovanja) kojom se treba kretati osoba (trgovački putnik) koja obilazi više gradova krećući se iz jednog grada u drugi, a da pri tome svaki grad posjeti samo jedanput. U ovome radu prikazan je problem trgovačkog putnika na konkretnom primjeru koji u jednom radnom danu obilazi pet gradova kako bi u svaki grad došao samo jednom te ih najkraćom mogućom rutom sve obišao.Commercial travel problem, shortened TSP (traveling salesman problem) is one of the best known and most prominent problems of combinatorial optimization. A trade traveler's problem occurs in situations where it is necessary to choose the most advantageous route (the least costly travel route) by which a person (a merchant traveler) traveling through several cities from one city to another should visit, and that each city only visits once . In this final work the problem is displayed on a concrete example when travel salesman visites five cityes so that every city would visists only once in the shortest possible time