prikaz prve stranice dokumenta Algoritmi optimizacije kolonijom mrava
  Download
PDF 615.08 KB
master's thesis
Algoritmi optimizacije kolonijom mrava
Zagreb: University of Zagreb, Faculty of Science, 2018. urn:nbn:hr:217:988806
Hršak, Iva
University of Zagreb
Faculty of Science
Department of Mathematics

Institutional repository: Repository of the Faculty of Science

Cite this document

Hršak, I. (2018). Algoritmi optimizacije kolonijom mrava (Master's thesis). Zagreb: University of Zagreb, Faculty of Science. Retrieved from https://urn.nsk.hr/urn:nbn:hr:217:988806

Hršak, Iva. "Algoritmi optimizacije kolonijom mrava." Master's thesis, University of Zagreb, Faculty of Science, 2018. https://urn.nsk.hr/urn:nbn:hr:217:988806

Hršak, Iva. "Algoritmi optimizacije kolonijom mrava." Master's thesis, University of Zagreb, Faculty of Science, 2018. https://urn.nsk.hr/urn:nbn:hr:217:988806

Hršak, I. (2018). 'Algoritmi optimizacije kolonijom mrava', Master's thesis, University of Zagreb, Faculty of Science, accessed 09 December 2024, https://urn.nsk.hr/urn:nbn:hr:217:988806

Hršak I. Algoritmi optimizacije kolonijom mrava [Master's thesis]. Zagreb: University of Zagreb, Faculty of Science; 2018 [cited 2024 December 09] Available at: https://urn.nsk.hr/urn:nbn:hr:217:988806

I. Hršak, "Algoritmi optimizacije kolonijom mrava", Master's thesis, University of Zagreb, Faculty of Science, Zagreb, 2018. Available at: https://urn.nsk.hr/urn:nbn:hr:217:988806

Metadata
TitleAlgoritmi optimizacije kolonijom mrava
AuthorIva Hršak
MentorSaša Singer (mentor)
Committee memberSaša Singer (predsjednik povjerenstva)
Committee memberMatija Kazalicki (član povjerenstva)
Committee memberTina Bosner (član povjerenstva)
Committee memberOzren Perše (član povjerenstva)
GranterUniversity of Zagreb
Faculty of Science
(Department of Mathematics)
Zagreb
Defense date and country2018-11-27, Croatia
Scientific / art field,
discipline and subdiscipline		NATURAL SCIENCES
Mathematics
Abstract
U ovom radu bavimo se algoritmima optimizacije kolonijom mrava (engl.\ Ant colony optimization, skraćeno ACO). Na početku objašnjavamo od kuda dolazi motivacija za ovakvu vrstu algoritama i dajemo opis ACO metaheuristike i njezine primjene na problem trgovačkog putnika. U nastavku opisujemo tri najpoznatije vrste ACO algoritama, to su: Mravlji sustav, MAX--MIN mravlji sustav i Sustav mravlje kolonije. Također, navodimo sve njihove najvažnije karakteristike. Na kraju, navodimo eksperimentalne rezultate dobivene primjenom algoritama na problem trgovačkog putnika. Na kraju se nalazi i kod ACO algoritama, implementiran u programskom jeziku Python, iz kojeg su dobiveni navedeni rezultati.
Abstract (english)
This paper presents the Ant colony optimization algorithms (ACO). At the beginning, we explain where the motivation for this kind of algorithm comes from and we give a definition of ACO metaheuristics and its application to the travelling salesman problem. Further, we describe the three most successful ACO algorithms: Ant System, MAX-MIN Ant System and Ant Colony System. Also, we describe all their most important characteristics. At the end of this paper we present experimental results obtained by applying algorithms to the travelling salesman problem. Finally, we also give a code, written in Python, which is used to get the experimental results.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:217:988806
Study programmeTitle: Computer Science and Mathematics
Study programme type: university
Study level: graduate
Academic / professional title: magistar/magistra računarstva i matematike (magistar/magistra računarstva i matematike)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2019-04-26 12:54:29