U ovom je radu prikazan način rada mravljih algoritama i njihova primjena na rješavanju problema trgovačkog putnika. Prikazan je i način upotrebe radnog okvira za rješavanje problema trgovačkog putnika paralelnim algoritmima kolonije mrava. Navedene su prednosti i mane implementirane paralelizacije višedretvenošću. Grafički je prikazana i statistika dobivenih rješenja, kao i vremena izvođenja algoritama. This thesis shows the principles of the ant colony optimization algorithms, as well as their usage in solving the travelling salesman problem. The way of using the framework for solving the travelling salesman problem using the parallel ant colony optimization algorithms is also shown. The benefits, as well as the shortcomings of the multi-thread parallelization, are stated in the thesis. The results and execution times statistics of the algorithms are shown in the graphs.
