20.500.12556/DKUM-42136 ALGORITMI INTELIGENCE ROJEV PRI REŠEVANJU PROBLEMA TRGOVSKEGA POTNIKA SWARM INTELLIGENCE ALGORITHMS FOR SOLVING THE TRAVELING SALESMAN PROBLEM V diplomskem delu opišemo algoritme inteligence rojev, in sicer optimizacijo z roji delcev in kolonijami mravelj. Pojasnimo izvor algoritmov in njihov osnovni namen, prav tako pa predstavimo izboljšane oziroma prilagojene različice algoritmov. Analizo delovanja algoritmov izvedemo na testnih primerih problema trgovskega potnika, pri čemer kot kriterije primerjave uporabimo kakovost rešitve, porabljen čas in relativno napako. In this thesis, we describe the algorithms of swarm intelligence, namely particle swarm optimization and ant colony optimization. We explain the origin of the algorithms and their primary purpose and also an improved or adjusted versions of those algorithms. Analysis of the performance of algorithms is performed on test cases of the traveling salesman problem with criteria such as quality of solution, computation time and relative error. inteligenca rojev problem trgovskega potnika konvergenca C# swarm intelligence traveling salesman problem convergence C# true true false [T. Klakočer] Slovenski jezik Angleški jezik Diplomsko delo/naloga 2013-09-12 10:14:18 2013-09-19 15:42:39 2022-05-06 03:07:43 2021-04-25 03:18:15 2013 0 Maribor 0 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 004.8.021(043.2) 17499414 URN:SI:UM:DK:2BVAP9XM VS_Klakocer_Tadej_2013.pdf VS_Klakocer_Tadej_2013.pdf 1 3A79EF0D3AD409DAC03A779D89955204 884689fc77e715b1c69e6c752ac750839136b41f9f266119ac974566004cc087 51900cc2-7c0a-11eb-bb7a-00155d0001ca https://dk.um.si/Dokument.php?lang=slv&id=58678 Fakulteta za elektrotehniko, računalništvo in informatiko 0 0 0