Cutting Optimization Pro
Lyle Roblez
In industry, 2D cutting stock problem is one of the most important tasks how to cut sheet material with maximal material yield and minimal waste. This cut list calculator will help you with this issue in real time with couple of clicks. Because cutting stock problem is a subclass of NP-hard problems, it is very time consuming to find optimal solution for complex tasks but also for fairly simple tasks. Heuristics and evolutionary algorithms are much better choice for complex problems. Our cut sheet calculator use these powerful methods so the final solution is really close to optimal solution or is optimal solution.
For hobbyists, tradesmen, small companies or for every personal or commercial entity, who do not require to solve complex sheet cutting optimization problems (when our Free plan is sufficient), we provides our cut optimizer completely FREE OF CHARGE.
Cutting Optimization Pro is a cuttingsoftware used for obtaining optimal cutting layouts for one (1D) and two(2D) dimensional pieces. The software also lets you to define and handlecomplex products, such as table, desk, cupboard, locker, book shelf...
Cutting Optimization Pro can also beused as cutting software for linear pieces such as bars, pipes, tubes, steelbars, metal profiles, extrusions, tubes, lineal wood boards, etc and othermaterials.
Adjustable optimization level- Onemay specify how many layouts to be generated before the solution isoutputted. If you don't have too much time and you don't have a goodcomputer you may set the Optimization Level to a low level. Thisfeature helps you to run your program on any kind of computer (from486 to the best processors available today).
Adjustable limit for breakable parts- No waste will have a size lower than this parameter and no 2 parallelcuts will be closer than this. It is used in order to avoid the breakingof too small material. Useful in glass industry.
Statistics related to the current cut/ layout- At the end of the optimisation process you will have accessto the: number of cuts, cuts definition (starting and ending point),number of waste rectangles, the waste rectangles (the coordinates ofthe top-left and bottom-right corners), number of utilized pieces, theplacement of the utilized pieces, used surface, ...
Desktop application. You are in control of your data. You do not risk loosing data if some distant server fails. You can run the application without problems even if the internet is not working.
Now from here, I export it as an *.ai file (illustrator) and my college openes it in Corel draw, to optimize it for cutting, by manually giving each element a number in which they are to be printed in order to have the laser travel the minimal amout and by that minimizing the print time.
We used to use a sorting routine that David made as a plug-in back in the Rhino 4 days when the cutting order was based on the date of the objects in the file - until the laser cutter manufacturer brought out a better driver that actually managed to do a better job of sorting natively. Unfortunately not all laser cutter drivers have optimized their sorting.
AI and PDF format do not have entities for circles or arc. Neither does CorelDraw.
Instead these are approximated as beziers or splines.
You would get the purest representation of the geometry in a DXF file, which does transfer a true circle and arc entity (assuming you are starting with circles and arcs)
I work for a metallmechanic company, we use AIP2010 & frame generator to build the drawings for manufacturing. We arrange the components of the assembly in the BOM. Here is my question, Has Inventor any add-on to make the distribution for this profiles, I mean, i need to generate layouts to cut the steel shapes (C, L profiles) like for example some software for Optimization of material cutting (i.e. CutLogic 1D, CutList pro, etc...). Has Inventor something like that?
I wanted to make a VBA that creates self-renewing combinations and I actually did it, but Excel was crashing when the combinations increased, unfortunately Excel does not work in multi-item lists. That's why I worked out the codes that create the combinations with C#.I am adding all my work, I think someone who understands software should develop this further.current operation.Cutting lengths in Excel are collected in a list.C# creates self-renewing combinations from numbers whose sum reaches the stock size.selects the largest one and prints it to Excel.The numbers entered in Excel are deleted from the first list and the process is repeated for the remaining cutting dyes. The process repeats until there is no cutting size left in the first list.Remember, I am not a software developer, these codes need to be improved.
I've bee presented with the problem of finding an algorithm to optimize the cutting of a length of pipe into smaller, different lengths.For example, you have standard pipes of 10 meters and you need to cut the following pieces:4 pieces of 0.7 meters3 pieces of 2.1 meters7 of 5 metersetc.The objective is to keep find the optimum order in wich to make the cuts in order to keep the waste to a minimum.
I have a solution, but I am not sure it is the best.First, I make a stack (stack1) with all the lengths, ordered by size with the bigger values at the top.And I define an empty auxiliar stack, stack2The array pipe[n][m] stores the results. n is the pipe number and m are the lengths to be cut from that pipe.Then I do the following procedure (this is pseudocode):
To sum it up: It always attempts to cut the largest requested piece it can. When it can't it goes to the next item and so on. When it runs out of items to try, it begins with a new "virgin" standard lenght of pipe.
This is exactly the same as the Bin Packing Problem and the algorithm that you've chosen is "sometimes known as the first-fit decreasing algorithm"1. That algorithm is designed for speed, but does not always result in an optimal solution.
As an example of why your algorithm isn't optimal, suppose your pipes have length 100 and you need to cut four 34-length pipes and eight 33-length pipes. The right thing to do is cut three pipes into two 33's and a 34. However, your first-fit method will cut two pipes into two 34's, two pipes into three 33's, and one pipe into two 33's.
If there aren't very many useful ways to cut up a pipe (say, at most a few thousand), you can enumerate them all and you get an inequality knapsack problem that's usually not too hard to solve. If there are rather more useful ways to cut up a pipe, there is a famous column generation method due to Gilmore and Gomory that is useful in practice.
I've done some programming before (including designing things like brownian motion simulators, and the like in Processing, which yielded data that could be exported to excel) but I have trouble figuring out how to approach this new problem. Basically I need to design a program solving the 2D bin packing problem involved in glass cutting optimization by the most basic greedy algorithm. The program must take as input the size of glass sheets, the dimensions of needed pieces and their numbers, and then produce a drawing of the optimal arrangement (which minimises the amount of material wasted). The drawing should look similar to Figure 1 from this paper:
I figured that I can take user inputs by using the controlP5 library. My issue is how to practically approach drawing the rectangles and the lines in the right positions? :-S If anyone can offer some step by step guidance about how to conceptualise the problem I'd greatly appreciate! Thanks!
Is the end goal of your project actually real glass cutting, and is it computer-controlled glass-cutting? If so it seems like you should start by implementing the pseudo code in that paper -- it is quite authoritative!
Thanks for the links, I will have a look and try to implement quickly to see how it's working out! But yes, the space-dividing approach seems to make sense for the greedy algorithm! One issue I can foresee is that I am allowed to turn/rotate the rectangles, so basically width and height can change together. I guess I'll be taking this into account in the way I sort the rectangles in the beginning. So as I said, I'll give it a try, and I'll update! Thank you once again! :)
Now this is a little sketch I made. I need to add a few else if statements to take into account cases of rotation, when the width and the height of the pieces can change, + statements in each case to label each rectangle created, color it, etc. but these aren't so important.
Now the essence I think will be the update the list of spaces function. Basically there may be two update List_Spaces functions. One in the case of adding a new bin, and one in the case of an older space being used. When a space is used the function should:
-insert two additional spaces. Basically whenever a space gets used up, it will create two new spaces (even if one of those spaces has an area of 0). Say I just have my sheet and I add a block on it (starting always on the left). I go to the right-most edge of this block and draw a vertical imaginary line. This divides the remaining space into two - one below the block, and another to the right of the block. These two spaces are specified as follows:
Now those two (if they have both non-zero width and height) have to be inserted into List_Spaces. I'm not sure how to do this operation in processing... How would I insert additional elements into the 2d array in the way I have specified above? Furthermore, how would I go about ensuring that the spaces array is always sorted from smallest to largest by biggest side? What would be the commands/way to implement this? I much appreciate the help... it's been a long time since I've worked with processing, and I feel a bit stuck on this. Thanks!
b37509886e