prikaz prve stranice dokumenta Radni okvir za rješavanje problema trgovačkog putnika paralelnim algoritmom kolonije mrava
No public access
undergraduate thesis
Radni okvir za rješavanje problema trgovačkog putnika paralelnim algoritmom kolonije mrava
2020. urn:nbn:hr:168:460704
Rissi, Ivan
University of Zagreb
Faculty of Electrical Engineering and Computing

Cite this document

Rissi, I. (2020). Radni okvir za rješavanje problema trgovačkog putnika paralelnim algoritmom kolonije mrava (Undergraduate thesis). Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing. Retrieved from https://urn.nsk.hr/urn:nbn:hr:168:460704

Rissi, Ivan. "Radni okvir za rješavanje problema trgovačkog putnika paralelnim algoritmom kolonije mrava." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2020. https://urn.nsk.hr/urn:nbn:hr:168:460704

Rissi, Ivan. "Radni okvir za rješavanje problema trgovačkog putnika paralelnim algoritmom kolonije mrava." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2020. https://urn.nsk.hr/urn:nbn:hr:168:460704

Rissi, I. (2020). 'Radni okvir za rješavanje problema trgovačkog putnika paralelnim algoritmom kolonije mrava', Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, accessed 23 February 2025, https://urn.nsk.hr/urn:nbn:hr:168:460704

Rissi I. Radni okvir za rješavanje problema trgovačkog putnika paralelnim algoritmom kolonije mrava [Undergraduate thesis]. Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing; 2020 [cited 2025 February 23] Available at: https://urn.nsk.hr/urn:nbn:hr:168:460704

I. Rissi, "Radni okvir za rješavanje problema trgovačkog putnika paralelnim algoritmom kolonije mrava", Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, Zagreb, 2020. Available at: https://urn.nsk.hr/urn:nbn:hr:168:460704

Please login to the repository to save this object to your list.
Metadata
TitleRadni okvir za rješavanje problema trgovačkog putnika paralelnim algoritmom kolonije mrava
Title (english)Parallel ant colony optimization framework for the travelling salesman problem
AuthorIvan Rissi
MentorMarin Golub (mentor)
Committee memberMarin Golub (predsjednik povjerenstva)
Committee memberKarlo Knežević (član povjerenstva)
Committee memberIva Jurković (član povjerenstva)
GranterUniversity of Zagreb
Faculty of Electrical Engineering and Computing
Zagreb
Defense date and country2020-07-07, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Abstract
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.
Abstract (english)
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.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:168:460704
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 on2023-01-14 09:50:26