Change search
ReferencesLink to record
Permanent link

Direct link
Optimization methods for nesting problems
University West, Department of Engineering Science, Division of Automation and Computer Engineering.
2013 (English)Independent thesis Advanced level (degree of Master (One Year)), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

Nesting problems have been present for as long as mankind exists. Present days these problems occur in many different industries, e.g. textile, paper, wood, metal and glass industry. These industries produce massive amounts of products to answer the global demand. To minimize the material waste making these products, a good cutting and packing layout is beneficial. The last three decades, researchers have focused on developing methods to solve these problems through computing, instead of solving them manually. Many possible solutions have been found, each method focusing on the specifications of the problem. This thesis had two sub-objectives. The first one was to find the best method for nesting optimization, by doing an intensive literature study. The second sub-objective was to work with a previous made program that is capable of doing optimization tests, containing a nesting optimization method, and try to improve this method to get better results, using the literature study. At a certain point in this project, based on the progress of the literature study and knowledge acquired on the in-house developed program, a decision had to be made either to continue with the previous developed method or to try a new method. A lot of ideas from the literature where used and implemented to improve the method leading to improving results. Hence, the choice was made to continue working with the previous developed method. A new placement strategy was introduced in the program. Additional program code to improve stencil evaluation was added. A proper user interface was created. At the end of this project, a nesting optimization method was obtained, capable of producing a feasible solution when solving a nesting problem, within a reasonable amount of time.

Place, publisher, year, edition, pages
2013. , 49 p.
Keyword [en]
nesting, optimization, cutting and packing, differential evolution
National Category
URN: urn:nbn:se:hv:diva-5470OAI: diva2:631363
Subject / course
Computer enigeering
Educational program
Available from: 2013-07-02 Created: 2013-06-20 Last updated: 2013-07-02Bibliographically approved

Open Access in DiVA

Optimization methods for nesting provblems(1787 kB)934 downloads
File information
File name FULLTEXT01.pdfFile size 1787 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
Division of Automation and Computer Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 937 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 258 hits
ReferencesLink to record
Permanent link

Direct link