prikaz prve stranice dokumenta Pohlepni algoritmi za rješavanje problema trgovačkog putnika
No public access
undergraduate thesis
Pohlepni algoritmi za rješavanje problema trgovačkog putnika
Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing, 2019. urn:nbn:hr:168:592307
Pejić, Mateo
University of Zagreb
Faculty of Electrical Engineering and Computing

Institutional repository: FER Repository

Cite this document

Pejić, M. (2019). Pohlepni algoritmi za rješavanje problema 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:592307

Pejić, Mateo. "Pohlepni algoritmi za rješavanje problema trgovačkog putnika." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2019. https://urn.nsk.hr/urn:nbn:hr:168:592307

Pejić, Mateo. "Pohlepni algoritmi za rješavanje problema trgovačkog putnika." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2019. https://urn.nsk.hr/urn:nbn:hr:168:592307

Pejić, M. (2019). 'Pohlepni algoritmi za rješavanje problema trgovačkog putnika', Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, accessed 02 December 2024, https://urn.nsk.hr/urn:nbn:hr:168:592307

Pejić M. Pohlepni algoritmi za rješavanje problema trgovačkog putnika [Undergraduate thesis]. Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing; 2019 [cited 2024 December 02] Available at: https://urn.nsk.hr/urn:nbn:hr:168:592307

M. Pejić, "Pohlepni algoritmi za rješavanje problema trgovačkog putnika", Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, Zagreb, 2019. Available at: https://urn.nsk.hr/urn:nbn:hr:168:592307

Metadata
TitlePohlepni algoritmi za rješavanje problema trgovačkog putnika
Title (english)Greedy Algorithms for Solving Travelling Salesman Problem
AuthorMateo Pejić
MentorTomislav Burić (mentor)
Committee memberTomislav Burić (predsjednik povjerenstva)
Committee memberIlko Brnetić (član povjerenstva)
Committee memberJosipa Pina Milišić (član povjerenstva)
GranterUniversity of Zagreb
Faculty of Electrical Engineering and Computing
Zagreb
Defense date and country2019-07-12, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Abstract
Problem trgovačkog putnika je jedan od najčuvenijih i najintrigantijih problema koji se jednostavno modeliraju i preformuliraju pomoću grafova. On gledan kroz prizmu teorije grafova glasi ovako: U potpunom težinskom grafu nađi hamiltonovski ciklus minimalne duljine. Pri rješavanju ovog problema koriste se razne metode među kojima su i pohlepni algoritmi. Prednosti pohlepnih algoritama su jednostavnost, intuitivnost i mala kompleksnost, a nedostaci su kratkovidni pogled (gleda se najbolje rješenje za taj korak) zbog čega ne garantira dobra globalna rješenja, te dosta ovise o instanci problema zbog čega je teško napraviti robustan algoritam koji radi za sve instance problema.
Abstract (english)
Travelling salesman problem is one of the most famous and the most intriguing problems which can be easily modelled using graph theory. When defined by graph theory this problem looks like this: In complete weighted graph find the Hamiltonian cycle of the minimum length. Because travelling salesman problem is Np-hard problem we use a variety of methods to solve it. The simplest methods are greedy algorithms. Benefits of greedy algorithms are simplicity, intuition and small complexity. Disadvantages of greedy algorithms are shortsightedness (they are only looking for the best choice for a next step) and their dependency on instance of a problem, which makes it difficult to create a robust algorithm that works for all instances of the problem.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:168:592307
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 on2020-01-07 21:11:05