20.500.12556/RUL-135075 Sestavljanje športne ekipe z uporabo linearnega programiranja Selecting a sports team using linear programming Sestava optimalne ekipe ob upoštevanju podanih omejitev je zahteven problem celo za vešče in izurjene oči, zato njegova rešitev za športne institucije predstavlja veliko dodano vrednost. Pokazali bomo, da lahko različico problema z eno samo omejitvijo preslikamo na bolj znani problem nahrbtnika (angl. Knapsack problem), za katerega že obstajajo metode reševanja. Predstavili bomo metodo za ocenjevanje kakovosti športnika in celotne ekipe, uvedli pristop linearnega programiranja in predstavili lasten program v programskem okolju Python, ki iz podatkovne množice več deset tisoč igralcev sestavi optimalno ekipo. Zaznali bomo nekatere zakonitosti, ki jih bežni spremljevalec športa morda ne bi spoznal, med njimi npr. prenizko vrednotenje izkušenih igralcev ali previsoko vrednotenje igralcev v EPL. Pridobljene rezultate bomo ocenili ter primerjali z obstoječima, v svetu športa konkurenčnima ekipama. Ugotovili bomo, da so rešitve programa smiselne in da je kakovost sestavljene ekipe odvisna predvsem od števila in strogosti podanih omejitev (manj omejitev nam omogoča sestavo boljše ekipe in obratno). Since the problem of forming an optimal team subject to given constraints is demanding even for skilled and trained eyes, a solution to it represents a great added value to sports institutions. We show that the single-constraint version of the problem is equivalent to the better known knapsack problem, for which there are already methods to solve it. We present a method for assessing the quality of a single player and the entire team, introduce a linear programming approach, and present our own program written in the Python software environment that forms an optimal team from a data set of tens of thousands of players. We evaluate the obtained results and compare them with the existing teams competing in the world of sports. We find out that the results produced by the program make sense and that the quality of the composed team depends mainly on the number and severity of the given constraints (fewer constraints enable us to form a better team and vice versa). Furthermore, we discover a few rules that a casual sports fan might now know, among them, e.g., underestimation of experienced players or overestimation of players in the EPL. Šport celoštevilsko programiranje omejitve problem nahrbtnika. Sports teams integer linear programming constraints limitations knapsack problem. true false false Slovenski jezik Angleški jezik Diplomsko delo/naloga 2022-02-21 11:25:15 2022-02-21 11:25:24 2022-09-14 04:11:31 0000-00-00 00:00:00 2022 0 0 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 32636 98353411 Kozamernik_Rok_-_Sestavljanje_sportne_ekipe_z_uporabo_linearnega_programiranja.pdf Kozamernik_Rok_-_Sestavljanje_sportne_ekipe_z_uporabo_linearnega_programiranja.pdf 1 A5E1A830143DAA31876E780D78EEEF3C b51300b0130e26641a1b15649461c81dae158269adfdc2d2ebb7503eb3e5fc10 53af1e85-9300-11ec-abdb-00155dcfd717 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=153933 Fakulteta za računalništvo in informatiko 0 0 0