prikaz prve stranice dokumenta Riješavanje problema putne torbe pomoću genetskih algoritama
  Download
PDF 1.44 MB
undergraduate thesis
Riješavanje problema putne torbe pomoću genetskih algoritama
2022. urn:nbn:hr:200:679037
Gal, Leon
Josip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
Department of Software Engineering
Chair of Visual Computing

Cite this document

Gal, L. (2022). Riješavanje problema putne torbe pomoću genetskih algoritama (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:679037

Gal, Leon. "Riješavanje problema putne torbe pomoću genetskih algoritama." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2022. https://urn.nsk.hr/urn:nbn:hr:200:679037

Gal, Leon. "Riješavanje problema putne torbe pomoću genetskih algoritama." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2022. https://urn.nsk.hr/urn:nbn:hr:200:679037

Gal, L. (2022). 'Riješavanje problema putne torbe pomoću genetskih algoritama', Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, accessed 17 February 2025, https://urn.nsk.hr/urn:nbn:hr:200:679037

Gal L. Riješavanje problema putne torbe pomoću genetskih algoritama [Undergraduate thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek; 2022 [cited 2025 February 17] Available at: https://urn.nsk.hr/urn:nbn:hr:200:679037

L. Gal, "Riješavanje problema putne torbe pomoću genetskih algoritama", Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, Osijek, 2022. Available at: https://urn.nsk.hr/urn:nbn:hr:200:679037

Please login to the repository to save this object to your list.
Metadata
TitleRiješavanje problema putne torbe pomoću genetskih algoritama
Title (english)Solving the knapsack problem using genetic algorithms
AuthorLeon Gal
MentorAlfonzo Baumgartner (mentor)
Committee memberAlfonzo Baumgartner (predsjednik povjerenstva)
Committee memberGoran Knežević (član povjerenstva)
Committee memberDražen Bajer (član povjerenstva)
GranterJosip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
(Department of Software Engineering)
(Chair of Visual Computing)
Osijek
Defense date and country2022-09-07, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Program Engineering
Abstract
Problem putne torbe (engl. knapsack problem) je optimizacijski NP-teški problem kod kojeg se pokušava naći maksimalna vrijednost predmeta koji se mogu staviti u torbu, pod uvjetom da se ne premaši kapacitet torbe. Algoritama za rješavanje je ovog problema je mnogo no pristup rješavanju u ovom radu su genetski algoritmi koji su meta heuristički algoritmi pretraživanja stvoreni po uzoru na prirodnu evoluciju. Konkretno korišten je generacijski algoritam, implementiran u C programskom jeziku, te je odrađena usporedba složenosti i točnosti takvog algoritma s klasičnim pristupom rješavanja.
Abstract (english)
Knapsack problem is one of most popular NP-hard problems in optimization theory, in which the goal is to find right combination of items that produce maximal value so that they do not exceed given knapsack capacity. There are many algorithms for solving this problem, but main approach to solvnig in this paper are genetic algorithms, which are metaheuristic algorithms created along the lines of natual evolution. In particular, a generational algorithm was used, implemented in C programming language, and a comparison of the complexity and accuracy of such algorithm with the classic bruteforce approach of solving was done.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:200:679037
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 on2022-10-13 14:06:20