Modeliranje in reševanje problema pakiranja vijakov za toplotno obdelavo

diplomsko delo

Ilina Kirovska (Author), Uroš Čibej (Mentor)

Abstract

Problemi pakiranja se pogosto uporabljajo v računalništvu, zaradi tega obstaja veliko načinov, na katerih jih je mogoče rešiti. Diplomska naloga se ukvarja z zelo specifičnim problemom pakiranja. Za toplotno obdelavo želimo optimalno spakirati določeno število mrež vijakov z uporabo natančnega števila škatel. Problem smo formalno zapisali dvonivojsko, kot problem pakiranja košev in problem več nahrbtnikov. Za njegovo reševanje sta uporabljena dva reševalnika OR-Toolsa. Prvi reševalnik je namenjen reševanju problema pakiranja košev, drugi reševanju problema več nahrbtnikov. Rezultate obeh reševalnikov smo glede časa izvajanja in števila optimalnih rešitev primerjali med seboj.

Keywords

algoritem;problem pakiranja košev;problem več nahrbtnikov;reševalnik;univerzitetni študij;diplomske naloge;

Data

Language:	Slovenian
Year of publishing:	2022
Typology:	2.11 - Undergraduate Thesis
Organization:	UL FRI - Faculty of Computer and Information Science
Publisher:	[I. Kirovska]
UDC:	004(043.2)
COBISS:	121845251
Views:	30
Downloads:	9
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	English
Secondary title:	Modelling and solving the problem of screw-packing for heat treatment
Secondary abstract:	Packing problems have many applications in computer science. For this reason, there are numerous ways in which they can be solved. This thesis concerns a very specific packing problem. We want to optimally pack several screw grids into a finite number of boxes. Firstly, the problem was written as a multiple knapsack problem and as a bin packing problem. Secondly, we used two OR-Tools solvers to solve it. One is designed for solving multiple knapsack problems and the other is for solving bin packing problems. Lastly, we compared the results in terms of their execution time and the number of optimal solutions.
Secondary keywords:	algorithm;bin packing problem;multiple knapsack problem;solver;computer science;diploma;Računalništvo;Univerzitetna in visokošolska dela;
Type (COBISS):	Bachelor thesis/paper
Study programme:	1000468
Embargo end date (OpenAIRE):	1970-01-01
Thesis comment:	Univ. v Ljubljani, Fak. za računalništvo in informatiko
Pages:	35 str.
ID:	16391556