diplomsko delo
Peter Kosem (Author), Tadej Kanduč (Mentor)

Abstract

Diplomska naloga obravnava optimizacijo enoinpoldimenzionalnega problema razreza kovinskih kolutov v dana naročila z minimizacijo stroškov razreza. Problema smo se lotili z definiranjem eksaktnega matematičnega modela za mešano celoštevilsko linearno programiranje, ki smo ga nato implementirali v algebraičnem programskem jeziku AMPL, rešili pa z uporabo programske opreme za reševanje optimizacijskih modelov Gurobi. Izdelana programska rešitev je zmanjšala čas priprave in stroške odpada razreza v podjetju.

Keywords

optimizacija;problem razreza;mešani celoštevilski linearni program;interdisciplinarni študij;univerzitetni študij;diplomske naloge;

Data

Language: Slovenian
Year of publishing:
Typology: 2.11 - Undergraduate Thesis
Organization: UL FRI - Faculty of Computer and Information Science
Publisher: [P. Kosem]
UDC: 51:004(043.2)
COBISS: 168472579 Link will open in a new window
Views: 115
Downloads: 12
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: English
Secondary title: 1.5-dimensional cutting stock problem
Secondary abstract: The thesis deals with the optimization of a one-and-a-half-dimensional cutting stock problem for metal coils into given orders while minimizing cutting costs. We tackled the problem by defining an exact mathematical model for mixed integer linear programming, which we then implemented using the AMPL algebraic programming language and solved using the Gurobi optimization software. The developed software solution reduced preparation time and cutting waste costs within the company.
Secondary keywords: optimization;cutting stock probelm;mixed integer linear programming;computer science;computer and information science;computer science and mathematics;interdisciplinary studies;diploma;
Type (COBISS): Bachelor thesis/paper
Study programme: 1000407
Embargo end date (OpenAIRE): 1970-01-01
Thesis comment: Univ. v Ljubljani, Fak. za računalništvo in informatiko
Pages: 45 str.
ID: 19933587