prikaz prve stranice dokumenta Rješavanje problema trgovačkog putnika upotrebom algoritma najbližeg susjeda
  Download
PDF 6.76 MB
undergraduate thesis
Rješavanje problema trgovačkog putnika upotrebom algoritma najbližeg susjeda
2023. urn:nbn:hr:126:796176
Javor, Ema
Josip Juraj Strossmayer University of Osijek
School of Applied Mathematics and Informatics

Cite this document

Javor, E. (2023). Rješavanje problema trgovačkog putnika upotrebom algoritma najbližeg susjeda (Undergraduate thesis). Osijek: Josip Juraj Strossmayer University of Osijek, School of Applied Mathematics and Informatics. Retrieved from https://urn.nsk.hr/urn:nbn:hr:126:796176

Javor, Ema. "Rješavanje problema trgovačkog putnika upotrebom algoritma najbližeg susjeda." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, School of Applied Mathematics and Informatics, 2023. https://urn.nsk.hr/urn:nbn:hr:126:796176

Javor, Ema. "Rješavanje problema trgovačkog putnika upotrebom algoritma najbližeg susjeda." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, School of Applied Mathematics and Informatics, 2023. https://urn.nsk.hr/urn:nbn:hr:126:796176

Javor, E. (2023). 'Rješavanje problema trgovačkog putnika upotrebom algoritma najbližeg susjeda', Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, School of Applied Mathematics and Informatics, accessed 24 December 2024, https://urn.nsk.hr/urn:nbn:hr:126:796176

Javor E. Rješavanje problema trgovačkog putnika upotrebom algoritma najbližeg susjeda [Undergraduate thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, School of Applied Mathematics and Informatics; 2023 [cited 2024 December 24] Available at: https://urn.nsk.hr/urn:nbn:hr:126:796176

E. Javor, "Rješavanje problema trgovačkog putnika upotrebom algoritma najbližeg susjeda", Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, School of Applied Mathematics and Informatics, Osijek, 2023. Available at: https://urn.nsk.hr/urn:nbn:hr:126:796176

Please login to the repository to save this object to your list.
Metadata
TitleRješavanje problema trgovačkog putnika upotrebom algoritma najbližeg susjeda
Title (english)Solving The travelling Salesman Problem Using The Nearest Neighbor Algorithm
AuthorEma Javor
MentorDomagoj Ševerdija (mentor)
GranterJosip Juraj Strossmayer University of Osijek
School of Applied Mathematics and Informatics
Osijek
Defense date and country2023-09-27, Croatia
Scientific / art field,
discipline and subdiscipline		NATURAL SCIENCES
Mathematics
Financial and Business Mathematics
Abstract
U ovom završnom radu obradit ću problem trgovačkog putnika. To je je problem diskretne i kombinatorne optimizacije u kojem je cilj pronaći najkraću rutu tako da se svi dani gradovi obiđu jednom i nakon toga vrati u početni grad. Naši gradovi su prikazani pomoću koordinata, a bridovi koji ih spajaju imaju unaprijed predodređene težine koje predstavljaju udaljenost između gradova. Svrha rješenja ovog problema jest pronaći najoptimalniji, odnosno da suma težina bridova koje smo prošli bude najmanja moguća. Za rješavanje problema trgovačkog putnika najčešće se koriste heuristički algoritmi kao što su pohlepni algoritam, algoritam najbližeg susjeda, algoritam nasumičnog umetanja, 2-opt, 3-opt... U ovom radu je implementiran i opisan algoritam najbližeg susjeda te je također prikazan izgled napravljenog grafičkog sučelja.
Abstract (english)
In this final thesis, I will address the traveling salesman problem. This is a problem of discrete and combinatorial optimization in which the objective is to find the shortest route that visits all given cities once and then returns to the starting city. Our cities are represented using coordinates, and the edges connecting them have predetermined weights representing the distances between cities. The purpose of solving this problem is to find the most optimal solution, i.e., to minimize the sum of the weights of the edges traveled. Heuristic algorithms such as the greedy algorithm, the nearest neighbor algorithm, the random insertion algorithm, 2-opt, 3-opt, etc., are commonly used to solve the traveling salesman problem. In this paper, the nearest neighbor algorithm is implemented and described, and the appearance of the created graphical interface is also presented.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:126:796176
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 on2023-10-19 11:20:07