prikaz prve stranice dokumenta Rješavanje problema trgovačkog putnika upotrebom pohlepnog algoritma
  Download
PDF 6.11 MB
undergraduate thesis
Rješavanje problema trgovačkog putnika upotrebom pohlepnog algoritma
2022. urn:nbn:hr:126:419418
Bubanj, Deana
Josip Juraj Strossmayer University of Osijek
Department of Mathematics

Cite this document

Bubanj, D. (2022). Rješavanje problema trgovačkog putnika upotrebom pohlepnog algoritma (Undergraduate thesis). Osijek: Josip Juraj Strossmayer University of Osijek, Department of Mathematics. Retrieved from https://urn.nsk.hr/urn:nbn:hr:126:419418

Bubanj, Deana. "Rješavanje problema trgovačkog putnika upotrebom pohlepnog algoritma." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, 2022. https://urn.nsk.hr/urn:nbn:hr:126:419418

Bubanj, Deana. "Rješavanje problema trgovačkog putnika upotrebom pohlepnog algoritma." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, 2022. https://urn.nsk.hr/urn:nbn:hr:126:419418

Bubanj, D. (2022). 'Rješavanje problema trgovačkog putnika upotrebom pohlepnog algoritma', Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, accessed 24 December 2024, https://urn.nsk.hr/urn:nbn:hr:126:419418

Bubanj D. Rješavanje problema trgovačkog putnika upotrebom pohlepnog algoritma [Undergraduate thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Department of Mathematics; 2022 [cited 2024 December 24] Available at: https://urn.nsk.hr/urn:nbn:hr:126:419418

D. Bubanj, "Rješavanje problema trgovačkog putnika upotrebom pohlepnog algoritma", Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, Osijek, 2022. Available at: https://urn.nsk.hr/urn:nbn:hr:126:419418

Please login to the repository to save this object to your list.
Metadata
TitleRješavanje problema trgovačkog putnika upotrebom pohlepnog algoritma
Title (english)Solving the Travelling Salesman Problem using a Greedy Algorithm
AuthorDeana Bubanj
MentorDomagoj Ševerdija (mentor)
GranterJosip Juraj Strossmayer University of Osijek
Department of Mathematics
Osijek
Defense date and country2022-09-30, Croatia
Scientific / art field,
discipline and subdiscipline		NATURAL SCIENCES
Mathematics
Mathematical Logic and Accounting
Abstract
Problem trgovačkog putnika je problem kombinatorne optimizacije kojem je cilj pronaći najkraću rutu u kojoj će se obići svi dani gradovi i vratiti u početni iz kojeg se krenulo. U problemu promatranom u ovom završnom radu, gradovi su zadani preko koordinata, a bridovi koji spajaju dva grada nose unaprijed zadanu težinu. Cilj je da suma težina prijeđenog puta bude minimalna. Problem su prvi put opisali matematičari William Rowan Hamilton i Thomas Kirkman 1800-ih godina. Napravili su igru Icosian game koja se mogla riješiti korištenjem Hamiltonovog ciklusa. Igrač ima na raspolaganju dvadeset točaka i cilj je da pronađe Hamiltonov ciklus tako da svaku točku posjeti jednom i početna točka bude jednaka završnoj. U ovom radu je implementiran pohlepni pristup za rješavanje problema trgovačkog putnika i prikazano je napravljeno grafičko sučelje.
Abstract (english)
The Travelling Salesman Problem is a problem task whose objective is to find the shortest route that includes all given cities and returns to the starting point. The cities of a route are given as coordinates and the edges connecting two cities have a certain weight. The goal is to keep travel costs as low as possible. The problem was first described by mathematicians William Rowan Hamilton and Thomas Kirkman in the 1800s. They created an Icosian game that was solved by finding a Hamiltonian cycle. The player has twenty points available and the goal is to find a Hamiltonian cycle where he visits each point once and the end point is the same as the starting point. In this paper, a greedy approach to solving this problem is implemented and a graphical interface is provided.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:126:419418
Study programmeTitle: Bachelor of Mathematics and Computer Science
Study programme type: university
Study level: undergraduate
Academic / professional title: sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) matematike i računarstva (sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) matematike i računarstva)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2022-11-10 11:05:51