prikaz prve stranice dokumenta Metode rješavanja kombinatoričke optimizacije
  Download
PDF 1.35 MB
master's thesis
Metode rješavanja kombinatoričke optimizacije
2019. urn:nbn:hr:137:371841
Korenić, Francesca
University of Pula
Faculty of Informatics in Pula

Cite this document

Korenić, F. (2019). Metode rješavanja kombinatoričke optimizacije (Master's thesis). Pula: University of Pula. Retrieved from https://urn.nsk.hr/urn:nbn:hr:137:371841

Korenić, Francesca. "Metode rješavanja kombinatoričke optimizacije." Master's thesis, University of Pula, 2019. https://urn.nsk.hr/urn:nbn:hr:137:371841

Korenić, Francesca. "Metode rješavanja kombinatoričke optimizacije." Master's thesis, University of Pula, 2019. https://urn.nsk.hr/urn:nbn:hr:137:371841

Korenić, F. (2019). 'Metode rješavanja kombinatoričke optimizacije', Master's thesis, University of Pula, accessed 29 November 2024, https://urn.nsk.hr/urn:nbn:hr:137:371841

Korenić F. Metode rješavanja kombinatoričke optimizacije [Master's thesis]. Pula: University of Pula; 2019 [cited 2024 November 29] Available at: https://urn.nsk.hr/urn:nbn:hr:137:371841

F. Korenić, "Metode rješavanja kombinatoričke optimizacije", Master's thesis, University of Pula, Pula, 2019. Available at: https://urn.nsk.hr/urn:nbn:hr:137:371841

Please login to the repository to save this object to your list.
Metadata
TitleMetode rješavanja kombinatoričke optimizacije
Title (english)Methods for solving the problems of combinatory optimization
AuthorFrancesca Korenić
MentorTihomir Orehovački (mentor)
Committee memberVanja Bevanda (predsjednik povjerenstva)
Committee memberTihomir Orehovački (član povjerenstva)
Committee memberSiniša Miličić (član povjerenstva)
GranterUniversity of Pula
(Faculty of Informatics in Pula)
Pula
Defense date and country2019-09-16, Croatia
Scientific / art field,
discipline and subdiscipline		SOCIAL SCIENCES
Information and Communication Sciences
Information Systems and Information Science
Abstract
Problem trgovačkog putnika je jedan od najpoznatijih i najproučavanijih optimizacijskih problema. Njegov matematički model je traženje Hamiltonovog ciklusa najmanje težine u težinskom grafu. Optimizacija kolonijom mrava je metaheuristika koja se uspješno primjenjuje za rješavanje teških optimizacijskih problema, osobito kombinatoričkih optimizacijskih problema koji pripadaju klasi NP-teških problema. Cilj ovog diplomskog rada je predstaviti problem trgovačkog putnika te proširiti znanje o načinu djelovanja algoritma koji je definiran kolonijom mrava. Također, opisan je i genetski algoritam koji svoju primjenu bazira na prirodnim pojavama.
Abstract (english)
The problem of a traveling salesman is one of the most well-known and most effective for optimization problems. His mathematical model is to search for the Hamilton cycle with the least weight in the weight graph. Ant colony optimization is a metaheuristic that is successfully applied for solving difficult optimization problems, especially combinatorial optimization problems that belong to the group of NP-hard problems. The main goal of this thesis is to present the problem of a traveling salesman and to expand the knowledge of the algorithm defined by the ant colony method. Therefore, this paper is described genetic algorithm which uses its application in natural phenomena.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:137:371841
Study programmeTitle: Informatics; specializations in: Informatics
Course: Informatics
Study programme type: university
Study level: graduate
Academic / professional title: MAGISTAR/MAGISTRA INFORMATIKE - MAG.INF. (MAGISTAR/MAGISTRA INFORMATIKE - MAG.INF.)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2020-02-20 08:48:06