Optimization methods for nesting problems

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