Return to search

Dvimačio giljotininio pjaustymo sprendimo metodai ir jų tyrimas / Solution and analysis of two dimensions guillotinable cut problem

Pateikti dažniausiai naudojami algoritmai bei pasiūlyti 6 jų pagerinimai. Pasiūlytos euristikos: dviejų stulpelių euristika(2C), vieno stulpelio euristika(1C), rūšiavimas pagal aukštį(SH), rūšiavimas pagal plotį(SW), rūšiavimas pagal plotą(SS) ir rūšiavimas pagal stačiakampių kvadrantingumą(SSN). Eksperimentui buvo pasirinkti septynių skirtingų klasių Hopper and Turton testiniai duomenys (2002). Eksperimento rezultatai įvertinti F-testu, chi-kvadrato testu bei pjaustymo efektyvumu. / During the period of implementation we implemented a number of level heuristics from the literature and proposed possible improvements to some of these algorithms. 6 algorithms were compared in terms of their solution qualities and their ability to obtain the smallest strip height. The results of the analyses of variance indicate that statistically, there is difference between the mean strip heights obtained by the algorithms at a 5% level of significance. The algorithms were also compared in terms of how close the strip heights obtained were to the optimal solution.

Identiferoai:union.ndltd.org:LABT_ETD/oai:elaba.lt:LT-eLABa-0001:E.02~2008~D_20080811_154757-71645
Date11 August 2008
CreatorsRagaišis, Vaidotas
ContributorsTelksnys, Laimutis, Maciulevičius, Stasys, Barauskas, Rimantas, Jasinevičius, Raimundas, Mockus, Jonas, Plėštys, Rimantas, Pranevičius, Henrikas, Rubliauskas, Dalius, Motiejūnas, Kęstutis, Kaunas University of Technology
PublisherLithuanian Academic Libraries Network (LABT), Kaunas University of Technology
Source SetsLithuanian ETD submission system
LanguageLithuanian
Detected LanguageEnglish
TypeMaster thesis
Formatapplication/pdf
Sourcehttp://vddb.library.lt/obj/LT-eLABa-0001:E.02~2008~D_20080811_154757-71645
RightsUnrestricted

Page generated in 0.0025 seconds