prikaz prve stranice dokumenta Brzi algoritam za problem trgovačkog putnika u programskom jeziku C++
  Download
PDF 5.09 MB
undergraduate thesis
Brzi algoritam za problem trgovačkog putnika u programskom jeziku C++
Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2021. urn:nbn:hr:200:102507
Vorgić, Amela
Josip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
Department of Core Courses
Chair of Mathematics, Physics and Mechanical Engineering

Institutional repository: Faculty of Electrical Engineering, Computer Science and Information Technology Osijek

Cite this document

Vorgić, A. (2021). Brzi algoritam za problem trgovačkog putnika u programskom jeziku C++ (Undergraduate thesis). Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek. Retrieved from https://urn.nsk.hr/urn:nbn:hr:200:102507

Vorgić, Amela. "Brzi algoritam za problem trgovačkog putnika u programskom jeziku C++." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2021. https://urn.nsk.hr/urn:nbn:hr:200:102507

Vorgić, Amela. "Brzi algoritam za problem trgovačkog putnika u programskom jeziku C++." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2021. https://urn.nsk.hr/urn:nbn:hr:200:102507

Vorgić, A. (2021). 'Brzi algoritam za problem trgovačkog putnika u programskom jeziku C++', Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, accessed 27 November 2024, https://urn.nsk.hr/urn:nbn:hr:200:102507

Vorgić A. Brzi algoritam za problem trgovačkog putnika u programskom jeziku C++ [Undergraduate thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek; 2021 [cited 2024 November 27] Available at: https://urn.nsk.hr/urn:nbn:hr:200:102507

A. Vorgić, "Brzi algoritam za problem trgovačkog putnika u programskom jeziku C++", Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, Osijek, 2021. Available at: https://urn.nsk.hr/urn:nbn:hr:200:102507

Metadata
TitleBrzi algoritam za problem trgovačkog putnika u programskom jeziku C++
Title (english)A fast C++ algorithm for traveling salesman problem
AuthorAmela Vorgić
MentorTomislav Rudec (mentor)
MentorAlfonzo Baumgartner (sumentor)
Committee memberTomislav Rudec (predsjednik povjerenstva)
Committee memberGoran Knežević (član povjerenstva)
Committee memberBruno Zorić (član povjerenstva)
GranterJosip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
(Department of Core Courses)
(Chair of Mathematics, Physics and Mechanical Engineering)
Osijek
Defense date and country2021-09-27, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Program Engineering
Abstract
Cilj ovog završnog rada bio je napisati brzi algoritam za rješavanje problema trgovačkog putnika u programskom jeziku C++. Rad je podijeljen na četiri poglavlja. Nakon predstavljanja samog problema i pregleda teorije grafova kojoj pripada, u radu je prikazan i korišteni programski jezik te radna okolina u kojoj je algoritam nastao. U radu su ostvarena dva algoritma koja su pisana prema metodi dinamičkog programiranja koji problem rješava rastavljajući ga na manje potprobleme te prema metodi najbližeg susjeda koji problem rješava tako što se iz trenutnog vrha kreće prema sebi najbližem. Rezultat programa je minimalni trošak za prelazak cijelog grafa i vraćanje u početni vrh te ruta kojom se po grafu treba kretati kako bi se prešla najmanja ukupna udaljenost u algoritmu prema metodi najbližeg susjeda. Algoritmi su dali zadovoljavajuće rezultate.
Abstract (english)
The goal of this final paper was to write a fast algorithm for solving the problem of a Travelling Salesman Problem in the C ++ programming language. The paper is divided into four chapters. After presenting the problem itself and reviewing the graph theory to which it belongs, the paper presents the used programming language and the integrated development environment in which the algorithm was created. The paper presents algorithms written according to the method of the dynammic programming that solves the problem by breaking it down into smaller subproblems and nearest neighbor method that solves the problem by moving from the current vertex to the nearest one. The result of the program is the minimum cost for traversing the entire graph and returning to the starting vertex, as well as the route to follow along the graph in order to cross the smallest total distance in the algorithm according to the method of the nearest neighbor. Algorithm gave satisfactory results.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:200:102507
Study programmeTitle: Undergraduate University Study Programme in Computer Engineering
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 conditionsOpen access
Terms of useLicence In copyright icon
Created on2021-11-22 13:21:37