prikaz prve stranice dokumenta Prikaz rada algoritma skupine mrava na problemu trgovačkog putnika
No public access
undergraduate thesis
Prikaz rada algoritma skupine mrava na problemu trgovačkog putnika
Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing, 2017. urn:nbn:hr:168:088809
Kelrajter, Mateo
University of Zagreb
Faculty of Electrical Engineering and Computing

Institutional repository: FER Repository

Cite this document

Kelrajter, M. (2017). Prikaz rada algoritma skupine mrava na problemu trgovačkog putnika (Undergraduate thesis). Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing. Retrieved from https://urn.nsk.hr/urn:nbn:hr:168:088809

Kelrajter, Mateo. "Prikaz rada algoritma skupine mrava na problemu trgovačkog putnika." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2017. https://urn.nsk.hr/urn:nbn:hr:168:088809

Kelrajter, Mateo. "Prikaz rada algoritma skupine mrava na problemu trgovačkog putnika." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2017. https://urn.nsk.hr/urn:nbn:hr:168:088809

Kelrajter, M. (2017). 'Prikaz rada algoritma skupine mrava na problemu trgovačkog putnika', Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, accessed 03 May 2024, https://urn.nsk.hr/urn:nbn:hr:168:088809

Kelrajter M. Prikaz rada algoritma skupine mrava na problemu trgovačkog putnika [Undergraduate thesis]. Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing; 2017 [cited 2024 May 03] Available at: https://urn.nsk.hr/urn:nbn:hr:168:088809

M. Kelrajter, "Prikaz rada algoritma skupine mrava na problemu trgovačkog putnika", Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, Zagreb, 2017. Available at: https://urn.nsk.hr/urn:nbn:hr:168:088809

Metadata
TitlePrikaz rada algoritma skupine mrava na problemu trgovačkog putnika
Title (english)Demonstration of Ant Colony Algorithm Applied on Travelling Salesman Problem
AuthorMateo Kelrajter
MentorNikica Hlupić (mentor)
Committee memberNikica Hlupić (predsjednik povjerenstva)
Committee memberDamir Kalpić (član povjerenstva)
Committee memberBoris Milašinović (član povjerenstva)
GranterUniversity of Zagreb
Faculty of Electrical Engineering and Computing
Zagreb
Defense date and country2017-09-13, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Abstract
Problem trgovačkog putnika problem je diskretne kombinatorne optimizacije. Tradicionalne metode rješavanja daju uvijek optimalne rezultate ali su nepogodne kod velikog broja gradova. Zbog velikog broja praktičnih primjena problema trgovačkog putnika postoji veliki interes za pronalaženjem pogodnih metoda rješavanja. Razvojem metoda heuristike javljaju se približni algoritmi. Takvi algoritmi daju približna rješenja problema koja odstupaju od optimalnih ali ih je moguće izvesti u razumnom vremenu. Jedan od takvih algoritama je i algoritam skupine mrava, kojem je inspiracija ponašanje mrava u prirodi. Mravi u prirodi kao i umjetni mravi u algoritmu rješavaju kompleksne probleme iako su vrlo jednostavna stvorenja. Za njihov uspjeh je zaslužna međusobna komunikacija. Algoritam skupine mrava daje rješenja koja odstupaju od optimalnih ali su dobivena u razumnom vremenu.
Abstract (english)
The traveling salesman is a descrete combinatorial optimization problem. Traditional solving methods allways return optimal results, however they are unfavorable for a large number of cities. Becouse there is a great number of practical applications, there is great interest to find favorable solving methods. With the developement of heuristic methods aproximate algorithms emerge. That kind of algorithms give apriximate solutions of problems, which diferentiate slightly from optimal solutions but are able to find solutions in reasonable time. One of those algorithms is ant colony optimization algorithm, which gains inspiration from the behavior of ants in nature. Although the are very simple creatures, nature ants like artificial ants in the algorithm solve complex problems. Ant colony optimization algorithm offers solutions that differ slightly form optimal solutions but are solved in resonable time.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:168:088809
Study programmeTitle: Computing
Study programme type: university
Study level: undergraduate
Academic / professional title: sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva (sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva)
Type of resourceText
File originBorn digital
Access conditionsClosed access
Terms of useLicence In copyright icon
Public note
Created on2019-03-13 21:30:05