"Optimering" av ämnesuttag från genomsågade virkesstycken.
Student paper other, 20 credits / 30 HE creditsStudent thesis
This thesis, for the Masters of Science Degree in Computer Science and engineering, deals with the problem of finding an algorithm for the "optimization" of lumber profit when you want to cut out some blanks from a given piece of lumber. Since there are limited resources our main problem is to place as many desired subjects as possible on the "rectangles" which has been cut out from the lumber. We are of the opinion that a good method for this special problem can be a modified version of the one-dimensional Knapsack Problem. We have developed a corresponding algorithm and illustrated by presenting a practical example. We also give a short description of the ALPS-method, but we are convinced that our method, after some further modifications of the algorithm, is the one that suits best for practical purposes and which can be implemented in the present situation
Place, publisher, year, edition, pages
IdentifiersURN: urn:nbn:se:ltu:diva-62388OAI: oai:DiVA.org:ltu-62388DiVA: diva2:1080458