Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
|
|
SLO
|
ENG
|
Cookies and privacy
DKUM
EPF - Faculty of Business and Economics
FE - Faculty of Energy Technology
FERI - Faculty of Electrical Engineering and Computer Science
FF - Faculty of Arts
FGPA - Faculty of Civil Engineering, Transportation Engineering and Architecture
FKBV - Faculty of Agriculture and Life Sciences
FKKT - Faculty of Chemistry and Chemical Engineering
FL - Faculty of Logistic
FNM - Faculty of Natural Sciences and Mathematics
FOV - Faculty of Organizational Sciences in Kranj
FS - Faculty of Mechanical Engineering
FT - Faculty of Tourism
FVV - Faculty of Criminal Justice and Security
FZV - Faculty of Health Sciences
MF - Faculty of Medicine
PEF - Faculty of Education
PF - Faculty of Law
UKM - University of Maribor Library
UM - University of Maribor
UZUM - University of Maribor Press
COBISS
Faculty of Business and Economic, Maribor
Faculty of Agriculture and Life Sciences, Maribor
Faculty of Logistics, Celje, Krško
Faculty of Organizational Sciences, Kranj
Faculty of Criminal Justice and Security, Ljubljana
Faculty of Health Sciences
Library of Technical Faculties, Maribor
Faculty of Medicine, Maribor
Miklošič Library FPNM, Maribor
Faculty of Law, Maribor
University of Maribor Library
Bigger font
|
Smaller font
Introduction
Search
Browsing
Upload document
For students
For employees
Statistics
Login
First page
>
Show document
Show document
Title:
ALGORITMI INTELIGENCE ROJEV PRI REŠEVANJU PROBLEMA TRGOVSKEGA POTNIKA
Authors:
ID
Klakočer, Tadej
(Author)
ID
Strnad, Damjan
(Mentor)
More about this mentor...
ID
Guid, Nikola
(Comentor)
Files:
VS_Klakocer_Tadej_2013.pdf
(2,11 MB)
MD5: 3A79EF0D3AD409DAC03A779D89955204
Language:
Slovenian
Work type:
Bachelor thesis/paper
Typology:
2.11 - Undergraduate Thesis
Organization:
FERI - Faculty of Electrical Engineering and Computer Science
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
,
C#
Place of publishing:
Maribor
Publisher:
[T. Klakočer]
Year of publishing:
2013
PID:
20.500.12556/DKUM-42136
UDC:
004.8.021(043.2)
COBISS.SI-ID:
17499414
NUK URN:
URN:SI:UM:DK:2BVAP9XM
Publication date in DKUM:
19.09.2013
Views:
2387
Downloads:
181
Metadata:
Categories:
KTFMB - FERI
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
KLAKOČER, Tadej, 2013,
ALGORITMI INTELIGENCE ROJEV PRI REŠEVANJU PROBLEMA TRGOVSKEGA POTNIKA
[online]. Bachelor’s thesis. Maribor : T. Klakočer. [Accessed 17 April 2025]. Retrieved from: https://dk.um.si/IzpisGradiva.php?lang=eng&id=42136
Copy citation
Average score:
0.5
1
1.5
2
2.5
3
3.5
4
4.5
5
(0 votes)
Your score:
Voting is allowed only for
logged in
users.
Share:
Similar works from our repository:
Uporaba metod mehkega računanja v proizvodnih sistemih
Algoritmi inteligence rojev pri reševanju problema trgovskega potnika
Algoritem umetne kolonije čebel
Reševanje igre nurikabe s kolonijami mravelj
Praktična metoda za optimalno zasnovo pasovnega temelja z optimizacijo s kolonijo mravelj
Similar works from other repositories:
Optimizacija s kolonijami mravelj
Umetno življenje na primeru kolonije inteligentnih agentov
Učenje odločitvenih pravil z evolucijsko optimizacijo
Hiperautomatizacija: uvedba orodja IBPMS za optimizacijo poslovnih procesov
Problem trgovskega potnika
Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.
Secondary language
Language:
English
Title:
SWARM INTELLIGENCE ALGORITHMS FOR SOLVING THE TRAVELING SALESMAN PROBLEM
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.
Keywords:
swarm intelligence
,
traveling salesman problem
,
convergence
,
C#
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
