Riješavanje problema putne torbe pomoću genetskih algoritama

Gal, Leon

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

APA 6th Edition

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

MLA 8th Edition

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

Chicago 17th Edition

Harvard

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 28 March 2024, https://urn.nsk.hr/urn:nbn:hr:200:679037

Vancouver

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 2024 March 28] Available at: https://urn.nsk.hr/urn:nbn:hr:200:679037

IEEE

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

Cite this item: https://urn.nsk.hr/urn:nbn:hr:200:679037

Please login to the repository to save this object to your list.

Metadata

Title	Riješavanje problema putne torbe pomoću genetskih algoritama
Title (english)	Solving the knapsack problem using genetic algorithms
Author	Leon Gal
Mentor	Alfonzo Baumgartner (mentor)
Committee member	Alfonzo Baumgartner (predsjednik povjerenstva)
Committee member	Goran Knežević (član povjerenstva)
Committee member	Dražen Bajer (član povjerenstva)
Granter	Josip 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 country	2022-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)
Language	croatian
URN:NBN	urn:nbn:hr:200:679037
Study programme	Title: 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 resource	Text
File origin	Born digital
Access conditions	Open access
Terms of use
Created on	2022-10-13 14:06:20