diplomsko delo visokošolskega strokovnega študijsekga procesa
Tadej Klakočer (Author), Damjan Strnad (Mentor), Nikola Guid (Co-mentor)

Abstract

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.

Keywords

inteligenca rojev;problem trgovskega potnika;konvergenca;

Data

Language: Slovenian
Year of publishing:
Typology: 2.11 - Undergraduate Thesis
Organization: UM FERI - Faculty of Electrical Engineering and Computer Science
Publisher: [T. Klakočer]
UDC: 004.8.021(043.2)
COBISS: 17499414 Link will open in a new window
Views: 1643
Downloads: 124
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: English
Secondary title: SWARM INTELLIGENCE ALGORITHMS FOR SOLVING THE TRAVELING SALESMAN PROBLEM
Secondary abstract: 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.
Secondary keywords: swarm intelligence;traveling salesman problem;convergence;
URN: URN:SI:UM:
Type (COBISS): Bachelor thesis/paper
Thesis comment: Univ. v Mariboru, Fak. za elektrotehniko, računalništvo in informatiko
Pages: VII, 31 f.
ID: 8727095